file
stringlengths 18
26
| data
stringlengths 2
1.05M
|
|---|---|
the_stack_data/159515646.c
|
/*
* Copyright (c) Meta Platforms, Inc. and its affiliates.
*
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree.
*/
// create `NTHREADS`, all doing (indefinite) blocking futexes, while the thread
// group leader calling `SYS_exit_group`.
// This is to test all blocking futex syscall can be interrupted, and all
// threads can exit gracefully under `SYS_exit_group`.
#include <errno.h>
#include <limits.h>
#include <linux/futex.h>
#include <pthread.h>
#include <stdatomic.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/mman.h>
#include <sys/syscall.h>
#include <sys/time.h>
#include <sys/types.h>
#include <unistd.h>
#define NTHREADS 8
static _Atomic unsigned long counter;
static pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
void* thread_pfn(void* param) {
atomic_fetch_add(&counter, 1);
// Wait for enough time such that the main thread can kill this thread via
// `exit_group`.
pthread_mutex_lock(&mutex);
return NULL;
}
int main(int argc, char* argv[], char* envp[]) {
// Lock, but never unlock the mutex to force all threads to wait. All threads
// will get killed while waiting for for this mutex.
pthread_mutex_lock(&mutex);
pthread_t threads[NTHREADS];
for (int i = 0; i < NTHREADS; i++) {
if (pthread_create(&threads[i], NULL, thread_pfn, NULL) != 0) {
fprintf(
stderr,
"pthread_create to create thread #%d failed: %s\n",
i,
strerror(errno));
abort();
}
}
// Spin while we wait for the threads to finish initializing.
while (atomic_load(&counter) != NTHREADS) {
// Yield so that other threads have a chance to run.
sched_yield();
}
// do SYS_exit_group. All threads should be still blocked by mutex.
// SYS_exit_group should force all threads begin to exit.
syscall(SYS_exit_group, 0);
return 0;
}
|
the_stack_data/1143305.c
|
//Transform string
#include <stdio.h>
void convertCase(char a[]){
for(int i=0;a[i]!='\0';i++){
if(a[i]>='a' && a[i]<='z'){
a[i]=a[i]-32;
}
else if(a[i]>='A' && a[i]<='Z'){
a[i]=a[i]+32;
}
}
}
int main()
{
char a[]="ABCdef";
printf("Input string: %s",a);
convertCase(a);
printf("\nOutput string:%s",a);
return 0;
}
|
the_stack_data/6387370.c
|
/* =============================================================================
** SVN $Id: shr_vmath_fwrap.c 5428 2007-07-10 16:25:08Z erik $
** SVN $URL: https://svn-ccsm-models.cgd.ucar.edu/csm_share/release_tags/cesm1_2_x_n02_share3_130715/shr/shr_vmath_fwrap.c $
** =============================================================================
** Fortran wrappers for shr_vmath calls for systems that only
** provide a C interface to the system vector math routines.
** =============================================================================
*/
#if (defined IRIX64)
void shr_vmath_fwrap_vsqrt_(double *X, double *Y, int *n)
{
vsqrt(X, Y, *n, 1, 1);
}
void shr_vmath_fwrap_vexp_(double *X, double *Y, int *n)
{
vexp(X, Y, *n, 1, 1);
}
void shr_vmath_fwrap_vlog_(double *X, double *Y, int *n)
{
vlog(X, Y, *n, 1, 1);
}
void shr_vmath_fwrap_vsin_(double *X, double *Y, int *n)
{
vsin(X, Y, *n, 1, 1);
}
void shr_vmath_fwrap_vcos_(double *X, double *Y, int *n)
{
vcos(X, Y, *n, 1, 1);
}
#else
/*
The following is only here since empty file won't compile
*/
#include <stdio.h>
void shr_vmath_fwrap_stub_()
{
printf("shr_vmath_fwrap: This stub should NOT be called");
return;
}
#endif
|
the_stack_data/87638100.c
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_strcmp.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: lteresia <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/09/04 14:58:37 by lteresia #+# #+# */
/* Updated: 2021/09/04 15:06:01 by lteresia ### ########.fr */
/* */
/* ************************************************************************** */
int ft_strcmp(char *s1, char *s2)
{
while (*s1 && (*s1 == *s2))
{
s1++;
s2++;
}
return (*s1 - *s2);
}
|
the_stack_data/614311.c
|
#include <stdio.h>
int main(int argc, char const *argv[])
{
int n, triangularNumber;
printf ("TABLE OF TRIANGULAR NUMBERS\n\n");
printf (" n Sum from 1 to n\n");
printf ("--- ---------------\n");
triangularNumber = 0;
for (n = 1; n <= 10; ++n)
{
triangularNumber += n;
printf (" %2i %i\n", n, triangularNumber);
}
return 0;
}
|
the_stack_data/68887823.c
|
#include<stdio.h>
int main(){
int n;
int a;
int p;
int q;
int rowindex;
int columnindex;
scanf("%d",&n);
rowindex=0;
columnindex=0;
p=0;
q=0;
while(rowindex < n){
while(columnindex < n){
scanf("%d",&a);
if(columnindex > rowindex){
p=p+a;
}
else if(columnindex < rowindex){
q=q+a;
}
columnindex=columnindex+1;
}
columnindex=0;
rowindex=rowindex+1;
}
if((p==0) && (q==0)){
printf("2\n");
}
else if(p==0){
printf("-1\n");
}
else if(q==0){
printf("1\n");
}
else{
printf("0\n");
}
return 0;
}
|
the_stack_data/140766767.c
|
#include <stdio.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/socket.h>
#include <fcntl.h>
void main() {
int fd1, fd2, fd3, sd1, sd2, sd3, sd4;
fd1 = open("/etc/passwd", O_RDONLY, 0);
printf("/etc/passwd descripter : %d\n", fd1);
// 추가한 stdio.h 파일
fd3 = open("/usr/include/stdio.h", O_RDONLY, 0);
printf("/usr/include/stdio.h file descripter : %d\n", fd1);
sd1 = socket(PF_INET, SOCK_STREAM, 0);
printf("stream socket desciprter : %d\n", sd1);
sd2 = socket(PF_INET, SOCK_DGRAM, 0);
printf("datagram socket descripter : %d\n", sd2);
fd2 = open("/etc/hosts", O_RDONLY, 0);
printf("/etc/hosts descripter : %d\n", fd2);
// 추가한 TCP 소캣
sd3 = socket(PF_INET, SOCK_STREAM, 0);
printf("stream socket2 descripter : %d\n", sd3);
// 추가한 UDP 소캣
sd4 = socket(PF_INET, SOCK_DGRAM, 0);
printf("datagram socket2 descripter : %d\n", sd4);
close(fd1);
close(sd1);
close(sd2);
close(fd2);
close(fd3);
close(sd3);
close(sd4);
}
|
the_stack_data/35565.c
|
#include <stdio.h>
#include <string.h>
#include <math.h>
#define MAX (1 << 22)
struct cplx {
double real;
double imag;
};
struct cplx c_new(double real, double imag)
{
struct cplx r;
r.real = real;
r.imag = imag;
return r;
}
struct cplx c_sub(struct cplx p, struct cplx q)
{
return c_new(p.real - q.real, p.imag - q.imag);
}
struct cplx c_add(struct cplx p, struct cplx q)
{
return c_new(p.real + q.real, p.imag + q.imag);
}
struct cplx c_mul(struct cplx p, struct cplx q)
{
return c_new(p.real * q.real - p.imag * q.imag,
p.real * q.imag + p.imag * q.real);
}
void c_swap(struct cplx *p, struct cplx *q)
{
struct cplx t = *p;
*p = *q;
*q = t;
}
const double PI = acos(-1);
struct {
int v[MAX];
int n;
} rev;
struct poly {
struct cplx v[MAX][1];
int n;
};
struct poly *p_fft(struct poly *p, int len, int type)
{
int i, j;
int mid;
for (i = 0; i < len; ++i)
if (i < rev.v[i])
c_swap(p->v[i], p->v[rev.v[i]]);
for (mid = 1; mid < len; mid <<= 1) {
struct cplx wn = c_new(cos(PI / mid), type * sin(PI / mid));
for (i = 0; i < len; i += (mid << 1)) {
struct cplx w = c_new(1, 0);
for (j = 0; j < mid; ++j) {
struct cplx x = p->v[i + j][0];
struct cplx y = c_mul(w, p->v[i + mid + j][0]);
p->v[i + j][0] = c_add(x, y);
p->v[i + mid + j][0] = c_sub(x, y);
w = c_mul(w, wn);
}
}
}
return p;
}
struct poly *p_mul(struct poly *ans, struct poly *op1, struct poly *op2)
{
static struct poly tmp;
struct poly *t = (ans == op1 || ans == op2) ? &tmp : ans;
int len = 1;
int lg = 0;
int i;
t->n = op1->n + op2->n;
while (len <= t->n) {
len <<= 1;
++lg;
}
for (; rev.n < len; ++rev.n)
rev.v[rev.n] = (rev.v[rev.n >> 1] >> 1) | ((rev.n & 1) << (lg - 1));
p_fft(op1, len, 1);
p_fft(op2, len, 1);
for (i = 0; i < len; ++i)
t->v[i][0] = c_mul(op1->v[i][0], op2->v[i][0]);
p_fft(t, len, -1);
for (i = 0; i <= t->n; ++i)
t->v[i]->real /= len;
if (ans == op1 || ans == op2)
memcpy(ans, t, sizeof(struct poly));
return ans;
}
int main(void)
{
int i;
static struct poly a[1], b[1], c[1];
#ifdef DEBUG
freopen("in", "r", stdin);
#endif
scanf("%d%d", &a->n, &b->n);
for (i = 0; i <= a->n; ++i)
scanf("%lf", &a->v[i]->real);
for (i = 0; i <= b->n; ++i)
scanf("%lf", &b->v[i]->real);
p_mul(c, a, b);
for (i = 0; i <= c->n; ++i)
printf("%lld ", (long long)(c->v[i]->real + 0.5));
putchar('\n');
return 0;
}
|
the_stack_data/12223.c
|
#include <stdio.h>
#define MONTHS 12
int main(void)
{
int days[MONTHS] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int index;
for (index = 0; index < MONTHS; index++) {
printf("Month %d has %2d days.\n", index + 1, days[index]);
}
return 0;
}
|
the_stack_data/231393746.c
|
// nPr == n! / (n-r)! (permutation formula)
#include <stdio.h>
// n! or (n-r)!
int factorial(int n){
if (n > 1){
return n*factorial(n-1);
}
return 1;
}
int nPr(int n, int r){
int t1 = factorial(n);
int t2 = factorial(n-r);
return t1 / t2;
// printf("%d %d\n", t1,t2);
}
int main(){
printf("%d\n", nPr(4, 2)); // 12
}
|
the_stack_data/165767800.c
|
#include <stdio.h>
int main(void){
const int i_NUMBER = 22;
int count;
for (count = 1; count <= i_NUMBER; count++){
printf("Be my Valentine!\n");
}
return 0;
}
|
the_stack_data/123210.c
|
#include <stdio.h>
int main()
{
int int_var = 5;
int *int_ptr;
int_ptr = &int_var;
}
|
the_stack_data/104556.c
|
#include <stdio.h>
int main()
{
/* Deklaration mit Initalisierung
*/
int anzahl = 2;
double preis = 1.45;
// Ausgabe der Variabeln
printf(" Anzahl: %d\n",anzahl);
printf(" Preis: %f Euro\n",preis);
printf(" Preis: %.2f Euro \n",preis);
return 0;
}
|
the_stack_data/90765486.c
|
//
// main.c
// cs442
//
// Created by hummingbird on 25.05.2018.
// Copyright © 2018 hummingbird. All rights reserved.
//
#include <stdio.h>
int main(int argc, const char * argv[]) {
// insert code here...
printf("Hello, World!\n");
return 0;
}
|
the_stack_data/162644198.c
|
//Classification: n/DAM/NP/sS/D(v)/lc/rp
//Written by: Sergey Pomelov
//Reviewed by: Igor Eremeev
//Comment:
#include <stdio.h>
int main(void)
{
int *p;
static int a;
int i;
for(i=1; i<100; i++) {
a = *p;
printf("%d",a);
}
return 0;
}
|
the_stack_data/48575785.c
|
/* GIMP RGBA C-Source image dump (umaru_left.c) */
const struct {
unsigned int width;
unsigned int height;
unsigned int bytes_per_pixel; /* 2:RGB16, 3:RGB, 4:RGBA */
unsigned char pixel_data[78 * 74 * 4 + 1];
} umaru_chibi_left = {
78, 74, 4,
"\332\313\232\0\335\314\233\0\336\313\234\0\337\314\235\0\340\314\235\0\346"
"\307\231\0\352\277\222\0\351\257\204\377\355\243z\377\355\240u\377\360\240"
"r\377\360\241s\377\356\240r\377\357\240r\377\360\240r\377\357\240r\377\356"
"\240r\377\356\237q\377\360\236q\377\360\236q\377\357\235p\377\361\235n\377"
"\362\233k\377\362\233j\377\362\232g\377\362\232g\377\362\232g\377\362\232"
"h\377\362\231i\377\361\232l\377\360\232n\377\360\231o\377\360\231p\377\335"
"\207_\377\326\201\\\377\323\177Z\377\323\177[\377\322\177[\377\320~Y\377"
"\320~X\377\320~X\377\320~X\377\320~Y\377\317~Z\377\316\177[\377\312~Z\377"
"\306\177[\377\273\207_\377\321\257\203\0\336\305\227\0\336\315\235\0\334"
"\315\235\0\331\315\233\0\335\314\233\0\341\312\233\0\334\307\227\0\326\303"
"\222\0\330\306\225\0\332\310\227\0\332\310\227\0\333\311\231\0\335\314\233"
"\0\336\316\236\0\335\320\241\0\342\326\261\0\356\343\312\0\366\361\344\0"
"\374\372\366\0\377\377\376\0\377\377\377\0\377\377\377\0\377\377\377\0\377"
"\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377"
"\377\0\332\311\231\0\337\313\233\0\341\312\233\0\343\312\233\0\346\312\234"
"\0\362\312\234\377\364\277\222\377\363\254\202\377\370\240x\377\370\235t"
"\377\373\235q\377\372\235q\377\371\235q\377\372\235p\377\372\233o\377\371"
"\234o\377\370\234o\377\370\232m\377\372\232m\377\372\232m\377\372\232l\377"
"\372\231j\377\374\230h\377\374\230g\377\374\227e\377\374\227e\377\374\227"
"e\377\374\227f\377\373\226f\377\373\227i\377\373\227k\377\372\225j\377\371"
"\224j\377\346\203Z\377\336|T\377\331wQ\377\330wS\377\327xS\377\325wR\377"
"\325wQ\377\325wP\377\326wQ\377\327vR\377\325wS\377\325xU\377\324{Y\377\321"
"|Z\377\300~X\377\326\246|\377\347\301\225\0\351\314\236\0\343\313\234\0\334"
"\312\231\0\335\312\231\0\337\311\232\0\337\313\233\0\335\312\231\0\334\311"
"\231\0\327\304\224\0\325\302\222\0\327\304\225\0\332\310\230\0\336\315\235"
"\0\336\320\242\0\344\330\264\0\356\345\315\0\366\363\346\0\374\373\370\0"
"\377\377\376\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377"
"\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\332\310"
"\230\0\336\310\231\0\345\313\234\0\352\310\232\0\355\304\227\377\365\300"
"\224\377\364\265\211\377\367\250~\377\373\236v\377\374\234t\377\376\233s"
"\377\375\234s\377\373\233q\377\375\233p\377\376\232o\377\377\232n\377\377"
"\232m\377\376\231l\377\377\231k\377\375\230i\377\374\230h\377\375\230g\377"
"\374\227f\377\374\227e\377\375\227e\377\375\227e\377\373\226d\377\373\225"
"e\377\373\225f\377\374\225g\377\374\225g\377\374\225g\377\373\224g\377\352"
"\204W\377\340{N\377\336{Q\377\335|T\377\333|S\377\331{R\377\330{R\377\327"
"{R\377\333zR\377\337zS\377\333zS\377\327{T\377\324zU\377\323zW\377\322\204"
"_\377\341\235w\377\366\273\223\377\360\276\224\0\352\302\224\0\344\305\224"
"\0\342\307\227\0\335\307\230\0\340\313\232\0\337\313\232\0\335\311\230\0"
"\331\305\225\0\325\300\221\0\326\301\223\0\332\306\230\0\337\313\235\0\337"
"\317\242\0\344\327\264\0\357\346\316\0\367\363\351\0\375\374\371\0\377\377"
"\376\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377"
"\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\326\304\224\0"
"\333\303\224\0\342\304\226\0\341\267\212\0\350\262\207\377\356\255\202\377"
"\363\250|\377\366\241w\377\374\234s\377\375\232r\377\376\232r\377\375\232"
"q\377\375\232q\377\376\232p\377\377\231n\377\377\230m\377\377\230l\377\377"
"\227j\377\377\227i\377\376\230h\377\376\230g\377\375\227e\377\375\227e\377"
"\375\227e\377\375\227e\377\375\227e\377\374\225d\377\374\225e\377\373\224"
"e\377\375\225f\377\375\223e\377\375\223e\377\373\222d\377\367\217`\377\362"
"\213\\\377\354\207[\377\352\210]\377\351\210]\377\352\212^\377\352\213_\377"
"\351\213_\377\356\212`\377\362\210`\377\350\204\\\377\335\177W\377\326zS"
"\377\325zU\377\321yU\377\345\222m\377\357\244}\377\351\246}\377\347\261\204"
"\0\351\301\220\0\346\306\226\0\337\310\230\0\337\311\231\0\336\312\230\0"
"\335\311\230\0\334\307\230\0\330\304\225\0\332\305\227\0\333\306\231\0\334"
"\307\232\0\335\312\235\0\343\325\260\0\355\344\314\0\367\363\347\0\374\374"
"\370\0\377\377\376\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377"
"\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0"
"\333\313\232\0\333\302\222\0\340\275\217\0\341\256\202\377\347\243y\377\361"
"\244y\377\370\240v\377\371\235r\377\373\233p\377\374\233p\377\374\233p\377"
"\375\233p\377\375\232p\377\374\231n\377\375\231n\377\375\231n\377\375\231"
"m\377\375\230k\377\375\230j\377\375\230i\377\374\227g\377\374\227f\377\375"
"\227e\377\375\227e\377\375\227e\377\375\227e\377\374\225d\377\374\225e\377"
"\373\224e\377\374\224e\377\375\223e\377\375\223e\377\373\222d\377\373\222"
"d\377\373\222d\377\372\223e\377\365\216a\377\371\223e\377\370\223d\377\367"
"\224e\377\367\225g\377\372\222f\377\377\221g\377\363\213c\377\344\203\\\377"
"\332zT\377\326wR\377\326xS\377\343\206a\377\357\230q\377\351\227n\377\344"
"\243v\377\353\273\211\0\351\305\224\0\340\311\227\0\337\312\230\0\335\311"
"\230\0\336\312\233\0\337\313\235\0\335\310\233\0\334\307\232\0\330\304\226"
"\0\327\302\226\0\332\306\231\0\341\321\253\0\354\342\310\0\366\361\343\0"
"\375\373\370\0\377\376\376\0\377\377\377\0\377\377\377\0\377\377\377\0\377"
"\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377"
"\377\0\340\317\237\0\337\303\225\0\341\273\216\0\342\254\200\377\353\244"
"y\377\362\242x\377\370\237u\377\367\236r\377\366\234p\377\365\233o\377\367"
"\234p\377\370\234p\377\370\234p\377\367\233o\377\367\233o\377\367\233o\377"
"\367\233n\377\370\231l\377\372\231k\377\372\227h\377\373\227g\377\374\227"
"g\377\375\227f\377\375\227e\377\375\227e\377\375\227e\377\374\225d\377\374"
"\225e\377\373\224e\377\374\224e\377\375\223e\377\375\223e\377\373\222d\377"
"\372\221c\377\371\220a\377\370\222c\377\367\223e\377\363\223e\377\357\223"
"d\377\360\223d\377\360\222d\377\367\220c\377\376\216c\377\370\216e\377\350"
"\205]\377\340~X\377\326uP\377\331wR\377\350\206a\377\367\227p\377\362\226"
"l\377\351\235p\377\356\262\201\377\357\302\220\0\351\313\230\0\341\310\226"
"\0\341\314\234\0\341\314\235\0\341\314\236\0\341\314\236\0\337\313\235\0"
"\333\306\230\0\326\301\224\0\332\306\231\0\340\320\245\0\351\336\302\0\364"
"\356\336\0\373\372\364\0\376\376\375\0\377\377\377\0\377\377\377\0\377\377"
"\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377"
"\0\377\377\377\0\340\314\234\0\342\305\227\0\346\300\224\0\356\271\216\377"
"\362\257\205\377\364\254\201\377\370\251\177\377\367\251~\377\367\252}\377"
"\370\251}\377\370\251}\377\371\251}\377\372\251}\377\371\251}\377\371\251"
"}\377\371\251|\377\371\251{\377\371\245v\377\366\233l\377\370\231j\377\372"
"\227g\377\374\227g\377\375\226g\377\375\226f\377\375\227e\377\375\227e\377"
"\374\225d\377\374\225e\377\373\224e\377\374\224e\377\375\223e\377\375\223"
"e\377\373\222d\377\372\221c\377\371\220a\377\363\222d\377\363\231l\377\362"
"\241u\377\356\246{\377\361\244x\377\361\237r\377\370\227k\377\376\216b\377"
"\372\217d\377\351\205[\377\334zQ\377\325tM\377\330vO\377\353\207`\377\372"
"\227m\377\367\225i\377\357\232l\377\367\256~\377\363\270\207\0\350\273\211"
"\0\343\302\222\0\335\310\231\0\336\312\233\0\337\313\235\0\337\313\235\0"
"\337\313\235\0\333\306\230\0\332\305\227\0\333\310\232\0\335\315\241\0\346"
"\331\271\0\361\351\326\0\373\367\361\0\376\376\374\0\377\377\377\0\377\377"
"\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377"
"\0\377\377\377\0\377\377\377\0\341\312\233\0\345\306\231\0\350\302\227\0"
"\365\305\232\377\370\274\222\377\377\302\230\377\377\302\227\377\377\302"
"\226\377\377\302\225\377\377\302\225\377\377\302\225\377\377\302\225\377"
"\377\302\225\377\377\302\225\377\377\302\225\377\377\302\224\377\377\302"
"\223\377\377\276\216\377\374\247w\377\365\232k\377\371\227h\377\373\227h"
"\377\375\226h\377\374\225f\377\374\225e\377\374\225d\377\374\225d\377\374"
"\225e\377\373\224d\377\374\224d\377\374\222c\377\374\222c\377\373\222c\377"
"\371\220a\377\370\217`\377\360\224g\377\353\234q\377\377\313\244\377\377"
"\325\261\377\377\321\252\377\377\306\235\377\362\231n\377\375\217c\377\372"
"\217d\377\353\205[\377\336yQ\377\326tM\377\332vN\377\355\207^\377\372\224"
"i\377\371\223e\377\364\226g\377\371\243t\377\356\245u\377\344\247w\377\334"
"\263\202\0\341\314\234\0\341\314\235\0\337\313\235\0\337\313\234\0\337\313"
"\234\0\335\310\231\0\336\312\231\0\334\312\232\0\334\314\236\0\337\322\256"
"\0\353\341\310\0\370\363\350\0\375\374\372\0\376\376\376\0\377\377\377\0"
"\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377"
"\377\377\0\377\377\377\0\345\311\233\0\347\310\234\377\353\311\236\377\364"
"\313\240\377\373\312\240\377\377\313\240\377\377\313\240\377\377\313\240"
"\377\377\314\240\377\377\314\240\377\376\315\240\377\377\314\240\377\377"
"\314\240\377\377\314\237\377\377\314\236\377\377\313\235\377\377\312\234"
"\377\377\315\236\377\375\253}\377\357\225h\377\371\227k\377\373\227j\377"
"\376\227j\377\375\225g\377\375\225f\377\374\224d\377\374\224c\377\374\224"
"c\377\374\224c\377\374\222b\377\375\222b\377\374\222b\377\372\221a\377\371"
"\220`\377\370\217_\377\352\224h\377\340\236v\377\377\327\265\377\377\351"
"\315\377\377\344\304\377\377\321\255\377\352\231r\377\371\216c\377\370\216"
"e\377\353\203[\377\337wQ\377\330rM\377\334uN\377\356\205\\\377\371\221e\377"
"\371\221c\377\370\223e\377\366\225f\377\360\230i\377\352\234m\377\333\252"
"z\0\337\313\232\0\341\314\234\0\341\314\235\0\337\313\233\0\337\313\232\0"
"\336\312\231\0\341\314\233\0\337\313\232\0\335\313\235\0\334\314\244\0\344"
"\332\275\0\362\356\336\0\373\371\365\0\376\376\376\0\377\377\377\0\377\377"
"\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377"
"\0\377\377\377\0\351\312\234\377\352\311\235\377\354\310\236\377\364\314"
"\242\377\373\317\245\377\376\317\245\377\377\317\244\377\377\317\244\377"
"\377\317\244\377\374\316\243\377\373\317\243\377\374\317\243\377\374\317"
"\243\377\375\316\242\377\376\316\241\377\377\314\237\377\377\314\237\377"
"\377\310\232\377\371\256\200\377\355\231m\377\364\231m\377\367\230k\377\374"
"\231l\377\374\227i\377\375\225f\377\374\224d\377\375\224c\377\375\224c\377"
"\375\224c\377\374\222b\377\375\222b\377\374\222b\377\373\221a\377\371\220"
"_\377\370\217^\377\352\224h\377\341\235v\377\377\324\262\377\377\351\315"
"\377\377\345\305\377\377\320\254\377\352\231r\377\367\217d\377\367\217e\377"
"\354\203[\377\340wQ\377\332qM\377\336uM\377\357\205[\377\373\221d\377\373"
"\221b\377\372\221b\377\370\222b\377\365\226f\377\363\233l\377\343\246v\377"
"\353\311\230\0\352\311\231\0\352\312\232\0\344\312\231\0\341\314\232\0\336"
"\312\230\0\336\312\230\0\335\312\230\0\337\314\235\0\335\314\241\0\342\325"
"\262\0\355\345\316\0\370\364\352\0\375\374\372\0\377\377\376\0\377\377\377"
"\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0"
"\377\377\377\0\351\310\233\377\354\306\232\377\365\312\240\377\371\314\243"
"\377\375\317\247\377\375\317\246\377\375\320\245\377\375\320\245\377\375"
"\320\245\377\377\321\247\377\373\311\237\377\361\277\226\377\361\300\226"
"\377\360\300\226\377\364\305\232\377\377\314\240\377\377\314\240\377\377"
"\311\234\377\373\271\214\377\364\254\177\377\365\247z\377\371\245w\377\367"
"\234o\377\370\230i\377\372\224e\377\373\224d\377\375\224c\377\375\224c\377"
"\373\223b\377\372\221a\377\373\221a\377\373\221a\377\374\221a\377\374\221"
"a\377\372\220_\377\360\222e\377\353\231o\377\377\276\227\377\377\314\247"
"\377\377\311\241\377\377\273\220\377\362\230l\377\365\217c\377\367\217d\377"
"\354\203Y\377\340vN\377\334qK\377\340tL\377\360\203X\377\373\217b\377\372"
"\220`\377\372\221`\377\370\222`\377\365\224c\377\365\231h\377\355\241q\377"
"\355\261\201\0\360\266\207\0\354\265\207\0\351\304\223\0\341\314\231\0\336"
"\312\227\0\337\313\231\0\341\314\232\0\336\312\232\0\340\316\240\0\341\322"
"\252\0\351\336\301\0\364\356\337\0\373\371\363\0\376\375\374\0\377\377\377"
"\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0"
"\377\377\377\0\360\314\240\377\364\313\240\377\375\316\244\377\374\315\244"
"\377\376\317\247\377\375\317\247\377\374\320\246\377\374\320\246\377\374"
"\320\246\377\374\313\243\377\362\276\226\377\341\254\204\377\334\250\200"
"\377\340\256\206\377\351\271\220\377\376\313\241\377\377\316\242\377\377"
"\314\240\377\377\314\237\377\377\313\236\377\377\304\227\377\377\267\212"
"\377\367\242u\377\364\227i\377\372\226g\377\373\224e\377\375\224c\377\374"
"\222b\377\374\222b\377\373\221a\377\373\221a\377\373\221`\377\374\221`\377"
"\374\221`\377\373\220_\377\366\221b\377\362\223f\377\357\225i\377\353\226"
"k\377\357\225h\377\361\222d\377\370\225g\377\365\216`\377\366\216a\377\354"
"\201W\377\341vL\377\335qI\377\341tJ\377\361\203W\377\374\217a\377\373\220"
"_\377\372\220^\377\372\222^\377\370\224a\377\367\227f\377\363\233k\377\363"
"\242s\377\351\234m\377\354\242u\377\344\265\203\0\341\313\226\0\337\312\226"
"\0\335\311\226\0\335\311\226\0\335\311\227\0\337\314\234\0\340\315\241\0"
"\344\326\264\0\355\345\317\0\366\363\351\0\374\373\370\0\377\376\376\0\377"
"\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377"
"\377\0\363\315\241\377\371\316\243\377\377\317\246\377\377\317\246\377\377"
"\317\246\377\377\320\250\377\376\321\250\377\376\321\250\377\376\321\250"
"\377\377\322\253\377\365\301\232\377\336\250\202\377\327\240z\377\334\246"
"\200\377\351\264\216\377\377\312\242\377\377\316\243\377\377\313\236\377"
"\377\313\235\377\377\320\243\377\377\313\237\377\377\304\230\377\366\244"
"x\377\362\230k\377\372\227k\377\373\225g\377\375\224d\377\374\222b\377\375"
"\222b\377\374\221a\377\374\221a\377\374\221`\377\374\221_\377\375\221_\377"
"\374\217^\377\372\220_\377\371\220`\377\370\220`\377\367\221a\377\367\217"
"_\377\371\217^\377\375\222b\377\371\215^\377\371\215_\377\357\202V\377\340"
"tI\377\335qF\377\340tI\377\360\204V\377\372\216_\377\372\217]\377\373\220"
"^\377\374\221^\377\372\221`\377\371\223b\377\371\226f\377\370\231j\377\360"
"\225g\377\364\235p\377\352\262\200\0\346\315\226\0\343\314\227\0\335\311"
"\225\0\335\311\225\0\334\310\224\0\334\311\226\0\335\311\232\0\340\317\246"
"\0\350\335\277\0\361\354\333\0\372\367\360\0\375\375\372\0\377\377\376\0"
"\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\365"
"\316\242\377\372\317\244\377\377\317\246\377\377\317\246\377\377\320\247"
"\377\377\320\250\377\377\320\251\377\377\320\251\377\377\320\252\377\377"
"\321\254\377\364\301\235\377\337\253\207\377\331\244\200\377\330\244\200"
"\377\347\263\216\377\377\313\243\377\377\317\245\377\377\321\245\377\377"
"\321\245\377\377\316\243\377\377\314\242\377\377\311\236\377\362\246{\377"
"\360\233p\377\365\230l\377\367\225h\377\371\223d\377\373\223c\377\375\222"
"b\377\374\221a\377\374\221a\377\374\221`\377\373\220]\377\375\221^\377\375"
"\221^\377\374\220]\377\374\220\\\377\374\216[\377\375\216[\377\375\216[\377"
"\374\215Z\377\377\221`\377\374\216^\377\373\215]\377\361\203U\377\341tF\377"
"\335qD\377\340uF\377\360\205V\377\371\215]\377\372\217\\\377\374\220]\377"
"\375\221^\377\374\221_\377\372\222`\377\374\224c\377\376\226f\377\367\225"
"f\377\365\230k\377\350\255z\0\341\307\217\0\342\313\225\0\336\312\226\0\336"
"\312\226\0\333\306\223\0\327\303\220\0\326\303\221\0\333\311\233\0\345\327"
"\260\0\355\344\312\0\364\357\341\0\371\367\361\0\375\375\373\0\376\376\376"
"\0\377\377\377\0\377\377\377\0\377\377\377\0\377\377\377\0\365\316\242\377"
"\372\317\244\377\377\320\247\377\377\320\247\377\377\320\247\377\377\323"
"\253\377\375\313\244\377\356\274\227\377\346\263\220\377\352\270\226\377"
"\347\265\226\377\363\302\243\377\365\305\246\377\370\311\247\377\371\314"
"\247\377\374\315\245\377\377\320\245\377\377\321\250\377\372\302\231\377"
"\356\264\215\377\356\264\216\377\361\262\212\377\376\271\217\377\377\267"
"\213\377\377\257\202\377\377\255\177\377\375\234n\377\367\222c\377\374\222"
"c\377\375\222b\377\375\222b\377\373\220^\377\374\221^\377\373\220]\377\373"
"\220\\\377\373\220[\377\372\217Y\377\372\216W\377\374\217W\377\376\217Z\377"
"\374\215Y\377\377\220^\377\375\216]\377\374\215\\\377\363\204T\377\360\202"
"R\377\361\204S\377\362\206U\377\363\210V\377\371\216[\377\372\217\\\377\372"
"\217[\377\373\220\\\377\371\220\\\377\371\222]\377\372\223`\377\376\226d"
"\377\370\226e\377\363\230g\377\345\253w\0\340\307\217\0\337\310\223\0\335"
"\311\226\0\333\306\224\0\330\304\222\0\325\301\216\0\325\300\217\0\333\306"
"\227\0\344\322\247\0\347\333\271\0\354\343\315\0\363\356\340\0\371\367\361"
"\0\375\374\371\0\376\376\375\0\376\376\376\0\376\376\376\0\377\377\376\0"
"\365\316\242\377\373\320\246\377\377\320\247\377\377\320\247\377\377\320"
"\247\377\377\317\247\377\367\304\236\377\342\256\213\377\330\244\203\377"
"\327\245\206\377\341\261\224\377\377\325\271\377\377\333\277\377\377\333"
"\274\377\377\330\265\377\376\321\252\377\377\322\250\377\377\313\244\377"
"\354\262\214\377\330\236y\377\335\242~\377\342\246\177\377\373\275\223\377"
"\377\305\231\377\377\311\232\377\377\265\207\377\376\242s\377\367\224e\377"
"\374\222d\377\375\222c\377\375\222b\377\374\221`\377\374\221^\377\373\220"
"]\377\373\220\\\377\373\220[\377\373\220Z\377\373\217X\377\373\217W\377\374"
"\216Y\377\374\215Y\377\376\217]\377\375\216\\\377\375\216\\\377\372\212Y"
"\377\371\212Y\377\370\213Y\377\370\214Z\377\370\214Z\377\371\215[\377\372"
"\217\\\377\372\217[\377\374\220[\377\372\220[\377\371\221[\377\373\223_\377"
"\375\225b\377\366\226c\377\363\231g\377\346\255x\0\340\307\217\0\337\310"
"\224\0\333\306\225\0\332\305\223\0\330\304\222\0\327\303\221\0\332\305\223"
"\0\334\307\227\0\340\315\237\0\343\323\253\0\346\332\273\0\353\342\313\0"
"\362\354\334\0\367\364\353\0\372\370\364\0\375\373\370\0\376\374\372\0\375"
"\374\372\0\371\322\247\377\374\321\250\377\377\322\252\377\377\320\250\377"
"\377\320\250\377\377\322\254\377\372\307\242\377\346\261\220\377\334\247"
"\211\377\327\245\211\377\337\260\225\377\377\325\272\377\377\342\310\377"
"\377\341\303\377\377\334\271\377\375\321\253\377\377\320\250\377\377\320"
"\253\377\355\263\221\377\330\234z\377\334\240}\377\343\250\202\377\372\300"
"\226\377\377\313\237\377\377\310\231\377\377\272\213\377\367\235m\377\370"
"\225f\377\377\223e\377\377\223d\377\375\222b\377\374\221`\377\374\221^\377"
"\373\220]\377\373\220]\377\374\220]\377\374\220\\\377\373\216[\377\373\216"
"[\377\374\216[\377\375\216\\\377\375\216\\\377\375\216\\\377\375\216\\\377"
"\375\216\\\377\374\216\\\377\372\215[\377\373\216\\\377\373\216\\\377\373"
"\216\\\377\373\216\\\377\374\216[\377\374\216Z\377\374\216Z\377\375\220["
"\377\373\221]\377\373\224a\377\364\226b\377\362\235h\377\352\262|\0\336\306"
"\216\0\336\307\223\0\327\301\221\0\327\301\220\0\332\305\223\0\334\310\226"
"\0\337\313\231\0\335\311\230\0\336\312\233\0\337\315\240\0\342\322\254\0"
"\347\333\273\0\353\342\310\0\357\350\324\0\361\354\335\0\365\362\346\0\370"
"\364\353\0\371\366\357\0\371\322\247\377\374\321\250\377\377\320\251\377"
"\377\320\251\377\377\320\252\377\373\313\246\377\363\303\237\377\343\264"
"\223\377\333\253\216\377\333\257\224\377\341\272\237\377\377\332\300\377"
"\377\343\312\377\377\342\304\377\377\331\267\377\370\314\250\377\373\312"
"\244\377\377\313\251\377\354\267\227\377\331\245\205\377\330\244\203\377"
"\337\253\207\377\371\306\236\377\377\314\241\377\377\317\240\377\377\273"
"\213\377\366\235m\377\371\226g\377\377\223e\377\377\223d\377\375\222b\377"
"\374\221`\377\374\221_\377\373\220^\377\373\220]\377\374\217]\377\375\217"
"]\377\374\216\\\377\374\216\\\377\375\216\\\377\375\216\\\377\375\216\\\377"
"\375\216\\\377\375\216\\\377\375\216\\\377\375\216\\\377\373\215Z\377\374"
"\216\\\377\373\216\\\377\373\216\\\377\373\216\\\377\374\216[\377\375\216"
"[\377\374\216[\377\375\217\\\377\374\221^\377\375\225b\377\364\226b\377\361"
"\235h\377\355\264~\0\341\304\214\0\337\305\222\0\325\277\217\0\324\277\217"
"\0\332\305\224\0\335\311\227\0\337\313\232\0\336\312\231\0\335\310\231\0"
"\337\314\235\0\335\314\240\0\342\323\253\0\345\331\264\0\343\330\270\0\345"
"\333\301\0\350\341\311\0\357\346\321\0\360\354\330\0\367\320\244\377\373"
"\320\247\377\377\320\251\377\355\277\231\377\342\263\217\377\336\262\217"
"\377\340\266\223\377\354\306\246\377\364\322\265\377\356\317\263\377\362"
"\326\273\377\374\340\306\377\377\345\313\377\377\343\305\377\364\320\257"
"\377\340\265\222\377\343\260\215\377\336\257\216\377\364\310\252\377\366"
"\317\261\377\364\321\263\377\367\320\257\377\371\317\252\377\377\315\244"
"\377\377\321\243\377\377\273\214\377\363\232l\377\370\226h\377\375\223e\377"
"\375\223e\377\374\222c\377\373\221a\377\374\221`\377\374\220^\377\374\217"
"]\377\374\216\\\377\375\216\\\377\375\216[\377\375\216[\377\375\216[\377"
"\375\216[\377\375\216[\377\375\216[\377\375\216[\377\375\216[\377\375\216"
"[\377\374\215Y\377\373\215Y\377\373\216[\377\373\216[\377\373\216[\377\374"
"\216[\377\374\216\\\377\373\217\\\377\372\220]\377\373\221^\377\375\224a"
"\377\366\226b\377\357\231d\377\353\256x\0\347\301\212\0\342\304\221\0\330"
"\302\223\0\333\306\226\0\334\307\227\0\336\312\231\0\341\314\234\0\336\312"
"\232\0\336\312\232\0\331\305\226\0\333\312\232\0\337\317\240\0\337\320\244"
"\0\334\316\245\0\335\320\253\0\336\322\257\0\343\330\266\0\346\334\274\0"
"\371\322\247\377\374\321\250\377\376\317\250\377\347\271\224\377\331\253"
"\210\377\320\246\204\377\327\261\220\377\360\317\260\377\376\343\306\377"
"\374\343\310\377\375\346\314\377\375\346\314\377\375\346\314\377\377\342"
"\306\377\357\312\252\377\326\252\212\377\326\243\202\377\323\246\207\377"
"\360\311\254\377\377\337\303\377\374\340\305\377\375\334\275\377\372\324"
"\262\377\377\317\247\377\377\314\237\377\377\273\215\377\371\240s\377\367"
"\226h\377\375\223e\377\375\223e\377\373\222d\377\373\221b\377\374\221a\377"
"\374\220^\377\375\217]\377\374\216\\\377\375\216\\\377\375\216[\377\375\216"
"Z\377\375\216Z\377\375\216Z\377\375\216Z\377\375\216Z\377\375\216Z\377\374"
"\215Y\377\374\215Y\377\374\215Y\377\373\215Y\377\373\216Z\377\373\216Z\377"
"\373\216Z\377\373\216[\377\373\216\\\377\372\217\\\377\371\220]\377\374\221"
"^\377\377\223a\377\367\225b\377\361\231d\377\357\254w\0\354\276\210\0\347"
"\304\222\0\337\310\230\0\340\311\232\0\336\310\231\0\337\312\232\0\337\313"
"\233\0\336\312\232\0\337\313\233\0\335\312\231\0\335\312\231\0\332\312\231"
"\0\333\313\233\0\334\315\237\0\335\316\241\0\333\314\241\0\331\313\237\0"
"\331\311\241\0\370\321\247\377\374\321\251\377\375\316\250\377\346\270\224"
"\377\325\247\206\377\321\247\207\377\330\262\223\377\362\321\264\377\377"
"\345\312\377\377\352\321\377\377\351\322\377\375\344\315\377\376\344\315"
"\377\377\341\310\377\360\311\254\377\326\252\214\377\325\243\204\377\321"
"\244\207\377\360\307\255\377\377\340\306\377\376\341\307\377\377\343\305"
"\377\377\331\266\377\377\317\247\377\377\312\237\377\377\272\216\377\371"
"\240s\377\367\226h\377\375\223e\377\375\223e\377\373\222d\377\373\221b\377"
"\374\221a\377\374\220^\377\375\217]\377\374\216\\\377\375\216\\\377\375\216"
"[\377\375\216Z\377\375\216Z\377\375\216Z\377\374\215Y\377\374\215Y\377\374"
"\215Y\377\374\215Y\377\374\215Y\377\374\215Y\377\373\215Y\377\373\216Z\377"
"\373\216Z\377\373\216Z\377\373\216[\377\373\216\\\377\372\217\\\377\372\220"
"]\377\374\221^\377\377\222`\377\370\224`\377\363\230b\377\362\252u\0\357"
"\272\205\0\353\302\220\0\343\305\226\0\342\311\231\0\341\312\233\0\340\313"
"\233\0\337\313\233\0\337\313\232\0\341\314\233\0\340\314\233\0\336\313\232"
"\0\330\307\225\0\334\314\232\0\335\316\235\0\334\315\234\0\330\311\231\0"
"\324\305\225\0\322\302\223\0\365\315\245\377\372\317\250\377\373\315\250"
"\377\341\263\221\377\324\247\207\377\320\247\210\377\330\262\225\377\364"
"\323\271\377\377\351\321\377\375\344\315\377\373\344\317\377\375\344\317"
"\377\376\344\317\377\377\344\315\377\364\317\265\377\335\265\232\377\334"
"\261\225\377\333\262\231\377\366\321\272\377\377\342\312\377\377\343\313"
"\377\377\340\303\377\377\331\266\377\377\320\251\377\377\317\244\377\377"
"\272\216\377\371\240s\377\367\226h\377\375\223e\377\375\223e\377\373\222"
"d\377\373\221b\377\374\221a\377\374\220^\377\375\217]\377\374\216\\\377\375"
"\216\\\377\375\216[\377\375\216Z\377\375\216Z\377\375\216Z\377\374\215Y\377"
"\374\215Y\377\374\215Y\377\374\215Y\377\375\216Z\377\375\216Z\377\374\216"
"Z\377\373\216Z\377\373\216Z\377\373\216Z\377\373\216[\377\373\216\\\377\372"
"\217\\\377\373\220]\377\375\221^\377\377\222`\377\372\223`\377\367\227b\377"
"\371\250t\377\363\261~\0\353\266\205\0\345\274\215\0\343\302\223\0\343\312"
"\232\0\341\313\232\0\340\314\234\0\337\313\232\0\340\314\232\0\337\315\232"
"\0\335\314\231\0\335\314\231\0\333\313\230\0\334\314\232\0\335\315\234\0"
"\330\310\230\0\324\304\223\0\323\302\222\0\367\317\250\377\376\323\256\377"
"\372\313\250\377\341\263\222\377\322\245\206\377\316\244\207\377\327\260"
"\226\377\357\315\265\377\377\343\315\377\375\344\317\377\373\344\320\377"
"\374\344\320\377\373\343\317\377\374\341\314\377\374\336\310\377\371\333"
"\304\377\362\322\273\377\372\334\306\377\374\340\313\377\377\344\315\377"
"\375\343\313\377\377\341\303\377\377\331\266\377\377\320\251\377\377\317"
"\244\377\377\272\216\377\371\240s\377\367\226h\377\375\223e\377\375\223e"
"\377\373\222d\377\373\221b\377\373\220_\377\374\220^\377\373\216\\\377\374"
"\216\\\377\375\216\\\377\375\216[\377\375\216Z\377\375\216Z\377\375\216Z"
"\377\374\215Y\377\374\215Y\377\374\215Y\377\374\215Y\377\374\215Y\377\374"
"\215Y\377\373\215Y\377\372\215Y\377\373\216Z\377\373\216Z\377\373\217[\377"
"\372\217\\\377\373\220]\377\373\220]\377\374\217]\377\377\221`\377\375\222"
"`\377\372\224b\377\365\231h\377\361\236o\377\350\241r\377\340\244v\377\344"
"\270\210\0\345\311\230\0\341\313\231\0\335\314\232\0\335\314\231\0\336\315"
"\232\0\335\314\231\0\334\314\231\0\334\314\231\0\334\314\231\0\334\314\232"
"\0\334\314\233\0\333\313\232\0\332\312\231\0\331\310\230\0\365\315\246\377"
"\372\317\252\377\372\313\251\377\344\266\226\377\330\253\215\377\316\244"
"\211\377\330\262\231\377\363\322\274\377\377\351\325\377\374\343\317\377"
"\372\343\320\377\372\343\320\377\373\343\320\377\377\352\326\377\376\345"
"\321\377\375\344\320\377\375\344\320\377\376\345\322\377\374\344\321\377"
"\374\343\316\377\375\343\314\377\377\341\304\377\376\331\266\377\377\320"
"\251\377\377\317\244\377\377\272\216\377\371\240s\377\367\226h\377\375\223"
"e\377\375\224e\377\373\222c\377\373\221a\377\374\221`\377\374\220^\377\375"
"\217^\377\374\216\\\377\375\216\\\377\375\216[\377\375\216Z\377\375\216Z"
"\377\375\216Z\377\374\215Y\377\374\215Y\377\374\215Y\377\374\215Y\377\374"
"\215Y\377\374\215Y\377\373\215Y\377\372\215Y\377\372\215Y\377\372\215Y\377"
"\373\217[\377\372\217\\\377\373\220]\377\373\220]\377\375\217]\377\377\220"
"^\377\376\220_\377\374\222a\377\371\225e\377\366\227i\377\356\232m\377\347"
"\237r\377\351\265\205\0\350\311\226\0\342\312\230\0\335\314\231\0\335\314"
"\231\0\335\314\231\0\333\313\230\0\334\314\231\0\335\315\232\0\334\314\231"
"\0\334\314\232\0\334\314\233\0\335\315\234\0\334\314\233\0\335\314\233\0"
"\360\310\242\377\373\320\254\377\371\312\251\377\343\265\227\377\325\250"
"\215\377\320\246\216\377\327\262\233\377\361\321\274\377\377\347\323\377"
"\376\345\322\377\375\345\323\377\372\341\320\377\372\341\320\377\367\336"
"\314\377\374\342\320\377\375\343\322\377\375\343\323\377\375\343\323\377"
"\375\344\322\377\375\342\317\377\375\342\315\377\377\337\303\377\374\330"
"\265\377\377\317\250\377\377\316\243\377\377\271\215\377\363\232m\377\367"
"\226h\377\375\223e\377\375\224d\377\373\222b\377\373\221`\377\374\221_\377"
"\374\220^\377\375\217_\377\374\216]\377\375\216\\\377\375\216[\377\375\216"
"Z\377\375\216Z\377\375\216Z\377\374\215Y\377\374\215Y\377\374\215Y\377\374"
"\215Y\377\374\215Y\377\374\215Y\377\373\215Y\377\372\215Y\377\372\215Y\377"
"\372\215Y\377\373\217[\377\372\217\\\377\374\220]\377\374\217]\377\376\217"
"]\377\377\216]\377\377\220_\377\376\222`\377\373\222b\377\372\224f\377\361"
"\230j\377\352\235o\377\353\263\203\0\353\310\225\0\345\312\227\0\335\312"
"\230\0\337\313\231\0\337\313\231\0\336\313\231\0\335\314\231\0\335\314\231"
"\0\334\314\231\0\334\314\232\0\334\314\233\0\335\315\234\0\334\314\233\0"
"\335\314\233\0\356\304\237\377\357\303\240\377\360\302\242\377\345\271\234"
"\377\341\270\237\377\335\271\242\377\340\301\254\377\364\331\305\377\377"
"\350\325\377\372\340\317\377\361\325\306\377\337\274\256\377\330\257\243"
"\377\333\266\251\377\355\315\277\377\377\341\323\377\375\343\325\377\375"
"\343\324\377\374\344\323\377\375\344\320\377\377\343\316\377\377\340\304"
"\377\374\330\266\377\377\317\250\377\377\316\243\377\377\270\214\377\372"
"\240s\377\371\227i\377\376\225f\377\375\224d\377\375\224c\377\374\222a\377"
"\374\221^\377\375\221`\377\374\217_\377\374\216]\377\375\216\\\377\375\216"
"[\377\375\216Z\377\375\216Z\377\375\216Z\377\374\215Y\377\374\215Y\377\374"
"\215Y\377\375\215Y\377\375\215Y\377\375\215X\377\374\215X\377\373\215X\377"
"\373\215X\377\373\215X\377\373\217[\377\372\217\\\377\374\220]\377\375\217"
"]\377\376\217]\377\377\217]\377\377\220^\377\376\220^\377\375\221`\377\374"
"\222c\377\363\226g\377\355\234n\377\355\262\202\0\354\310\225\0\346\311\227"
"\0\337\312\230\0\340\313\232\0\341\314\233\0\337\313\232\0\335\312\230\0"
"\334\313\230\0\333\313\230\0\333\313\231\0\334\314\233\0\334\314\233\0\335"
"\315\234\0\335\314\233\0\327\252\206\377\327\252\211\377\333\255\217\377"
"\364\316\263\377\377\337\307\377\376\344\315\377\373\346\321\377\373\347"
"\324\377\373\350\327\377\377\342\325\377\347\277\265\377\263zt\377\255da"
"\377\245id\377\304\227\216\377\377\337\323\377\375\343\325\377\374\344\324"
"\377\373\344\323\377\374\344\320\377\376\344\316\377\376\340\304\377\374"
"\330\267\377\377\317\251\377\377\316\243\377\377\270\214\377\367\234o\377"
"\370\226h\377\376\225f\377\375\224d\377\375\224c\377\374\222a\377\374\221"
"^\377\374\221`\377\373\220_\377\373\216]\377\374\216\\\377\375\216[\377\375"
"\216Z\377\375\216Z\377\375\216Z\377\374\215Y\377\374\215Y\377\375\215Y\377"
"\375\214Y\377\375\214X\377\375\215W\377\375\215W\377\374\215W\377\374\215"
"W\377\374\215W\377\373\215X\377\373\217[\377\373\216[\377\373\216[\377\376"
"\217\\\377\377\217\\\377\377\220]\377\377\220]\377\377\222_\377\375\221`"
"\377\365\226e\377\356\234l\377\356\262\201\0\355\307\225\0\347\311\230\0"
"\340\311\231\0\340\313\233\0\341\314\234\0\340\314\234\0\336\313\233\0\335"
"\314\233\0\334\314\233\0\334\314\233\0\335\315\234\0\335\315\234\0\335\315"
"\234\0\335\315\234\0\317\245\201\377\320\246\205\377\322\250\213\377\360"
"\315\263\377\377\346\317\377\375\347\321\377\370\347\323\377\367\347\324"
"\377\367\347\326\377\377\341\325\377\353\273\264\377\273us\377\273^b\377"
"\256ed\377\311\223\216\377\377\335\322\377\374\342\323\377\373\344\324\377"
"\372\344\323\377\374\344\320\377\376\344\316\377\375\336\303\377\373\327"
"\266\377\375\316\250\377\377\315\242\377\377\270\215\377\367\236q\377\366"
"\227i\377\372\224f\377\373\224d\377\372\223b\377\373\221`\377\374\221^\377"
"\374\221_\377\373\220_\377\373\216]\377\373\216\\\377\374\216[\377\375\216"
"Z\377\374\215Y\377\374\215Y\377\374\215Y\377\374\215Y\377\375\214Y\377\376"
"\214Y\377\376\214X\377\376\214W\377\375\215W\377\374\215W\377\374\215W\377"
"\374\215W\377\373\215X\377\372\215Y\377\373\216Z\377\373\216Z\377\376\217"
"[\377\376\217[\377\377\220\\\377\377\220\\\377\377\220]\377\377\222`\377"
"\365\226d\377\356\234k\377\356\262\200\0\353\306\224\0\346\311\230\0\337"
"\311\232\0\340\313\233\0\341\314\234\0\340\314\234\0\336\313\233\0\335\314"
"\233\0\334\314\233\0\334\314\233\0\335\315\234\0\335\315\234\0\335\315\234"
"\0\335\315\234\0\316\255\207\377\316\254\212\377\321\256\217\377\351\313"
"\260\377\377\345\317\377\374\346\322\377\367\345\324\377\367\345\324\377"
"\366\345\325\377\377\336\322\377\356\271\263\377\277rr\377\276Z`\377\261"
"bd\377\312\221\216\377\377\333\322\377\373\342\323\377\373\344\324\377\372"
"\344\323\377\375\345\322\377\377\345\317\377\377\337\304\377\374\326\266"
"\377\375\316\250\377\377\315\243\377\377\272\217\377\364\241v\377\365\233"
"n\377\371\231j\377\370\225e\377\370\222a\377\372\222`\377\374\221^\377\375"
"\221_\377\374\217^\377\373\216\\\377\373\216\\\377\374\216[\377\375\216Z"
"\377\374\215Y\377\374\215Y\377\374\215Y\377\374\215Y\377\375\214Y\377\376"
"\214Y\377\376\214X\377\376\214W\377\375\215W\377\374\215W\377\374\215W\377"
"\374\215W\377\373\215X\377\372\215Y\377\372\215Y\377\372\215Y\377\374\216"
"Z\377\376\217[\377\376\217[\377\376\217[\377\377\220]\377\376\221^\377\365"
"\226d\377\355\235k\377\354\263\200\0\351\307\224\0\344\312\230\0\335\312"
"\232\0\337\313\233\0\341\314\234\0\340\314\234\0\337\314\234\0\335\314\233"
"\0\335\315\234\0\335\315\234\0\335\315\234\0\335\315\234\0\335\315\234\0"
"\335\315\234\0\324\272\222\0\325\271\226\0\332\274\234\0\360\325\272\377"
"\374\344\316\377\372\344\321\377\370\345\324\377\370\345\324\377\367\345"
"\325\377\377\334\321\377\356\267\262\377\277pq\377\276Y`\377\261ac\377\313"
"\220\215\377\377\332\321\377\373\342\323\377\373\344\324\377\372\344\323"
"\377\375\345\321\377\377\345\317\377\377\337\304\377\374\326\266\377\372"
"\315\250\377\377\316\245\377\377\304\232\377\371\260\205\377\377\261\204"
"\377\377\262\203\377\377\242r\377\375\232h\377\372\223a\377\374\221^\377"
"\375\221^\377\375\217]\377\374\216\\\377\374\216\\\377\375\216[\377\375\216"
"Z\377\374\215Y\377\374\215Y\377\374\215Y\377\374\215Y\377\375\214Y\377\376"
"\214Y\377\376\214X\377\376\214W\377\375\215W\377\374\215W\377\374\215W\377"
"\374\215W\377\373\215X\377\372\215Y\377\372\215Y\377\372\215Y\377\374\216"
"Z\377\376\217[\377\376\217[\377\376\217[\377\376\220]\377\375\221^\377\364"
"\226d\377\354\235k\377\352\262\177\0\350\307\224\0\344\312\230\0\336\313"
"\233\0\337\313\233\0\340\314\234\0\337\314\234\0\336\313\233\0\335\314\233"
"\0\334\314\233\0\334\314\233\0\335\315\234\0\334\314\233\0\335\315\234\0"
"\335\315\234\0\335\306\236\0\337\307\242\0\341\307\247\0\363\333\300\377"
"\373\345\316\377\372\345\321\377\371\345\323\377\371\345\324\377\371\345"
"\325\377\377\335\322\377\356\271\263\377\273pp\377\273Y`\377\257`b\377\314"
"\221\216\377\377\331\321\377\374\341\322\377\375\345\325\377\374\347\325"
"\377\377\350\323\377\377\347\320\377\377\342\306\377\373\325\265\377\371"
"\317\252\377\376\317\247\377\377\316\244\377\377\315\242\377\377\315\240"
"\377\377\312\234\377\377\262\203\377\371\230g\377\371\223a\377\373\220]\377"
"\374\220]\377\375\220\\\377\374\216[\377\375\216[\377\375\216Z\377\374\215"
"Y\377\374\215Y\377\374\215Y\377\374\215Y\377\374\215Y\377\375\214Y\377\376"
"\214Y\377\376\214X\377\376\214W\377\375\215W\377\374\215W\377\374\215W\377"
"\374\215W\377\373\215X\377\372\215Y\377\372\215Y\377\372\215Y\377\374\216"
"Z\377\375\216Z\377\376\217[\377\376\217[\377\376\221]\377\376\222`\377\366"
"\231f\377\354\235k\377\354\263\200\0\352\307\224\0\343\307\226\0\337\313"
"\233\0\340\314\234\0\337\314\234\0\336\313\233\0\336\313\233\0\334\312\232"
"\0\334\314\233\0\334\314\233\0\335\315\234\0\335\315\234\0\335\315\234\0"
"\335\315\234\0\330\303\233\0\334\305\240\0\340\310\246\0\362\334\277\377"
"\372\345\316\377\372\345\320\377\372\344\323\377\372\344\324\377\372\344"
"\325\377\377\341\326\377\353\273\264\377\271tr\377\264Z^\377\252`a\377\312"
"\221\216\377\377\332\322\377\377\336\321\377\377\336\320\377\377\340\320"
"\377\377\341\316\377\377\341\313\377\377\343\310\377\377\331\272\377\374"
"\317\254\377\376\317\250\377\377\317\246\377\377\320\245\377\377\315\241"
"\377\377\313\236\377\377\263\205\377\367\230h\377\371\223b\377\373\220]\377"
"\374\220\\\377\373\216Z\377\374\216Z\377\375\216Z\377\375\216Z\377\375\216"
"Z\377\374\215Y\377\374\215Y\377\374\215Y\377\374\215Y\377\375\214Y\377\376"
"\214Y\377\376\214X\377\376\214W\377\375\215W\377\374\215W\377\374\215W\377"
"\374\215W\377\373\215X\377\372\215Y\377\372\215Y\377\372\215Y\377\373\215"
"Y\377\375\216Z\377\375\216Z\377\376\217[\377\376\220]\377\375\221^\377\366"
"\226d\377\354\230g\377\361\261\200\0\360\305\223\0\354\312\232\0\344\313"
"\234\0\342\314\234\0\340\314\234\0\336\313\233\0\336\313\233\0\335\314\233"
"\0\334\314\233\0\334\314\233\0\336\315\234\0\335\315\234\0\335\315\234\0"
"\335\315\234\0\332\304\234\0\333\304\236\0\337\307\244\0\362\332\276\377"
"\373\345\316\377\374\345\322\377\374\345\324\377\373\344\324\377\373\344"
"\325\377\377\343\327\377\350\277\266\377\264xt\377\261bc\377\254jh\377\305"
"\220\214\377\377\322\313\377\377\332\320\377\377\334\321\377\377\333\320"
"\377\377\334\315\377\377\335\312\377\377\332\301\377\377\325\267\377\377"
"\317\255\377\377\316\250\377\377\315\245\377\377\320\246\377\377\315\242"
"\377\377\314\237\377\377\264\206\377\366\230i\377\372\224d\377\375\221^\377"
"\374\220\\\377\373\216Z\377\374\216Z\377\375\216Z\377\375\216Z\377\375\216"
"Z\377\375\216Z\377\375\216Z\377\374\215Y\377\374\215Y\377\375\214Y\377\376"
"\214Y\377\376\214X\377\376\214W\377\375\215W\377\374\215W\377\374\215W\377"
"\374\215W\377\373\215X\377\372\215Y\377\372\215Y\377\372\215Y\377\373\215"
"Y\377\375\216Z\377\375\216Z\377\376\217[\377\377\220]\377\377\220^\377\372"
"\223c\377\367\231k\377\372\257\177\377\367\300\220\0\360\303\224\0\343\301"
"\223\0\341\304\226\0\343\313\234\0\340\313\233\0\336\313\233\0\335\314\233"
"\0\334\314\233\0\335\314\233\0\336\315\234\0\335\314\233\0\334\314\233\0"
"\335\315\234\0\331\304\233\0\331\303\234\0\335\306\242\0\361\332\275\377"
"\374\346\317\377\374\345\321\377\376\346\325\377\373\344\323\377\373\344"
"\324\377\377\344\326\377\370\327\313\377\350\271\260\377\364\267\262\377"
"\360\267\261\377\347\262\254\377\367\276\270\377\363\266\260\377\370\266"
"\261\377\374\265\261\377\370\266\255\377\365\267\252\377\370\275\251\377"
"\377\306\253\377\377\315\254\377\377\315\250\377\377\315\246\377\377\316"
"\246\377\377\315\242\377\377\314\237\377\377\264\206\377\365\230j\377\371"
"\223c\377\376\220_\377\374\216\\\377\374\216[\377\374\216[\377\375\216[\377"
"\375\216Z\377\375\216Z\377\375\216Z\377\375\216Y\377\374\215X\377\374\215"
"X\377\375\215X\377\375\214X\377\375\214X\377\375\215W\377\375\215W\377\374"
"\215W\377\374\215W\377\374\215W\377\373\215X\377\373\215X\377\373\215X\377"
"\372\215X\377\373\215Y\377\375\216Z\377\375\216Z\377\376\217[\377\377\220"
"]\377\377\220^\377\375\222b\377\370\222d\377\364\235n\377\356\245u\377\345"
"\251z\0\336\257\201\0\344\277\221\0\346\313\234\0\341\312\233\0\336\313\233"
"\0\335\314\233\0\334\314\233\0\335\314\233\0\336\315\234\0\335\314\233\0"
"\334\314\233\0\335\315\235\0\333\307\234\0\330\303\234\0\332\304\240\0\357"
"\332\274\377\373\346\316\377\375\347\322\377\375\345\324\377\374\345\324"
"\377\374\347\325\377\374\345\325\377\373\344\324\377\377\346\327\377\377"
"\336\321\377\377\332\317\377\377\312\301\377\362\257\253\377\370\250\251"
"\377\374\247\252\377\377\245\252\377\376\250\250\377\371\252\244\377\365"
"\255\236\377\377\277\246\377\377\314\255\377\377\315\250\377\377\314\244"
"\377\377\317\246\377\377\317\244\377\377\313\236\377\377\266\211\377\365"
"\231k\377\370\222c\377\377\221a\377\376\217^\377\376\217]\377\376\217]\377"
"\375\217]\377\375\217\\\377\375\217[\377\375\220Z\377\374\216X\377\374\216"
"X\377\373\215W\377\374\215W\377\375\215W\377\375\215W\377\375\215W\377\374"
"\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377"
"\373\215W\377\372\215W\377\373\215X\377\374\216Z\377\374\216Z\377\375\217"
"[\377\376\220]\377\377\220^\377\377\222a\377\376\222c\377\372\224e\377\371"
"\231i\377\351\231i\377\344\243t\377\351\271\213\0\350\312\233\0\342\312\232"
"\0\336\313\233\0\335\313\233\0\335\313\233\0\335\314\233\0\334\314\233\0"
"\334\314\233\0\334\314\233\0\334\314\234\0\334\312\236\0\327\303\233\0\327"
"\302\235\0\360\333\274\377\374\347\317\377\374\345\321\377\375\344\323\377"
"\377\346\325\377\373\343\321\377\377\347\326\377\371\343\321\377\373\343"
"\321\377\377\347\326\377\377\344\326\377\375\313\300\377\355\254\247\377"
"\370\250\251\377\375\246\252\377\377\244\251\377\376\245\245\377\373\246"
"\241\377\366\252\233\377\375\273\242\377\377\313\255\377\377\315\250\377"
"\377\314\245\377\377\317\246\377\377\320\245\377\377\312\236\377\377\263"
"\207\377\365\230l\377\367\221c\377\377\220a\377\376\217_\377\376\217]\377"
"\376\217]\377\375\217]\377\375\217\\\377\375\220[\377\375\220Z\377\373\217"
"X\377\373\217X\377\372\215W\377\373\215W\377\374\215W\377\374\215W\377\374"
"\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377"
"\374\215W\377\373\215W\377\372\215W\377\372\215X\377\373\216Z\377\373\216"
"Z\377\375\220[\377\376\221]\377\375\221^\377\376\220_\377\376\220`\377\376"
"\222a\377\375\223c\377\360\227g\377\352\241r\377\355\270\211\0\352\312\232"
"\0\343\312\232\0\336\313\233\0\336\313\233\0\337\313\233\0\335\313\233\0"
"\334\314\233\0\333\314\233\0\333\314\233\0\333\314\234\0\334\313\237\0\334"
"\312\241\0\324\300\232\0\357\333\274\377\376\352\321\377\376\345\321\377"
"\374\337\317\377\355\317\277\377\354\314\274\377\355\317\277\377\361\323"
"\303\377\373\340\316\377\377\347\324\377\377\344\324\377\373\325\307\377"
"\355\273\261\377\371\272\265\377\376\267\263\377\377\264\262\377\375\260"
"\252\377\372\256\244\377\372\265\242\377\377\303\247\377\377\314\254\377"
"\377\314\250\377\375\310\242\377\364\300\231\377\375\302\232\377\371\270"
"\215\377\370\251~\377\364\227l\377\371\223f\377\377\220b\377\377\220`\377"
"\376\217]\377\376\217]\377\375\217]\377\375\217\\\377\375\220[\377\375\220"
"Z\377\373\217X\377\373\217X\377\372\215W\377\373\215W\377\374\215W\377\374"
"\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377"
"\374\215W\377\374\215W\377\373\215W\377\372\215W\377\372\215X\377\373\216"
"Z\377\373\216Z\377\375\220[\377\375\221]\377\374\221]\377\374\221]\377\374"
"\221]\377\372\221_\377\372\223b\377\357\227g\377\351\242r\377\355\272\212"
"\0\352\312\232\0\344\312\232\0\337\313\233\0\340\313\233\0\340\313\233\0"
"\336\313\233\0\334\314\233\0\333\314\233\0\331\315\233\0\333\314\234\0\327"
"\307\233\0\340\316\245\0\326\302\233\0\356\332\272\377\377\352\321\377\377"
"\346\322\377\366\327\307\377\310\246\227\377\277\233\215\377\276\234\215"
"\377\324\262\243\377\366\330\307\377\377\355\332\377\377\343\322\377\376"
"\340\320\377\375\326\310\377\377\323\307\377\377\320\304\377\377\315\301"
"\377\377\306\267\377\377\304\261\377\377\304\253\377\377\314\255\377\377"
"\315\253\377\377\314\251\377\373\302\236\377\347\255\210\377\346\246\177"
"\377\346\237v\377\365\242x\377\366\226l\377\372\223g\377\377\221d\377\377"
"\220a\377\377\220^\377\375\217]\377\375\217]\377\375\217\\\377\375\220[\377"
"\375\220Z\377\373\217X\377\373\217X\377\372\215W\377\373\215W\377\374\215"
"W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374"
"\215W\377\374\215W\377\374\215W\377\373\215W\377\372\215W\377\372\215X\377"
"\373\216Z\377\373\216Z\377\375\220[\377\375\221\\\377\375\221\\\377\374\221"
"\\\377\374\221\\\377\372\222^\377\370\222`\377\356\230g\377\351\242r\377"
"\356\272\212\0\353\311\232\0\345\311\232\0\340\313\233\0\341\312\233\0\341"
"\312\233\0\337\313\233\0\334\314\233\0\333\314\233\0\331\315\233\0\333\314"
"\234\0\330\310\234\0\330\306\235\0\333\310\241\0\357\332\272\377\374\346"
"\315\377\377\347\323\377\366\326\307\377\266\223\205\377\260\213|\377\255"
"\210z\377\276\232\214\377\363\324\304\377\376\345\323\377\376\345\323\377"
"\375\345\324\377\377\344\322\377\377\342\321\377\377\341\316\377\377\327"
"\301\377\377\317\266\377\377\314\260\377\377\321\261\377\377\314\250\377"
"\377\316\253\377\377\313\251\377\370\272\227\377\344\242\177\377\340\230"
"r\377\352\233r\377\365\235s\377\366\225j\377\370\221f\377\375\220d\377\374"
"\217`\377\374\220]\377\374\217]\377\375\217]\377\375\217\\\377\375\220[\377"
"\375\220Z\377\373\217X\377\373\217X\377\372\215W\377\373\215W\377\374\215"
"W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374"
"\215W\377\374\215W\377\374\215W\377\373\215W\377\372\215W\377\372\215X\377"
"\372\215Y\377\373\216Z\377\375\220[\377\375\217[\377\376\217[\377\376\221"
"\\\377\376\221\\\377\373\221^\377\370\222_\377\357\230f\377\351\240p\377"
"\360\271\211\0\354\307\227\0\347\311\231\0\342\312\233\0\340\311\232\0\337"
"\311\232\0\335\312\232\0\334\312\232\0\334\314\233\0\333\314\233\0\333\314"
"\234\0\332\311\235\0\333\310\237\0\340\313\244\0\361\333\273\377\372\342"
"\311\377\377\343\317\377\370\327\310\377\272\230\211\377\251\205w\377\253"
"\210y\377\277\233\215\377\363\324\305\377\377\347\326\377\376\345\323\377"
"\375\345\323\377\377\344\321\377\377\347\322\377\377\343\312\377\377\325"
"\270\377\376\320\257\377\377\320\254\377\377\322\254\377\377\315\246\377"
"\377\316\252\377\377\314\252\377\373\271\227\377\355\244\202\377\346\227"
"r\377\354\227p\377\363\227n\377\367\225i\377\371\223g\377\375\222f\377\374"
"\221b\377\374\221_\377\374\220^\377\375\217^\377\375\217]\377\375\220\\\377"
"\375\220[\377\373\217X\377\373\217X\377\372\215W\377\373\215W\377\374\215"
"W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374"
"\215W\377\374\215W\377\374\215W\377\373\215W\377\372\215W\377\372\215X\377"
"\372\215Y\377\372\215Y\377\373\216Z\377\375\217[\377\376\217[\377\377\220"
"\\\377\377\220\\\377\374\221]\377\372\222^\377\361\226d\377\354\236m\377"
"\364\265\205\0\360\300\222\0\351\301\222\0\345\305\227\0\345\311\232\0\342"
"\314\233\0\340\314\234\0\335\314\233\0\335\314\233\0\334\314\233\0\334\314"
"\234\0\334\312\236\0\336\311\240\0\337\311\241\0\332\302\241\377\331\277"
"\245\377\335\300\254\377\333\272\253\377\320\260\240\377\306\245\226\377"
"\300\241\221\377\322\264\244\377\363\327\307\377\377\347\326\377\377\344"
"\323\377\367\331\310\377\360\316\272\377\367\321\273\377\371\321\265\377"
"\370\317\255\377\372\315\250\377\377\320\247\377\377\321\250\377\364\301"
"\231\377\363\272\225\377\372\274\233\377\363\255\213\377\360\242\200\377"
"\354\231t\377\360\230q\377\364\227n\377\367\225i\377\372\224h\377\374\222"
"f\377\373\221b\377\373\221`\377\373\220_\377\375\217_\377\375\217^\377\375"
"\217]\377\375\220\\\377\373\217Y\377\373\217Y\377\372\215W\377\373\215W\377"
"\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215"
"W\377\374\215W\377\374\215W\377\374\215W\377\373\215W\377\372\215W\377\372"
"\215X\377\372\215Y\377\372\215Y\377\373\216Z\377\375\217[\377\375\217[\377"
"\376\221\\\377\375\221\\\377\375\221]\377\376\222`\377\366\224c\377\361\230"
"i\377\362\245x\377\356\254\200\0\350\257\203\0\350\270\213\0\351\304\224"
"\0\346\313\231\0\342\314\232\0\334\314\232\0\335\314\232\0\335\313\233\0"
"\335\314\234\0\337\314\241\0\337\312\240\0\332\303\233\0\302\250\210\377"
"\263\225}\377\257\220}\377\266\225\207\377\353\313\274\377\373\334\315\377"
"\367\331\311\377\373\340\317\377\374\341\320\377\377\344\323\377\377\342"
"\321\377\361\316\275\377\340\270\245\377\345\270\243\377\346\270\235\377"
"\365\310\247\377\377\321\255\377\377\322\252\377\373\310\241\377\344\256"
"\210\377\335\241}\377\341\237\177\377\347\235|\377\355\233z\377\361\232w"
"\377\364\231t\377\367\227p\377\371\226k\377\372\224i\377\374\223h\377\373"
"\222e\377\372\221a\377\373\220`\377\374\217_\377\374\217^\377\375\217]\377"
"\375\217]\377\373\216[\377\373\217Y\377\372\215W\377\373\215W\377\374\215"
"W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374"
"\215W\377\374\215W\377\374\215W\377\373\215W\377\373\215W\377\373\215X\377"
"\373\215X\377\373\215X\377\374\216Y\377\375\217[\377\375\217[\377\375\221"
"\\\377\374\221\\\377\375\221]\377\377\222_\377\372\223b\377\367\225f\377"
"\363\231l\377\355\232o\377\346\236q\377\347\253}\377\354\277\216\0\346\306"
"\224\0\343\312\227\0\335\314\231\0\337\315\233\0\337\313\233\0\335\313\234"
"\0\336\313\237\0\337\312\240\0\336\306\236\0\302\245\206\377\253\210t\377"
"\251\207w\377\265\223\211\377\352\311\275\377\377\336\317\377\377\342\321"
"\377\375\342\320\377\376\343\321\377\377\343\321\377\377\341\320\377\363"
"\313\274\377\342\264\242\377\350\264\240\377\350\264\235\377\364\300\245"
"\377\377\314\257\377\377\322\262\377\373\304\242\377\346\252\211\377\343"
"\241\200\377\347\237\200\377\353\235}\377\357\232{\377\361\230w\377\365\230"
"s\377\370\227q\377\372\225n\377\372\224k\377\373\223j\377\373\222f\377\372"
"\221b\377\372\220`\377\372\216^\377\373\216]\377\373\216\\\377\373\216\\"
"\377\373\216\\\377\373\216[\377\372\215X\377\373\215X\377\374\215X\377\374"
"\215X\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377"
"\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215"
"W\377\374\215W\377\375\216X\377\376\217Z\377\376\217[\377\376\221\\\377\375"
"\221\\\377\376\221]\377\376\221]\377\375\222`\377\374\222c\377\372\224e\377"
"\371\227h\377\355\231i\377\356\250w\377\366\301\216\0\353\307\223\0\345\310"
"\224\0\340\313\227\0\341\314\232\0\342\314\233\0\336\313\233\0\334\312\236"
"\0\335\310\236\0\333\304\234\0\301\245\205\377\255\213t\377\253\213y\377"
"\267\227\212\377\356\315\275\377\377\337\316\377\377\341\316\377\377\341"
"\315\377\377\337\312\377\377\337\311\377\377\334\310\377\374\311\266\377"
"\350\260\233\377\352\256\230\377\356\263\233\377\367\276\244\377\375\305"
"\251\377\377\312\254\377\371\274\236\377\353\251\212\377\345\235~\377\352"
"\234}\377\357\234}\377\361\230z\377\363\226v\377\365\224s\377\367\224q\377"
"\371\223p\377\372\223n\377\373\223m\377\374\223i\377\373\221d\377\372\220"
"a\377\373\217`\377\374\217_\377\375\217^\377\373\216\\\377\373\216\\\377"
"\373\216[\377\372\215Y\377\373\215Y\377\374\215Y\377\374\215X\377\374\215"
"W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374"
"\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377"
"\375\216X\377\376\217Z\377\376\217[\377\377\220\\\377\376\221\\\377\376\221"
"\\\377\376\221\\\377\376\221^\377\377\222a\377\375\222a\377\375\224b\377"
"\363\226d\377\362\241n\377\366\265\202\0\356\275\212\0\350\300\215\0\344"
"\305\223\0\344\312\230\0\342\312\231\0\337\313\232\0\332\311\235\0\331\306"
"\234\0\332\304\234\0\320\270\224\0\303\250\210\377\305\251\216\377\310\253"
"\224\377\350\310\261\377\362\314\266\377\366\313\265\377\367\310\261\377"
"\367\302\251\377\371\277\244\377\377\277\244\377\373\265\233\377\357\251"
"\216\377\356\246\213\377\353\250\213\377\357\260\222\377\357\262\222\377"
"\356\262\222\377\361\256\217\377\354\242\204\377\355\236\177\377\360\233"
"}\377\360\227y\377\354\216o\377\352\210j\377\354\210i\377\355\207i\377\357"
"\207h\377\361\210g\377\364\212h\377\367\215f\377\375\222g\377\374\220d\377"
"\374\217a\377\374\217`\377\375\217_\377\373\216]\377\373\216\\\377\373\216"
"[\377\373\216Z\377\374\216Z\377\375\216Z\377\374\215X\377\374\215W\377\374"
"\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377"
"\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\375\216"
"X\377\376\217Z\377\376\217[\377\377\220\\\377\376\221\\\377\376\221\\\377"
"\376\221\\\377\376\221]\377\376\221]\377\375\221^\377\375\222`\377\371\226"
"d\377\366\232g\377\370\247u\377\360\251x\0\350\256~\0\345\270\207\0\347\304"
"\224\0\343\312\231\0\337\313\232\0\333\312\236\0\332\307\235\0\337\312\241"
"\0\341\313\244\0\331\303\235\0\334\303\241\0\325\272\234\0\341\300\243\377"
"\340\270\236\377\346\265\234\377\351\260\227\377\351\251\216\377\356\250"
"\212\377\361\245\210\377\365\244\207\377\361\242\205\377\360\243\205\377"
"\347\237\201\377\347\245\206\377\344\243\204\377\342\242\203\377\352\244"
"\206\377\351\235\200\377\360\236\202\377\370\242\206\377\353\221u\377\342"
"\203g\377\334z_\377\343~c\377\343~c\377\344~c\377\345~`\377\346~^\377\362"
"\210d\377\376\222j\377\377\221g\377\377\220c\377\375\217a\377\375\217_\377"
"\375\217^\377\375\217]\377\373\216[\377\373\216Z\377\374\216Z\377\375\216"
"Z\377\374\215X\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374"
"\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377"
"\374\215W\377\374\215W\377\375\216X\377\376\217Z\377\376\217[\377\377\220"
"\\\377\376\221\\\377\376\221\\\377\376\221\\\377\376\221\\\377\376\221\\"
"\377\375\221]\377\375\222_\377\375\225b\377\370\224a\377\370\233j\377\362"
"\233l\377\347\236o\377\345\252|\377\351\274\215\0\347\311\231\0\343\313\233"
"\0\333\312\236\0\332\311\235\0\330\306\233\0\330\305\233\0\333\307\235\0"
"\335\306\240\0\336\304\241\0\342\300\237\377\344\273\235\377\352\266\232"
"\377\357\261\230\377\354\247\214\377\360\244\210\377\362\242\206\377\366"
"\241\205\377\363\242\205\377\360\243\206\377\352\243\207\377\344\243\207"
"\377\344\243\207\377\344\243\207\377\350\242\206\377\354\241\205\377\357"
"\240\206\377\361\237\206\377\350\222{\377\335\204l\377\330{c\377\340~g\377"
"\336|d\377\336|c\377\337|`\377\340|^\377\356\206d\377\377\223n\377\377\222"
"i\377\377\217d\377\377\220b\377\376\220a\377\375\217^\377\375\217]\377\375"
"\217\\\377\375\220[\377\376\217[\377\376\217[\377\375\216Y\377\375\216X\377"
"\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215"
"W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\375"
"\216X\377\375\216Y\377\375\216Z\377\376\217[\377\375\220[\377\375\220[\377"
"\376\221\\\377\376\221\\\377\376\221\\\377\375\221]\377\375\222^\377\377"
"\225a\377\373\223`\377\372\224d\377\367\225f\377\354\230j\377\354\247z\377"
"\365\276\217\0\364\313\234\0\355\314\235\0\333\314\237\0\331\311\235\0\327"
"\307\233\0\327\307\233\0\332\311\236\0\336\311\241\0\341\312\244\0\342\304"
"\241\0\340\274\234\377\342\265\230\377\347\262\230\377\347\254\223\377\353"
"\252\221\377\353\250\220\377\355\247\221\377\351\247\220\377\346\250\221"
"\377\343\251\223\377\336\250\223\377\336\250\223\377\336\250\222\377\340"
"\250\222\377\343\247\221\377\345\246\222\377\347\245\223\377\335\230\207"
"\377\325\215}\377\322\206w\377\325\205v\377\322\203r\377\321\202o\377\324"
"\202j\377\327\201e\377\362\224s\377\374\226p\377\376\222k\377\377\220f\377"
"\377\221d\377\376\220a\377\375\217^\377\375\217]\377\375\217\\\377\375\220"
"[\377\376\217[\377\376\217[\377\375\216Y\377\375\216X\377\374\215W\377\374"
"\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377"
"\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\375\216"
"Y\377\375\216Z\377\374\216Z\377\373\216Z\377\375\217[\377\375\217[\377\375"
"\217[\377\375\217[\377\376\221\\\377\376\222^\377\377\223`\377\375\222`\377"
"\375\224c\377\373\224d\377\363\230i\377\361\241t\377\365\262\204\0\360\272"
"\214\0\351\274\216\0\331\313\236\0\330\311\236\0\327\310\235\0\327\310\235"
"\0\332\312\240\0\334\313\242\0\334\313\244\0\334\310\243\0\332\304\241\0"
"\330\276\237\0\344\305\252\377\370\327\300\377\377\336\313\377\377\336\316"
"\377\377\335\321\377\377\335\320\377\375\335\321\377\374\335\321\377\372"
"\334\320\377\371\335\320\377\371\335\317\377\372\335\317\377\374\334\316"
"\377\375\332\317\377\375\330\320\377\376\326\320\377\373\321\315\377\370"
"\314\310\377\372\313\310\377\371\313\303\377\371\313\300\377\376\311\266"
"\377\377\307\255\377\371\254\214\377\364\231s\377\370\224k\377\377\222g\377"
"\377\222e\377\377\221b\377\376\220`\377\376\221^\377\375\217\\\377\375\220"
"[\377\376\217[\377\376\217[\377\376\217Z\377\375\216X\377\374\215W\377\374"
"\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377"
"\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215"
"X\377\374\215Y\377\374\216Z\377\373\216Z\377\374\216Z\377\375\216Z\377\375"
"\216Z\377\376\217[\377\377\220\\\377\377\222^\377\377\222_\377\375\222`\377"
"\375\224b\377\373\224c\377\367\227g\377\366\235o\377\363\243t\377\351\243"
"s\377\342\251{\377\330\312\235\0\330\312\236\0\327\310\236\0\330\311\237"
"\0\332\314\242\0\335\316\245\0\333\313\244\0\331\312\245\0\330\311\245\0"
"\333\312\254\0\345\324\273\377\371\351\326\377\377\362\345\377\377\362\351"
"\377\377\362\355\377\376\361\354\377\376\361\354\377\376\361\354\377\374"
"\360\353\377\374\360\352\377\373\361\351\377\374\360\351\377\375\360\351"
"\377\377\357\353\377\377\360\356\377\377\357\357\377\377\357\361\377\377"
"\356\357\377\377\355\357\377\377\356\354\377\377\357\352\377\377\355\341"
"\377\377\354\327\377\371\270\232\377\361\232s\377\366\225k\377\376\223g\377"
"\377\223f\377\377\221c\377\376\220`\377\376\220_\377\375\217]\377\375\220"
"\\\377\376\217\\\377\376\217\\\377\376\217[\377\375\216X\377\374\215W\377"
"\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215"
"W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374\215W\377\374"
"\215X\377\374\215Y\377\375\216Z\377\374\216Z\377\374\216Z\377\375\216Z\377"
"\375\216Z\377\376\217[\377\377\220]\377\377\221^\377\377\222_\377\375\222"
"`\377\374\224b\377\373\224c\377\371\226f\377\371\231j\377\367\235m\377\357"
"\232k\377\345\243t\377\330\312\235\0\330\312\236\0\330\311\237\0\331\313"
"\241\0\333\315\244\0\334\315\244\0\335\314\245\0\332\312\245\0\333\313\250"
"\0\331\313\256\0\340\326\277\377\360\353\334\377\365\365\355\377\363\364"
"\357\377\363\365\363\377\364\363\362\377\363\360\360\377\370\365\365\377"
"\362\357\357\377\360\356\355\377\364\363\362\377\367\364\362\377\360\354"
"\351\377\367\361\360\377\371\362\363\377\371\362\363\377\372\363\365\377"
"\367\361\363\377\365\360\362\377\366\357\360\377\367\357\357\377\377\356"
"\350\377\377\354\341\377\364\271\240\377\363\232s\377\367\225k\377\377\224"
"h\377\377\224h\377\376\222e\377\375\220b\377\376\220`\377\375\217^\377\375"
"\217]\377\376\217]\377\376\217]\377\375\216[\377\375\216Y\377\375\216Y\377"
"\374\215X\377\374\215X\377\374\215X\377\374\215X\377\374\215X\377\373\215"
"X\377\373\215W\377\373\215W\377\373\215W\377\373\215W\377\374\215W\377\374"
"\215X\377\374\215Y\377\375\216Z\377\375\216Z\377\374\216Z\377\374\216Z\377"
"\374\216Z\377\375\217[\377\375\217\\\377\376\220^\377\374\221^\377\374\223"
"`\377\374\224b\377\373\224c\377\373\224c\377\375\227f\377\372\226g\377\370"
"\226i\377\353\241r\377\331\313\236\0\331\313\237\0\331\313\240\0\331\312"
"\241\0\334\315\244\0\334\314\244\0\335\314\244\0\334\313\244\0\336\315\251"
"\0\330\313\256\0\336\326\301\0\355\354\336\377\360\366\360\377\357\365\362"
"\377\352\360\361\377\345\350\352\377\345\345\347\377\350\347\352\377\354"
"\354\357\377\362\363\366\377\366\370\373\377\367\367\371\377\355\353\355"
"\377\355\352\356\377\355\351\356\377\353\350\354\377\357\355\361\377\362"
"\362\365\377\360\362\365\377\360\361\363\377\361\361\363\377\372\357\354"
"\377\377\355\345\377\362\271\242\377\363\232s\377\367\224l\377\377\224i\377"
"\377\224h\377\376\223g\377\376\222d\377\375\220a\377\374\217^\377\375\217"
"]\377\376\217]\377\375\216\\\377\375\216[\377\375\216Z\377\375\216Z\377\375"
"\216Z\377\374\215Y\377\374\215Y\377\374\215Y\377\374\215Y\377\373\215X\377"
"\372\215W\377\372\215W\377\372\215W\377\373\215W\377\374\215W\377\375\216"
"Y\377\375\216Z\377\375\216Z\377\375\216Z\377\374\216Z\377\373\216Z\377\373"
"\216Z\377\375\220[\377\374\220\\\377\375\221^\377\374\221^\377\373\223`\377"
"\374\224b\377\373\224b\377\374\224b\377\377\226e\377\375\225e\377\375\225"
"g\377\355\237o\377\332\314\236\0\332\314\240\0\332\314\241\0\333\314\242"
"\0\335\314\243\0\335\314\242\0\335\314\242\0\336\316\244\0\336\315\245\0"
"\330\313\254\0\337\326\277\0\360\355\337\377\363\365\360\377\361\363\361"
"\377\343\343\345\377\324\322\325\377\325\320\324\377\322\315\321\377\344"
"\337\344\377\363\357\364\377\363\360\366\377\360\354\363\377\332\324\335"
"\377\321\312\322\377\322\311\323\377\337\330\340\377\356\350\357\377\361"
"\357\364\377\357\361\365\377\357\361\363\377\360\361\362\377\372\357\352"
"\377\377\355\343\377\362\271\241\377\363\232s\377\366\225l\377\377\225k\377"
"\377\225i\377\376\223f\377\375\222c\377\374\221a\377\375\221`\377\375\217"
"]\377\374\216\\\377\375\216\\\377\375\216[\377\375\216Z\377\375\216Z\377"
"\375\216Z\377\374\215Y\377\374\215Y\377\374\215Y\377\374\215Y\377\373\215"
"X\377\372\215W\377\372\215W\377\372\215W\377\374\217X\377\374\217X\377\375"
"\216Y\377\375\216Z\377\375\216Z\377\375\216Z\377\374\216Z\377\373\216Z\377"
"\373\216Z\377\375\220[\377\374\220\\\377\374\221^\377\373\221^\377\373\223"
"`\377\374\224a\377\374\224a\377\374\224a\377\376\225b\377\375\225d\377\374"
"\225e\377\354\240m\377\332\314\236\0\332\314\240\0\332\314\241\0\334\315"
"\243\0\335\314\243\0\335\316\244\0\335\316\244\0\334\316\246\0\334\316\250"
"\0\326\314\256\0\336\326\301\0\360\354\340\377\364\365\361\377\362\361\361"
"\377\336\333\337\377\314\307\313\377\315\305\312\377\316\306\314\377\345"
"\335\344\377\366\357\366\377\370\361\371\377\363\353\364\377\331\320\332"
"\377\312\300\311\377\313\277\311\377\326\315\324\377\363\352\360\377\366"
"\362\366\377\352\353\356\377\360\361\362\377\361\363\362\377\373\360\353"
"\377\377\356\344\377\360\272\244\377\357\233x\377\362\226q\377\372\226p\377"
"\376\227m\377\375\223e\377\375\222c\377\375\222b\377\375\221`\377\375\217"
"^\377\374\216]\377\375\216]\377\375\216\\\377\375\216[\377\375\216Z\377\375"
"\216Z\377\375\216Z\377\374\215Y\377\374\215Y\377\374\215Y\377\373\215X\377"
"\372\215W\377\373\217X\377\373\217X\377\373\217X\377\373\217X\377\374\216"
"Y\377\375\216Z\377\375\216Z\377\375\216[\377\374\216Z\377\373\216Z\377\373"
"\216Z\377\375\220[\377\374\220\\\377\375\222_\377\373\221^\377\374\223_\377"
"\375\224`\377\375\224a\377\375\224a\377\376\225b\377\376\226e\377\375\227"
"f\377\354\240m\377\333\315\240\0\333\315\241\0\332\315\243\0\333\315\243"
"\0\335\316\245\0\334\316\250\0\332\316\252\0\333\321\257\0\332\321\261\0"
"\331\322\272\0\336\331\310\0\360\356\345\377\363\363\362\377\366\364\366"
"\377\346\342\347\377\315\306\314\377\320\307\315\377\322\311\320\377\347"
"\336\345\377\370\357\365\377\370\360\367\377\356\344\354\377\332\317\327"
"\377\316\302\310\377\323\306\314\377\334\320\323\377\363\351\352\377\373"
"\366\366\377\363\362\362\377\361\361\360\377\361\361\357\377\374\360\354"
"\377\377\355\347\377\355\275\255\377\344\233\202\377\356\235\200\377\366"
"\235}\377\371\230q\377\372\223d\377\373\222d\377\374\222c\377\375\222b\377"
"\375\217_\377\374\216^\377\375\216^\377\375\216]\377\376\217]\377\376\217"
"\\\377\375\216Z\377\375\216Z\377\375\216Z\377\375\216Z\377\375\216Z\377\373"
"\215X\377\373\217X\377\373\217X\377\373\217X\377\373\217X\377\373\217X\377"
"\374\216Y\377\375\216Z\377\375\216[\377\375\216\\\377\374\216[\377\373\216"
"Z\377\373\216Z\377\375\220[\377\375\221]\377\375\222^\377\375\222^\377\376"
"\224_\377\376\225a\377\376\225b\377\376\225c\377\377\226e\377\376\226f\377"
"\375\226g\377\355\241o\377\333\315\241\0\332\315\242\0\331\315\243\0\332"
"\315\244\0\333\315\245\0\331\315\251\0\334\322\262\0\340\330\274\0\340\332"
"\302\0\340\335\312\0\346\343\327\377\362\361\353\377\363\363\363\377\360"
"\356\360\377\351\345\352\377\335\327\334\377\340\327\335\377\340\330\335"
"\377\342\332\337\377\343\332\337\377\350\336\343\377\347\334\340\377\340"
"\323\327\377\337\321\322\377\342\323\321\377\347\332\325\377\364\350\340"
"\377\367\357\350\377\365\360\353\377\362\360\354\377\363\362\357\377\372"
"\357\353\377\377\360\352\377\357\314\300\377\355\272\250\377\365\267\240"
"\377\375\264\231\377\365\236y\377\372\224e\377\372\223d\377\374\224f\377"
"\375\222c\377\374\217`\377\374\216_\377\375\216^\377\375\216]\377\376\217"
"^\377\376\217]\377\376\217\\\377\375\216[\377\375\216[\377\375\216Z\377\375"
"\216Z\377\374\216Y\377\373\217X\377\373\217X\377\373\217X\377\374\217X\377"
"\374\217X\377\375\216Y\377\375\216Z\377\375\216[\377\375\216\\\377\374\216"
"[\377\373\216[\377\373\216[\377\375\220\\\377\375\221]\377\374\221\\\377"
"\375\222^\377\376\224_\377\377\225a\377\376\225b\377\376\225c\377\377\226"
"f\377\376\226g\377\375\226h\377\355\241p\377\333\315\242\0\332\315\242\0"
"\331\315\243\0\332\315\244\0\332\315\245\0\327\314\252\0\335\324\270\0\353"
"\344\317\377\360\353\334\377\355\352\337\377\360\357\350\377\363\362\356"
"\377\363\363\362\377\360\360\360\377\361\357\362\377\356\352\356\377\360"
"\352\356\377\360\352\355\377\335\327\332\377\320\311\312\377\324\313\313"
"\377\335\322\317\377\347\330\324\377\360\340\330\377\356\336\322\377\362"
"\343\324\377\370\353\330\377\365\352\333\377\363\354\337\377\365\357\347"
"\377\365\360\355\377\367\360\354\377\367\356\352\377\372\353\342\377\374"
"\346\332\377\377\342\321\377\377\327\301\377\361\244\202\377\376\231j\377"
"\371\223e\377\373\224g\377\375\223f\377\374\221b\377\374\217`\377\375\217"
"_\377\374\216^\377\375\217_\377\375\217^\377\375\217]\377\374\216\\\377\374"
"\216\\\377\374\216[\377\374\216Z\377\374\216Z\377\373\217Y\377\373\217Y\377"
"\373\217X\377\374\216X\377\375\216X\377\375\216Y\377\375\216Z\377\375\216"
"Z\377\374\216[\377\374\216[\377\373\216\\\377\373\216\\\377\375\217]\377"
"\375\221]\377\374\221\\\377\375\222^\377\376\224_\377\377\225a\377\376\225"
"b\377\376\225d\377\377\226g\377\376\226h\377\375\226i\377\355\241q\377\333"
"\315\242\0\333\315\242\0\332\315\243\0\332\315\244\0\331\315\245\0\326\314"
"\253\0\337\326\275\0\360\352\331\377\370\364\354\377\366\365\356\377\363"
"\364\360\377\363\364\361\377\363\364\362\377\361\361\361\377\361\361\363"
"\377\365\363\365\377\370\363\367\377\366\362\364\377\336\332\333\377\314"
"\306\305\377\315\304\302\377\321\306\301\377\351\333\323\377\367\350\335"
"\377\366\347\330\377\364\346\325\377\365\347\324\377\364\351\330\377\357"
"\345\330\377\363\353\343\377\364\357\354\377\365\360\355\377\366\361\356"
"\377\371\364\356\377\374\370\360\377\377\355\340\377\377\346\324\377\357"
"\251\210\377\375\231j\377\371\224f\377\373\224g\377\375\223f\377\375\222"
"d\377\375\221b\377\374\217_\377\374\217_\377\374\217_\377\374\217^\377\374"
"\217]\377\374\217]\377\373\216\\\377\373\216[\377\373\216[\377\373\216Z\377"
"\373\216Z\377\373\217Y\377\373\217X\377\374\216X\377\375\216X\377\375\216"
"Y\377\375\216[\377\374\216[\377\373\216[\377\373\216[\377\373\216\\\377\373"
"\216\\\377\375\217]\377\375\221]\377\374\221\\\377\375\222^\377\375\222^"
"\377\377\225a\377\376\225b\377\376\225d\377\377\226g\377\376\226h\377\375"
"\226i\377\355\241r\377\332\314\240\0\332\314\241\0\332\314\241\0\331\314"
"\243\0\331\315\245\0\326\314\253\0\337\330\276\0\361\353\334\377\367\363"
"\356\377\365\363\360\377\362\362\361\377\361\362\361\377\361\363\362\377"
"\361\362\363\377\362\362\364\377\363\362\364\377\363\360\363\377\363\360"
"\362\377\333\330\331\377\313\306\305\377\317\310\305\377\331\320\313\377"
"\355\341\332\377\364\347\336\377\363\345\333\377\363\346\333\377\363\346"
"\333\377\362\347\336\377\362\351\341\377\361\353\347\377\363\357\355\377"
"\364\360\356\377\366\361\357\377\365\362\357\377\365\362\356\377\377\360"
"\347\377\377\344\325\377\354\252\213\377\372\231j\377\371\225g\377\374\225"
"h\377\376\225g\377\376\223e\377\374\221b\377\374\221a\377\373\220_\377\373"
"\220_\377\373\220^\377\373\220]\377\374\220]\377\375\217]\377\373\216\\\377"
"\373\216\\\377\373\216[\377\373\216Z\377\373\216Z\377\373\217Y\377\374\216"
"Y\377\374\216Y\377\374\216[\377\374\216\\\377\374\216\\\377\373\216\\\377"
"\373\216\\\377\373\220]\377\374\220]\377\376\221^\377\375\221]\377\375\222"
"^\377\375\222^\377\376\223`\377\377\225b\377\376\225b\377\376\225d\377\376"
"\225f\377\376\226h\377\375\226i\377\354\237q\377\331\313\236\0\331\313\237"
"\0\332\314\241\0\331\314\242\0\330\314\244\0\324\313\252\0\335\327\274\0"
"\361\353\334\377\367\363\357\377\366\363\362\377\363\362\363\377\362\362"
"\363\377\361\362\363\377\360\361\362\377\361\361\363\377\363\362\364\377"
"\362\360\363\377\362\361\362\377\346\344\345\377\341\336\335\377\336\331"
"\327\377\346\340\334\377\363\353\345\377\365\354\346\377\367\355\346\377"
"\367\355\347\377\367\355\350\377\367\356\352\377\366\357\353\377\365\360"
"\356\377\362\361\357\377\363\360\357\377\365\361\360\377\364\362\360\377"
"\363\362\361\377\377\360\351\377\377\344\330\377\352\252\215\377\371\231"
"k\377\371\226h\377\375\226i\377\377\226h\377\376\223e\377\375\222c\377\374"
"\221a\377\373\220_\377\373\220_\377\373\220^\377\373\220]\377\374\220]\377"
"\374\217]\377\373\216\\\377\373\216\\\377\373\216[\377\373\216Z\377\373\216"
"Z\377\373\216Z\377\373\216Z\377\373\216Z\377\373\216[\377\373\216\\\377\373"
"\216\\\377\373\216\\\377\372\217\\\377\373\220]\377\374\220]\377\376\221"
"^\377\375\221^\377\376\222^\377\375\222_\377\376\223a\377\377\225b\377\376"
"\225b\377\376\225e\377\376\225g\377\376\226i\377\375\226j\377\354\237q\377"
"\330\312\235\0\330\312\235\0\331\313\237\0\330\313\241\0\327\313\242\0\324"
"\313\251\0\335\327\273\0\360\352\332\377\370\362\357\377\366\362\363\377"
"\363\361\365\377\363\362\365\377\362\362\364\377\361\361\363\377\361\361"
"\363\377\361\361\363\377\357\360\362\377\360\360\362\377\360\360\361\377"
"\360\356\357\377\355\353\352\377\361\356\354\377\370\364\361\377\367\363"
"\357\377\367\363\356\377\367\363\357\377\367\362\360\377\367\363\361\377"
"\366\363\362\377\365\363\362\377\364\363\363\377\363\362\361\377\364\362"
"\360\377\363\362\361\377\363\362\362\377\377\360\352\377\377\344\331\377"
"\352\252\215\377\371\231k\377\371\226g\377\375\226h\377\376\226h\377\376"
"\225f\377\376\223d\377\375\222b\377\374\221a\377\374\221a\377\373\220^\377"
"\373\220]\377\373\220]\377\373\220]\377\373\216\\\377\373\216\\\377\373\216"
"[\377\373\216Z\377\373\216Z\377\373\216Z\377\373\216Z\377\373\216Z\377\373"
"\216[\377\373\216\\\377\373\216\\\377\372\217\\\377\372\217\\\377\373\220"
"]\377\374\220]\377\376\221^\377\376\221^\377\377\222_\377\376\222_\377\376"
"\223a\377\377\225c\377\377\225d\377\376\225f\377\376\225h\377\375\226j\377"
"\374\226k\377\355\237r\377\331\313\236\0\330\312\236\0\332\314\241\0\330"
"\313\243\0\330\314\250\0\324\313\255\0\336\326\277\0\361\351\335\377\371"
"\362\360\377\370\362\364\377\365\361\366\377\364\361\366\377\363\361\365"
"\377\362\360\364\377\362\360\364\377\361\361\364\377\357\360\362\377\361"
"\361\364\377\363\362\365\377\363\362\364\377\361\361\362\377\361\357\360"
"\377\363\361\360\377\363\361\357\377\364\362\357\377\364\362\360\377\364"
"\362\361\377\365\361\362\377\365\361\363\377\364\361\363\377\364\362\363"
"\377\365\361\362\377\366\361\361\377\365\361\362\377\364\362\363\377\377"
"\360\353\377\377\344\332\377\353\253\217\377\371\231k\377\372\227h\377\375"
"\226g\377\376\226g\377\376\225f\377\377\224e\377\376\223c\377\375\222b\377"
"\374\221a\377\374\221`\377\373\220^\377\373\220^\377\373\220^\377\373\216"
"\\\377\373\216\\\377\373\216[\377\373\216[\377\373\216Z\377\373\216Z\377"
"\373\216Z\377\373\216Z\377\373\216[\377\373\216\\\377\373\217\\\377\372\217"
"\\\377\372\217\\\377\373\220]\377\374\220]\377\375\221^\377\375\221_\377"
"\377\222`\377\376\222`\377\376\223b\377\376\223c\377\377\224e\377\374\225"
"g\377\371\226i\377\367\230k\377\364\231m\377\350\240s\377\327\311\232\0\330"
"\311\237\0\331\312\243\0\325\310\247\0\323\310\255\0\324\312\265\0\331\317"
"\302\377\355\344\335\377\364\354\354\377\363\354\357\377\362\354\362\377"
"\362\354\361\377\362\354\361\377\361\354\361\377\360\354\361\377\357\355"
"\361\377\360\356\362\377\360\356\362\377\360\356\362\377\360\356\362\377"
"\360\356\362\377\360\356\361\377\360\356\360\377\357\355\356\377\357\355"
"\356\377\360\355\356\377\357\353\355\377\360\353\356\377\361\353\356\377"
"\361\353\356\377\362\353\356\377\363\352\355\377\365\353\355\377\363\352"
"\355\377\361\351\355\377\371\345\342\377\377\341\330\377\353\252\216\377"
"\371\231k\377\372\227h\377\375\226g\377\376\226g\377\376\225f\377\377\226"
"g\377\375\222c\377\376\223d\377\374\221a\377\373\220_\377\373\220_\377\373"
"\220_\377\373\220_\377\374\220^\377\375\217]\377\375\217]\377\375\217]\377"
"\375\217\\\377\375\220[\377\375\220[\377\375\220[\377\375\217\\\377\375\217"
"]\377\374\220]\377\373\220]\377\373\220]\377\374\221^\377\374\221^\377\376"
"\222`\377\376\222`\377\376\222a\377\376\223c\377\375\223d\377\377\224f\377"
"\377\224g\377\367\226i\377\360\232k\377\356\237p\377\354\242u\377\343\251"
"{\377\325\307\231\0\327\310\237\0\331\312\246\0\324\306\253\0\323\306\264"
"\0\321\304\271\377\321\305\301\377\330\315\315\377\334\321\325\377\333\322"
"\327\377\332\322\330\377\332\322\330\377\332\322\331\377\332\322\331\377"
"\331\322\331\377\330\322\331\377\331\323\332\377\331\323\332\377\331\323"
"\332\377\331\323\332\377\331\323\331\377\331\323\330\377\332\323\330\377"
"\330\322\326\377\330\322\326\377\331\322\326\377\331\321\325\377\331\320"
"\325\377\332\320\325\377\333\320\325\377\334\320\325\377\335\320\324\377"
"\337\321\324\377\335\320\324\377\333\317\324\377\342\312\311\377\354\307"
"\277\377\352\247\215\377\370\230k\377\373\230k\377\375\226h\377\377\227i"
"\377\376\226h\377\377\226h\377\377\224g\377\377\224f\377\376\223c\377\374"
"\221a\377\374\221a\377\374\221a\377\374\221a\377\374\221`\377\375\221_\377"
"\375\221_\377\375\221_\377\375\221^\377\375\221]\377\375\221]\377\375\221"
"]\377\375\221^\377\375\221^\377\375\221^\377\374\221^\377\374\221^\377\375"
"\222`\377\375\222`\377\376\223a\377\376\223b\377\376\223c\377\375\223d\377"
"\375\223f\377\377\224h\377\377\224i\377\365\232l\377\357\246v\377\364\264"
"\204\0\360\271\211\0\344\270\211\0\327\311\233\0\325\307\237\0\324\305\243"
"\0\321\302\254\0\322\302\271\377\317\277\275\377\317\300\306\377\315\277"
"\306\377\313\277\307\377\313\277\307\377\314\301\310\377\314\301\311\377"
"\314\301\311\377\313\301\311\377\313\301\311\377\313\301\311\377\314\302"
"\313\377\315\302\313\377\315\302\313\377\315\302\312\377\315\302\311\377"
"\316\302\311\377\317\301\310\377\315\300\306\377\315\300\306\377\316\300"
"\306\377\315\277\305\377\316\277\305\377\317\277\305\377\317\276\305\377"
"\317\276\306\377\320\276\305\377\322\277\305\377\320\276\305\377\316\275"
"\305\377\325\271\271\377\335\266\257\377\350\244\213\377\370\227m\377\374"
"\231n\377\375\230l\377\376\227k\377\376\226i\377\377\226i\377\377\225i\377"
"\377\225h\377\377\224f\377\376\223d\377\374\222c\377\374\222c\377\374\222"
"c\377\375\222b\377\376\222a\377\376\222a\377\374\221`\377\374\221_\377\374"
"\221^\377\374\221^\377\374\221^\377\374\221^\377\374\221^\377\374\221^\377"
"\375\222`\377\375\222`\377\375\222`\377\375\222`\377\376\223b\377\376\223"
"c\377\375\224c\377\376\225f\377\376\225h\377\377\225j\377\377\225k\377\361"
"\234o\377\356\261\200\0\366\305\224\0\355\311\227\0\350\311\230\0\330\312"
"\235\0\325\307\237\0\323\304\241\0\323\303\254\377\324\303\270\377\321\300"
"\274\377\321\300\302\377\321\303\305\377\317\303\305\377\321\303\306\377"
"\317\276\304\377\324\300\311\377\326\277\313\377\326\277\313\377\327\277"
"\313\377\326\277\313\377\327\300\315\377\326\301\313\377\325\301\311\377"
"\323\302\307\377\322\303\305\377\323\304\306\377\322\302\305\377\322\301"
"\304\377\325\302\305\377\326\300\305\377\327\276\305\377\331\275\305\377"
"\333\274\306\377\333\274\307\377\332\274\310\377\332\275\306\377\333\276"
"\306\377\327\276\303\377\324\277\302\377\331\273\266\377\336\270\252\377"
"\341\243\207\377\356\231n\377\366\234q\377\371\232n\377\372\230l\377\375"
"\230k\377\376\226j\377\377\225i\377\377\225h\377\377\225g\377\376\224f\377"
"\375\223e\377\375\223e\377\375\223e\377\375\223d\377\375\222b\377\375\222"
"b\377\375\222b\377\375\222a\377\375\222`\377\375\222`\377\375\222`\377\375"
"\222`\377\375\222`\377\375\222`\377\375\222`\377\375\222_\377\376\224`\377"
"\376\223a\377\376\223b\377\376\223c\377\376\225e\377\374\225f\377\374\227"
"i\377\372\227k\377\371\231n\377\347\236p\377\345\262\201\0\354\306\224\0"
"\341\310\225\0\341\313\231\0\331\313\236\0\325\307\236\0\323\304\236\0\323"
"\304\245\0\323\303\253\0\330\307\264\0\327\307\270\0\324\306\270\0\323\307"
"\270\0\330\305\277\0\326\273\276\377\331\266\277\377\336\262\303\377\337"
"\262\303\377\340\261\303\377\337\262\304\377\336\262\305\377\325\261\274"
"\377\330\273\276\377\331\302\300\377\325\304\273\377\325\305\275\377\325"
"\306\276\377\330\304\300\377\334\303\301\377\341\276\302\377\340\264\275"
"\377\341\260\274\377\345\257\276\377\344\257\277\377\343\257\300\377\341"
"\261\276\377\336\263\274\377\330\265\265\377\332\300\270\377\334\275\254"
"\377\336\273\240\377\336\255\210\377\347\250z\377\353\242u\377\361\237r\377"
"\367\234p\377\374\230l\377\375\226j\377\377\225i\377\377\226h\377\377\226"
"g\377\377\226g\377\375\223e\377\376\225f\377\376\225f\377\375\223e\377\375"
"\223d\377\375\223d\377\374\222b\377\375\222a\377\375\222a\377\375\222`\377"
"\375\222`\377\375\222`\377\375\222`\377\375\222`\377\375\222`\377\376\224"
"`\377\375\224_\377\376\224`\377\376\223a\377\377\224d\377\377\224f\377\373"
"\227h\377\367\232k\377\363\240r\377\355\244v\377\340\246w\377\342\267\207"
"\0\347\306\225\0\340\311\227\0\336\312\231\0\332\314\236\0\331\313\237\0"
"\331\313\240\0\330\311\243\0\324\304\242\0\321\301\243\0\324\303\250\0\327"
"\307\254\0\326\307\255\0\337\305\266\0\334\266\263\377\317\234\244\377\323"
"\223\245\377\322\217\241\377\324\216\241\377\321\217\242\377\317\217\243"
"\377\307\224\234\377\330\261\256\377\346\312\277\377\335\312\267\0\327\306"
"\263\0\326\306\264\0\333\305\266\0\341\304\272\377\335\260\257\377\324\230"
"\237\377\323\217\234\377\330\215\237\377\326\214\237\377\326\214\240\377"
"\317\215\233\377\314\221\231\377\332\254\247\377\337\276\253\0\335\276\242"
"\0\334\276\230\0\343\275\223\0\357\301\221\0\366\274\215\0\373\263\205\377"
"\362\235q\377\372\230m\377\374\226k\377\377\226j\377\377\226i\377\377\226"
"h\377\377\226h\377\375\225g\377\375\225f\377\375\225f\377\375\225f\377\374"
"\224e\377\374\224d\377\374\224c\377\374\222b\377\375\222b\377\375\222a\377"
"\375\222`\377\375\222`\377\375\222`\377\375\222`\377\375\222`\377\375\224"
"`\377\375\224_\377\376\224`\377\376\223a\377\377\225d\377\376\225f\377\362"
"\224d\377\363\241p\377\375\271\210\0\366\300\220\0\350\275\214\0\345\304"
"\223\0\340\306\225\0\334\311\227\0\335\314\232\0\333\315\235\0\333\315\236"
"\0\333\315\236\0\330\311\236\0\326\305\236\0\322\300\233\0\325\302\237\0"
"\333\310\245\0\334\307\245\0\350\305\257\0\344\263\252\377\327\225\230\377"
"\334\211\231\377\337\207\230\377\343\206\230\377\336\207\227\377\332\211"
"\227\377\315\215\216\377\342\263\250\377\350\306\261\0\333\306\250\0\332"
"\310\251\0\331\310\251\0\337\306\255\0\346\304\261\0\347\260\250\377\331"
"\216\221\377\322~\210\377\333|\217\377\332|\221\377\332|\223\377\322~\212"
"\377\315\203\205\377\344\252\236\377\351\300\244\0\336\276\231\0\332\302"
"\224\0\335\301\222\0\345\305\224\0\364\304\225\0\370\267\211\377\357\236"
"r\377\372\232o\377\375\230m\377\377\227l\377\377\226j\377\377\226i\377\377"
"\227j\377\376\226i\377\376\226h\377\376\226g\377\376\226g\377\374\225f\377"
"\374\225e\377\374\225d\377\374\224c\377\375\224c\377\375\224b\377\375\224"
"a\377\375\224a\377\375\224a\377\375\224a\377\375\224a\377\377\225a\377\377"
"\225`\377\377\225a\377\377\225b\377\375\225d\377\373\225f\377\360\232i\377"
"\356\250u\377\366\301\216\0\352\307\225\0\346\311\227\0\337\312\227\0\334"
"\311\226\0\332\311\227\0\334\314\232\0\333\316\235\0\333\316\235\0\333\316"
"\234\0\333\314\236\0\330\310\235\0\327\305\233\0\331\306\235\0\333\307\237"
"\0\335\310\241\0\347\304\251\0\344\263\244\377\321\221\216\377\323\202\213"
"\377\333\206\217\377\337\204\217\377\333\206\216\377\327\207\214\377\310"
"\211\203\377\342\264\242\377\347\306\252\0\335\311\244\0\334\311\244\0\333"
"\312\244\0\340\310\250\0\346\306\253\0\347\263\243\377\327\217\213\377\322"
"\201\205\377\336\203\217\377\333\201\216\377\333\201\220\377\325\203\211"
"\377\320\207\204\377\340\247\225\377\354\303\242\0\342\304\232\0\330\304"
"\223\0\332\305\223\0\337\310\227\0\353\305\225\0\364\276\217\0\346\241t\377"
"\361\234r\377\362\232o\377\365\232n\377\364\231l\377\364\231l\377\364\232"
"m\377\362\231l\377\362\231k\377\362\231i\377\362\231i\377\362\231i\377\362"
"\231h\377\362\232g\377\362\230f\377\363\230f\377\363\230e\377\363\230d\377"
"\363\230d\377\363\230d\377\363\230d\377\363\230d\377\364\230c\377\365\230"
"b\377\365\230c\377\365\230d\377\362\230f\377\360\230h\377\344\234k\377\343"
"\252x\0\354\303\221\0\342\311\226\0\340\313\231\0\334\314\232\0\334\314\232"
"\0\334\314\232\0\334\314\232\0\333\315\236\0\333\315\235\0\333\316\234\0"
"\333\314\235\0\335\315\237\0\335\313\237\0\333\311\235\0\326\304\231\0\332"
"\311\240\0\337\305\245\0\335\272\244\377\336\260\245\377\342\252\251\377"
"\347\252\251\377\343\242\240\377\335\237\233\377\335\241\232\377\325\246"
"\226\377\340\275\244\377\340\306\247\0\336\314\245\0\334\313\244\0\334\313"
"\244\0\335\311\246\0\340\310\250\0\341\274\245\377\336\254\235\377\334\243"
"\232\377\335\236\232\377\334\235\232\377\345\246\245\377\337\244\236\377"
"\337\247\234\377\354\277\251\377\350\306\244\0\340\306\234\0\331\307\226"
"\0\330\306\224\0\332\310\226\0\341\305\223\0\355\306\225\0\344\262\203\0"
"\354\260\203\0\355\257\202\0\356\256\177\0\356\256\177\0\356\256\177\0\355"
"\256\177\0\354\256\177\0\354\256~\0\354\256}\0\354\256}\0\354\256}\0\354"
"\257|\0\354\257{\0\355\256{\0\356\256{\0\356\256z\0\356\256y\0\355\255w\0"
"\355\255w\0\355\255w\0\353\254v\0\354\254u\0\355\254t\0\354\252t\0\347\246"
"p\0\345\245q\0\344\245s\0\335\250x\0\343\270\210\0\342\301\220\0\340\311"
"\227\0\336\313\232\0\334\314\233\0\335\315\234\0\335\315\234\0\334\314\233"
"\0\332\314\237\0\333\315\237\0\333\315\236\0\334\315\236\0\336\316\240\0"
"\340\317\241\0\336\313\235\0\324\303\227\0\322\303\231\0\327\303\240\0\343"
"\313\257\0\370\331\306\377\376\330\315\377\377\327\311\377\366\314\273\377"
"\352\301\256\377\350\300\254\377\336\275\244\377\337\305\247\0\337\312\247"
"\0\335\314\244\0\336\316\245\0\333\313\243\0\333\312\243\0\334\311\245\0"
"\341\307\251\0\345\304\253\377\347\302\254\377\351\301\257\377\363\312\272"
"\377\375\324\305\377\372\323\301\377\377\331\305\377\354\313\257\0\342\306"
"\241\0\341\312\237\0\331\307\226\0\322\301\217\0\324\304\221\0\332\304\221"
"\0\341\305\223\0\345\302\222\0\351\277\220\0\355\303\223\0\351\276\216\0"
"\355\303\223\0\355\303\223\0\355\303\223\0\350\300\217\0\355\304\223\0\354"
"\303\221\0\354\303\221\0\354\303\221\0\354\303\221\0\354\303\220\0\355\303"
"\217\0\355\303\217\0\355\303\216\0\355\303\216\0\357\304\217\0\357\304\217"
"\0\357\304\217\0\357\304\217\0\357\304\216\0\351\275\206\0\366\312\224\0"
"\357\303\216\0\352\276\213\0\343\270\207\0\335\267\207\0\344\304\224\0\343"
"\311\230\0\336\312\230\0\335\312\231\0\336\313\233\0\336\313\233\0\336\313"
"\233\0\335\314\233\0\332\314\244\0\333\315\243\0\333\315\241\0\333\314\237"
"\0\334\313\237\0\334\312\235\0\332\310\232\0\327\305\231\0\326\306\232\0"
"\326\305\237\0\343\321\260\0\370\343\307\377\375\344\316\377\374\343\307"
"\377\360\330\266\0\342\312\252\0\337\310\250\0\336\310\247\0\336\312\247"
"\0\334\313\245\0\334\315\243\0\335\316\244\0\333\314\242\0\333\313\243\0"
"\332\312\242\0\334\311\244\0\341\314\251\0\342\314\253\0\337\310\251\0\355"
"\326\271\0\371\341\306\377\371\343\306\377\375\350\311\377\347\322\255\0"
"\334\307\232\0\334\307\230\0\332\306\225\0\331\307\225\0\325\305\222\0\330"
"\306\223\0\333\305\223\0\340\306\225\0\342\304\224\0\342\306\226\0\343\307"
"\227\0\344\310\230\0\344\310\230\0\343\310\230\0\343\312\232\0\342\311\230"
"\0\342\311\230\0\342\311\230\0\342\311\230\0\342\311\230\0\342\311\227\0"
"\344\312\230\0\345\311\227\0\345\312\227\0\346\313\230\0\345\312\226\0\346"
"\313\230\0\351\315\232\0\346\313\230\0\344\307\223\0\337\301\214\0\350\312"
"\227\0\342\304\222\0\341\303\222\0\335\300\220\0\334\301\221\0\333\305\223"
"\0\334\307\226\0\335\312\231\0\335\310\231\0\341\312\233\0\340\311\232\0"
"\341\312\233\0\337\313\233\0\333\315\245\0\333\315\243\0\333\315\242\0\333"
"\314\240\0\324\303\227\0\323\302\225\0\326\303\225\0\330\307\231\0\331\311"
"\235\0\325\306\234\0\333\314\247\0\354\334\271\377\364\343\302\377\366\346"
"\300\377\354\335\262\0\340\321\250\0\337\320\250\0\336\317\247\0\335\314"
"\245\0\334\315\243\0\333\315\242\0\333\315\242\0\333\315\242\0\332\314\241"
"\0\332\314\240\0\331\313\240\0\330\311\240\0\330\311\240\0\332\314\244\0"
"\342\323\255\0\362\342\276\377\363\345\300\377\363\345\277\377\340\320\245"
"\0\332\310\230\0\325\302\221\0\326\302\220\0\331\307\225\0\332\312\227\0"
"\332\310\226\0\327\304\223\0\333\306\225\0\334\306\224\0\335\310\230\0\336"
"\312\232\0\337\313\233\0\337\313\234\0\336\313\234\0\335\313\234\0\335\313"
"\233\0\336\313\233\0\336\313\233\0\336\313\233\0\336\313\233\0\336\313\233"
"\0\337\314\234\0\340\314\233\0\340\314\233\0\340\314\233\0\337\313\232\0"
"\337\313\232\0\336\312\231\0\332\306\225\0\326\302\217\0\331\304\221\0\326"
"\300\216\0\332\304\222\0\334\306\225\0\335\307\230\0\334\307\227\0\327\304"
"\223\0\325\302\221\0\333\311\231\0\334\307\227\0\342\312\233\0\341\311\231"
"\0\343\313\234\0\340\314\234\0",
};
|
the_stack_data/122198.c
|
int main()
{
int n1 , res ;
printf("Digite n1 :\n");
scanf("%d",&n1);
res=n1%2;
if(res==1)
{
printf("O numero e impar \n");
}
else
{
printf("O numero e par \n");
}
return 0;
}
|
the_stack_data/106805.c
|
/*
* libc/gen/raise.c
* raise()
* POSIX function.
*/
#include <signal.h>
#include <unistd.h>
#ifdef USE_PROTO
int raise (int sig)
#else
int
raise(sig)
int sig;
#endif
{
return kill(getpid(), sig);
}
/* end of libc/gen/raise.c */
|
the_stack_data/31388808.c
|
#include<stdio.h>
int right_rotation(int a[], int n);
int main()
{
int n, k, q, a[100001], m, i, b[100001];
//printf("ENTER NUMBER OF ELEMENTS IN THE ARRAY: ");
scanf("%d", &n);
//printf("ENTER NUMBER OF ROTATION COUNT: ");
scanf("%d", &k);
//printf("ENTER NUMBER OF QUERIES: ");
scanf("%d", &q);
//printf("ENTER ARRAY ELEMENTS: ");
for(i=0; i<n; i++){
scanf("%d", &a[i]);
b[i] = a[i];
}
//printf("\nWITH ROTATION OF THE ARRAY: \n");
for(i=0; i<k; i++)
right_rotation(a, n);
//printf("ENTER YOUR QUERIES: \n");
for(i=0; i<q; i++){
scanf("%d", &m);
printf("%d ", a[m]);
}
printf("\n\n");
//printf("WITHOUT ROTATION OF THE ARRAY: \n");
int s;
s = n -(k%n);
for(i=0; i<q; i++){
scanf("%d", &m);
printf("%d ", b[(s+m)%n]);
}
return 0;
}
int right_rotation(int a[], int n)
{
int temp, j;
temp = a[n-1];
for(j=n-1; j>=1; j--){
a[j] = a[j-1];
}
a[0] = temp;
return 0;
}
|
the_stack_data/148689.c
|
#include <stdio.h>
#define MAX_TAILLE 5
// int affiche_taille();
// gcc -Wall -O2 v1.c -o v1.exe
int main() {
int array[MAX_TAILLE] = {3, 9, 7, 1, 9};
for(int i = 0; i < (sizeof(array) / sizeof(array[0])); i++) {
printf("%d \n", array[i]);
}
return 0;
}
|
the_stack_data/14199975.c
|
/**
* Copyright (C) Mellanox Technologies Ltd. 2019. ALL RIGHTS RESERVED.
*
* See file LICENSE for terms.
*/
#if defined(__x86_64__)
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#include <ucs/arch/global_opts.h>
#include <ucs/config/parser.h>
ucs_config_field_t ucs_arch_global_opts_table[] = {
#if ENABLE_BUILTIN_MEMCPY
{"BUILTIN_MEMCPY_MIN", "auto",
"Minimal threshold of buffer length for using built-in memcpy.",
ucs_offsetof(ucs_arch_global_opts_t, builtin_memcpy_min), UCS_CONFIG_TYPE_MEMUNITS},
{"BUILTIN_MEMCPY_MAX", "auto",
"Maximal threshold of buffer length for using built-in memcpy.",
ucs_offsetof(ucs_arch_global_opts_t, builtin_memcpy_max), UCS_CONFIG_TYPE_MEMUNITS},
#endif
{NULL}
};
void ucs_arch_print_memcpy_limits(ucs_arch_global_opts_t *config)
{
#if ENABLE_BUILTIN_MEMCPY
char min_thresh_str[32];
char max_thresh_str[32];
ucs_config_sprintf_memunits(min_thresh_str, sizeof(min_thresh_str),
&config->builtin_memcpy_min, NULL);
ucs_config_sprintf_memunits(max_thresh_str, sizeof(max_thresh_str),
&config->builtin_memcpy_max, NULL);
printf("# Using built-in memcpy() for size %s..%s\n", min_thresh_str, max_thresh_str);
#endif
}
#endif
|
the_stack_data/40338.c
|
/*@ begin PerfTuning (
def build
{
arg build_command = 'gcc -O3 -fopenmp ';
arg libs = '-lm -lrt';
}
def performance_counter
{
arg repetitions = 10;
}
def performance_params
{
param T2_I[] = [1,16,32,64,128,256,512];
param T2_J[] = [1,16,32,64,128,256,512];
param T2_Ia[] = [1,64,128,256,512,1024,2048];
param T2_Ja[] = [1,64,128,256,512,1024,2048];
param U2_I[] = [1]+range(2,17,2);
param U2_J[] = [1]+range(2,17,2);
param SCR1[] = [False,True];
param SCR2[] = [False,True];
param VEC2[] = [False,True];
param OMP1[] = [False,True];
param OMP2[] = [False,True];
param U1_K[] = [1]+range(2,17,2);
param U1_J[] = [1]+range(2,17,2);
param VEC1[] = [False,True];
constraint tileI2 = ((T2_Ia == 1) or (T2_Ia % T2_I == 0));
constraint tileJ2 = ((T2_Ja == 1) or (T2_Ja % T2_J == 0));
constraint unroll_limit = ((U2_I == 1) or (U2_J == 1));
}
def search
{
arg algorithm = 'Randomlocal';
arg total_runs = 1000;
}
def input_params
{
param N[] = [500];
}
def input_vars
{
arg decl_file = 'decl_code.h';
arg init_file = 'init_code.c';
}
) @*/
int i,j, k,t;
int it, jt, kt;
int ii, jj, kk;
int iii, jjj, kkk;
#define max(x,y) ((x) > (y)? (x) : (y))
#define min(x,y) ((x) < (y)? (x) : (y))
/*@ begin Loop (
transform Composite(
unrolljam = (['k','j'],[U1_K,U1_J]),
scalarreplace = (SCR1, 'double'),
vector = (VEC1, ['ivdep','vector always']),
openmp = (OMP1, 'omp parallel for private(k,j)')
)
for (k=0; k<=N-1; k++) {
for (j=k+1; j<=N-1; j++)
A[k][j] = A[k][j]/A[k][k];
transform Composite(
tile = [('i',T2_I,'ii'),('j',T2_J,'jj'),
(('ii','i'),T2_Ia,'iii'),(('jj','j'),T2_Ja,'jjj')],
unrolljam = (['i','j'],[U2_I,U2_J]),
scalarreplace = (SCR2, 'double'),
vector = (VEC2, ['ivdep','vector always']),
openmp = (OMP2, 'omp parallel for private(iii,jjj,ii,jj,i,j)')
)
for(i=k+1; i<=N-1; i++)
for (j=k+1; j<=N-1; j++)
A[i][j] = A[i][j] - A[i][k]*A[k][j];
}
) @*/
/*@ end @*/
/*@ end @*/
|
the_stack_data/165765553.c
|
// C11 standard
// created by cicek on Oct 17, 2020 11:21 AM
#include <stdio.h>
#include <stdlib.h>
// http://www.cplusplus.com/reference/cstdio/printf/
void bir_boyutlu_dizi_olustur(int **fun_dizi, int eleman_sayisi) {
*fun_dizi = (int *) malloc(sizeof(int) * eleman_sayisi);
for (int i = 0; i < eleman_sayisi; ++i) {
*(*fun_dizi + i) = rand() % 100;
}
}
// 1 boyutlu array dinamik
int main() {
int *dizi;
int eleman_sayisi = 6;
// sizeof(int) -> C'de int her zaman 4byte değildir.
dizi = (int *) malloc(sizeof(int) * eleman_sayisi);
for (int i = 0; i < eleman_sayisi; ++i) {
*(dizi + i) = rand() % 100;
}
for (int x = 0; x < eleman_sayisi; ++x) {
printf("%d: %d\n", x, dizi[x]);
}
/* 0: 83
1: 86
2: 77
3: 15
4: 93
5: 35 */
// fonksiyon içerisinde
int *fun_dizi;
int fun_eleman_sayisi = 5;
bir_boyutlu_dizi_olustur(&fun_dizi, fun_eleman_sayisi);
printf("fun dizi:\n");
for (int x = 0; x < fun_eleman_sayisi; ++x) {
printf("%d: %d\n", x, fun_dizi[x]);
}
/* fun dizi:
0: 86
1: 92
2: 49
3: 21
4: 62 */
return 0;
}
|
the_stack_data/1070829.c
|
#include <stdio.h>
int getLength(char* str) {
int length = 0;
char* pos = str;
while (*pos) {
//Every string in C is stored as an array of char's. e.g. "Hello" is stored as {'H', 'E', 'L', 'L', 'O', '\0'}.
//Something to take away is that the pointer (in our case, it will be *pos) towards '\0' will be evaluated as zero.
pos++;
length++;
}
return length;
}
int main(int argc, char* argv[]){
if(argc !=3){
printf("Wrong number of arguments. Please input: ./reverse WORD1 WORD2\n");
return 1;
} else {
int length1 = getLength(argv[1]);
int length2 = getLength(argv[2]);
int numberOfMatchingCharacters = 0;
char word1[1024];
char word2[1024];
char word2flipped[1024];
for(int l1 = 0; l1 <length1+1; l1++){
word1[l1] = argv[1][l1];
}
for(int l2 = 0; l2< length2+1; l2++){
word2[l2] = argv[2][l2];
}
for(int i = 0; i<length2; i++){
word2flipped[i] = word2[length2-1-i];
}
word2flipped[length2] = '\0';
if(length1 != length2){
printf("WORD1=%s WORD2=%s - NOT REVERSE", word1, word2);
return 0;
} else {
for(int j=0; j<length1; j++){
if(word1[j]==word2flipped[j]){
numberOfMatchingCharacters++;
}
}
if(numberOfMatchingCharacters==length1){
printf("WORD1=%s WORD2=%s - REVERSE", word1, word2);
return 0;
} else {
printf("WORD=%s WORD2=%s - NOT REVERSE", word1, word2);
return 0;
}
}
}
}
|
the_stack_data/149501.c
|
/* Multi-thread searching.
Illustrates: thread cancellation, cleanup handlers. */
#include <errno.h>
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <sys/types.h>
#include <pthread.h>
/* Defines the number of searching threads */
#define NUM_THREADS 5
/* Function prototypes */
void *search(void *);
void print_it(void *);
/* Global variables */
pthread_t threads[NUM_THREADS];
pthread_mutex_t lock;
int tries;
volatile int started;
int main(int argc, char ** argv)
{
unsigned long i;
unsigned long pid;
/* create a number to search for */
pid = getpid();
printf("Searching for the number = %ld...\n", pid);
/* Initialize the mutex lock */
pthread_mutex_init(&lock, NULL);
/* Create the searching threads */
for (started=0; started<NUM_THREADS; started++)
pthread_create(&threads[started], NULL, search, (void *)pid);
/* Wait for (join) all the searching threads */
for (i=0; i<NUM_THREADS; i++)
pthread_join(threads[i], NULL);
printf("It took %d tries to find the number.\n", tries);
/* Exit the program */
return 0;
}
/* This is the cleanup function that is called
when the threads are cancelled */
void print_it(void *arg)
{
int *try = (int *) arg;
pthread_t tid;
/* Get the calling thread's ID */
tid = pthread_self();
/* Print where the thread was in its search when it was cancelled */
printf("Thread %lx was canceled on its %d try.\n", tid, *try);
}
/* This is the search routine that is executed in each thread */
void *search(void *arg)
{
unsigned long num = (unsigned long) arg;
unsigned long i, j, ntries;
pthread_t tid;
/* get the calling thread ID */
tid = pthread_self();
/* use the thread ID to set the seed for the random number generator */
/* Since srand and rand are not thread-safe, serialize with lock */
/* Try to lock the mutex lock --
if locked, check to see if the thread has been cancelled
if not locked then continue */
while (pthread_mutex_trylock(&lock) == EBUSY)
pthread_testcancel();
srand((int)tid);
i = rand() & 0xFFFFFF;
pthread_mutex_unlock(&lock);
ntries = 0;
/* Set the cancellation parameters --
- Enable thread cancellation
- Defer the action of the cancellation */
pthread_setcancelstate(PTHREAD_CANCEL_ENABLE, NULL);
pthread_setcanceltype(PTHREAD_CANCEL_DEFERRED, NULL);
while (started < NUM_THREADS)
sched_yield ();
/* Push the cleanup routine (print_it) onto the thread
cleanup stack. This routine will be called when the
thread is cancelled. Also note that the pthread_cleanup_push
call must have a matching pthread_cleanup_pop call. The
push and pop calls MUST be at the same lexical level
within the code */
/* Pass address of `ntries' since the current value of `ntries' is not
the one we want to use in the cleanup function */
pthread_cleanup_push(print_it, (void *)&ntries);
/* Loop forever */
while (1) {
i = (i + 1) & 0xFFFFFF;
ntries++;
/* Does the random number match the target number? */
if (num == i) {
/* Try to lock the mutex lock --
if locked, check to see if the thread has been cancelled
if not locked then continue */
while (pthread_mutex_trylock(&lock) == EBUSY)
pthread_testcancel();
/* Set the global variable for the number of tries */
tries = ntries;
printf("Thread %lx found the number!\n", tid);
/* Cancel all the other threads */
for (j=0; j<NUM_THREADS; j++)
if (threads[j] != tid) pthread_cancel(threads[j]);
/* Break out of the while loop */
break;
}
/* Every 100 tries check to see if the thread has been cancelled. */
if (ntries % 100 == 0) {
pthread_testcancel();
}
}
/* The only way we can get here is when the thread breaks out
of the while loop. In this case the thread that makes it here
has found the number we are looking for and does not need to run
the thread cleanup function. This is why the pthread_cleanup_pop
function is called with a 0 argument; this will pop the cleanup
function off the stack without executing it */
pthread_cleanup_pop(0);
return((void *)0);
}
|
the_stack_data/111077077.c
|
#include<stdio.h>
#include<stdlib.h>
#define max 100
int pilha[max];
int topo;
void constroir(){
topo = -1;
}
int pilha_vazia(){
if (topo==-1){
printf("pilha vazia\n");
return 0;
}else{
return 1;
}
}
int pilha_cheia(){
if (topo==max-1){
printf("pilha cheia\n");
return 0;
}else{
return 1;
}
}
void empilhar(int valor){
if(pilha_cheia() == 1){
topo++;
pilha[topo]= valor;
printf("valor inserido: %d \n",pilha[topo]);
}
}
int desempilhar(int *valor){
if (pilha_vazia() == 1){
*valor= pilha[topo];
topo--;
printf("valor retirado: %d\n",*valor);
}
}
int main(){
int valor;
constroir();
empilhar(12);
empilhar(13);
empilhar(12);
empilhar(11);
empilhar(10);
desempilhar(&valor);
desempilhar(&valor);
desempilhar(&valor);
desempilhar(&valor);
desempilhar(&valor);
desempilhar(&valor);
desempilhar(&valor);
desempilhar(&valor);
return 0;
}
|
the_stack_data/309753.c
|
#ifdef COMPILE_FOR_TEST
#include <assert.h>
#define assume(cond) assert(cond)
#endif
void main(int argc, char* argv[]) {
int x_0_0;//sh_buf.outcnt
int x_0_1;//sh_buf.outcnt
int x_0_2;//sh_buf.outcnt
int x_0_3;//sh_buf.outcnt
int x_0_4;//sh_buf.outcnt
int x_0_5;//sh_buf.outcnt
int x_1_0;//sh_buf.outbuf[0]
int x_1_1;//sh_buf.outbuf[0]
int x_2_0;//sh_buf.outbuf[1]
int x_2_1;//sh_buf.outbuf[1]
int x_3_0;//sh_buf.outbuf[2]
int x_3_1;//sh_buf.outbuf[2]
int x_4_0;//sh_buf.outbuf[3]
int x_4_1;//sh_buf.outbuf[3]
int x_5_0;//sh_buf.outbuf[4]
int x_5_1;//sh_buf.outbuf[4]
int x_6_0;//sh_buf.outbuf[5]
int x_7_0;//sh_buf.outbuf[6]
int x_8_0;//sh_buf.outbuf[7]
int x_9_0;//sh_buf.outbuf[8]
int x_10_0;//sh_buf.outbuf[9]
int x_11_0;//LOG_BUFSIZE
int x_11_1;//LOG_BUFSIZE
int x_12_0;//CREST_scheduler::lock_0
int x_12_1;//CREST_scheduler::lock_0
int x_12_2;//CREST_scheduler::lock_0
int x_12_3;//CREST_scheduler::lock_0
int x_12_4;//CREST_scheduler::lock_0
int x_13_0;//t3 T0
int x_14_0;//t2 T0
int x_15_0;//arg T0
int x_16_0;//functioncall::param T0
int x_16_1;//functioncall::param T0
int x_17_0;//buffered T0
int x_18_0;//functioncall::param T0
int x_18_1;//functioncall::param T0
int x_19_0;//functioncall::param T0
int x_19_1;//functioncall::param T0
int x_20_0;//functioncall::param T0
int x_20_1;//functioncall::param T0
int x_20_2;//functioncall::param T0
int x_20_3;//functioncall::param T0
int x_21_0;//functioncall::param T0
int x_21_1;//functioncall::param T0
int x_22_0;//direction T0
int x_23_0;//functioncall::param T0
int x_23_1;//functioncall::param T0
int x_24_0;//functioncall::param T0
int x_24_1;//functioncall::param T0
int x_25_0;//functioncall::param T0
int x_25_1;//functioncall::param T0
int x_26_0;//functioncall::param T0
int x_26_1;//functioncall::param T0
int x_27_0;//functioncall::param T0
int x_27_1;//functioncall::param T0
int x_28_0;//functioncall::param T0
int x_28_1;//functioncall::param T0
int x_29_0;//functioncall::param T0
int x_29_1;//functioncall::param T0
int x_30_0;//functioncall::param T0
int x_30_1;//functioncall::param T0
int x_31_0;//functioncall::param T0
int x_31_1;//functioncall::param T0
int x_32_0;//functioncall::param T0
int x_32_1;//functioncall::param T0
int x_33_0;//functioncall::param T0
int x_33_1;//functioncall::param T0
int x_34_0;//functioncall::param T0
int x_34_1;//functioncall::param T0
int x_35_0;//functioncall::param T1
int x_35_1;//functioncall::param T1
int x_36_0;//functioncall::param T1
int x_36_1;//functioncall::param T1
int x_37_0;//i T1
int x_37_1;//i T1
int x_37_2;//i T1
int x_38_0;//rv T1
int x_39_0;//rv T1
int x_40_0;//blocksize T1
int x_40_1;//blocksize T1
int x_41_0;//functioncall::param T1
int x_41_1;//functioncall::param T1
int x_41_2;//functioncall::param T1
int x_42_0;//apr_thread_mutex_lock::rv T1
int x_42_1;//apr_thread_mutex_lock::rv T1
int x_43_0;//functioncall::param T1
int x_43_1;//functioncall::param T1
int x_44_0;//status T1
int x_44_1;//status T1
int x_45_0;//functioncall::param T1
int x_45_1;//functioncall::param T1
int x_46_0;//functioncall::param T1
int x_46_1;//functioncall::param T1
int x_47_0;//functioncall::param T1
int x_47_1;//functioncall::param T1
int x_48_0;//functioncall::param T1
int x_48_1;//functioncall::param T1
int x_49_0;//functioncall::param T1
int x_49_1;//functioncall::param T1
int x_50_0;//functioncall::param T1
int x_50_1;//functioncall::param T1
int x_51_0;//functioncall::param T2
int x_51_1;//functioncall::param T2
int x_52_0;//functioncall::param T2
int x_52_1;//functioncall::param T2
int x_53_0;//i T2
int x_53_1;//i T2
int x_53_2;//i T2
int x_53_3;//i T2
int x_54_0;//rv T2
int x_55_0;//rv T2
int x_56_0;//blocksize T2
int x_56_1;//blocksize T2
int x_57_0;//functioncall::param T2
int x_57_1;//functioncall::param T2
int x_57_2;//functioncall::param T2
int x_58_0;//apr_thread_mutex_lock::rv T2
int x_58_1;//apr_thread_mutex_lock::rv T2
int x_59_0;//functioncall::param T2
int x_59_1;//functioncall::param T2
int x_60_0;//status T2
int x_60_1;//status T2
int x_61_0;//functioncall::param T2
int x_61_1;//functioncall::param T2
int x_62_0;//functioncall::param T2
int x_62_1;//functioncall::param T2
int x_63_0;//functioncall::param T2
int x_63_1;//functioncall::param T2
int x_64_0;//functioncall::param T2
int x_64_1;//functioncall::param T2
int x_65_0;//functioncall::param T2
int x_65_1;//functioncall::param T2
int x_65_2;//functioncall::param T2
int x_66_0;//functioncall::param T2
int x_66_1;//functioncall::param T2
int x_67_0;//functioncall::param T2
int x_67_1;//functioncall::param T2
int x_68_0;//functioncall::param T2
int x_68_1;//functioncall::param T2
T_0_0_0: x_0_0 = 0;
T_0_1_0: x_1_0 = 0;
T_0_2_0: x_2_0 = 0;
T_0_3_0: x_3_0 = 0;
T_0_4_0: x_4_0 = 0;
T_0_5_0: x_5_0 = 0;
T_0_6_0: x_6_0 = 0;
T_0_7_0: x_7_0 = 0;
T_0_8_0: x_8_0 = 0;
T_0_9_0: x_9_0 = 0;
T_0_10_0: x_10_0 = 0;
T_0_11_0: x_11_0 = 0;
T_0_12_0: x_13_0 = 37039856;
T_0_13_0: x_14_0 = 3726762592;
T_0_14_0: x_15_0 = 0;
T_0_15_0: x_16_0 = 1020629563;
T_0_16_0: x_16_1 = -1;
T_0_17_0: x_17_0 = 0;
T_0_18_0: x_18_0 = 1006034084;
T_0_19_0: x_18_1 = x_17_0;
T_0_20_0: x_19_0 = 1999221188;
T_0_21_0: x_19_1 = 97;
T_0_22_0: x_20_0 = 1497177492;
T_0_23_0: x_20_1 = 0;
T_0_24_0: x_21_0 = 1416233394;
T_0_25_0: x_21_1 = 0;
T_0_26_0: x_22_0 = -568209344;
T_0_27_0: x_23_0 = 89396061;
T_0_28_0: x_23_1 = x_22_0;
T_0_29_0: x_24_0 = 576477384;
T_0_30_0: x_24_1 = 0;
T_0_31_0: x_12_0 = -1;
T_0_32_0: x_0_1 = 5;
T_0_33_0: x_1_1 = 72;
T_0_34_0: x_2_1 = 69;
T_0_35_0: x_3_1 = 76;
T_0_36_0: x_4_1 = 76;
T_0_37_0: x_5_1 = 79;
T_0_38_0: x_25_0 = 446760853;
T_0_39_0: x_25_1 = 83;
T_0_40_0: x_26_0 = 1601487399;
T_0_41_0: x_26_1 = 1;
T_0_42_0: x_27_0 = 1847509048;
T_0_43_0: x_27_1 = 1;
T_0_44_0: x_28_0 = 2117579748;
T_0_45_0: x_28_1 = 1;
T_0_46_0: x_29_0 = 133459976;
T_0_47_0: x_29_1 = 82;
T_0_48_0: x_30_0 = 1239572466;
T_0_49_0: x_30_1 = 90;
T_0_50_0: x_31_0 = 1100452369;
T_0_51_0: x_31_1 = 1;
T_0_52_0: x_32_0 = 631772893;
T_0_53_0: x_32_1 = 1;
T_0_54_0: x_33_0 = 1401517582;
T_0_55_0: x_33_1 = 2;
T_0_56_0: x_34_0 = 2074949251;
T_0_57_0: x_34_1 = 2;
T_0_58_0: x_11_1 = 5;
T_1_59_1: x_35_0 = 200850048;
T_1_60_1: x_35_1 = x_27_1;
T_1_61_1: x_36_0 = 1052311651;
T_1_62_1: x_36_1 = x_28_1;
T_1_63_1: x_37_0 = 0;
T_1_64_1: x_38_0 = 519647745;
T_2_65_2: x_51_0 = 1186436776;
T_2_66_2: x_51_1 = x_33_1;
T_2_67_2: x_52_0 = 842002895;
T_2_68_2: x_52_1 = x_34_1;
T_2_69_2: x_53_0 = 0;
T_2_70_2: x_54_0 = 517546497;
T_1_71_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0) x_39_0 = -561141840;
T_1_72_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0) x_40_0 = 11174;
T_2_73_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0) x_55_0 = -561141840;
T_2_74_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0) x_56_0 = 11174;
T_2_75_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0) x_57_0 = 866693083;
T_2_76_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0) x_57_1 = x_0_1;
T_2_77_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_0_1 == x_57_1) x_58_0 = 0;
T_2_78_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_0_1 == x_57_1 && 0 == x_12_0 + 1) x_12_1 = 2;
T_2_79_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_0_1 == x_57_1 && 2 == x_12_1) x_58_1 = 0;
T_2_80_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 2 == x_12_1) x_59_0 = 1770559939;
T_2_81_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 2 == x_12_1) x_59_1 = 0;
T_2_82_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 0 == x_59_1 && 2 == x_12_1) x_56_1 = x_57_1;
T_2_83_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 0 == x_59_1 && 2 == x_12_1) x_20_2 = x_20_1 + x_56_1;
T_2_84_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 0 == x_59_1 && 2 == x_12_1) x_57_2 = -1*x_56_1 + x_57_1;
T_2_85_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_57_2 <= 0 && 2 == x_12_1) x_60_0 = 0;
T_2_86_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_57_2 <= 0 && 2 == x_12_1) x_12_2 = -1;
T_2_87_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0) x_41_0 = 1366810604;
T_2_88_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0) x_41_1 = x_0_1;
T_2_89_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_0_1 == x_41_1) x_42_0 = 0;
T_2_90_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_57_2 <= 0) x_60_1 = 0;
T_1_91_1: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0) x_61_0 = 1333151044;
T_1_92_1: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0) x_61_1 = x_59_1;
T_1_93_1: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0) x_62_0 = 90688164;
T_1_94_1: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0) x_62_1 = x_61_1;
T_2_95_2: if (x_0_1 + x_52_1 > x_11_1 && x_0_1 != 0) x_0_2 = 0;
T_2_96_2: if (x_52_1 < x_11_1) x_63_0 = 2093212249;
T_2_97_2: if (x_52_1 < x_11_1) x_63_1 = 47995741988608;
T_2_98_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_0_1 == x_41_1 && 0 == x_12_2 + 1) x_12_3 = 1;
T_2_99_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_0_1 == x_41_1 && 1 == x_12_3) x_42_1 = 0;
T_2_100_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 1 == x_12_3) x_43_0 = 2113683857;
T_2_101_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 1 == x_12_3) x_43_1 = 0;
T_1_102_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 0 == x_43_1 && 1 == x_12_3) x_40_1 = x_41_1;
T_1_103_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 0 == x_43_1 && 1 == x_12_3) x_20_3 = x_20_2 + x_40_1;
T_1_104_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 0 == x_43_1 && 1 == x_12_3) x_41_2 = -1*x_40_1 + x_41_1;
T_1_105_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_41_2 <= 0 && 1 == x_12_3) x_44_0 = 0;
T_1_106_1: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_41_2 <= 0 && 1 == x_12_3) x_12_4 = -1;
T_1_107_1: if (x_52_1 < x_11_1) x_64_0 = 974093007;
T_1_108_1: if (x_52_1 < x_11_1) x_64_1 = x_0_2 + x_52_1;
T_1_109_1: if (x_52_1 < x_11_1) x_53_1 = 0;
T_1_110_1: if (x_52_1 < x_11_1 && x_53_1 < x_51_1) x_65_0 = 540894157;
T_1_111_1: if (x_52_1 < x_11_1 && x_53_1 < x_51_1) x_65_1 = 47995741988608;
T_2_112_2: if (x_52_1 < x_11_1) x_53_2 = 1 + x_53_1;
T_2_113_2: if (x_52_1 < x_11_1 && x_53_2 < x_51_1) x_65_2 = 47995741988608;
T_2_114_2: if (x_52_1 < x_11_1) x_53_3 = 1 + x_53_2;
T_2_115_2: if (x_52_1 < x_11_1) x_66_0 = 2005667721;
T_2_116_2: if (x_52_1 < x_11_1) x_66_1 = 47995741988608;
T_2_117_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_41_2 <= 0) x_44_1 = 0;
T_2_118_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0) x_45_0 = 1994722570;
T_2_119_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0) x_45_1 = x_43_1;
T_2_120_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0) x_46_0 = 1546928242;
T_2_121_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0) x_46_1 = x_45_1;
T_2_122_2: if (x_0_1 + x_36_1 > x_11_1 && x_0_1 != 0) x_0_3 = 0;
T_1_123_1: if (x_36_1 < x_11_1) x_47_0 = 1857405261;
T_1_124_1: if (x_36_1 < x_11_1) x_47_1 = 47995739887360;
T_1_125_1: if (x_36_1 < x_11_1) x_48_0 = 1344416415;
T_1_126_1: if (x_36_1 < x_11_1) x_48_1 = x_0_3 + x_36_1;
T_1_127_1: if (x_36_1 < x_11_1) x_37_1 = 0;
T_1_128_1: if (x_36_1 < x_11_1 && x_37_1 < x_35_1) x_49_0 = 815677988;
T_1_129_1: if (x_36_1 < x_11_1 && x_37_1 < x_35_1) x_49_1 = 47995739887360;
T_1_130_1: if (x_36_1 < x_11_1) x_37_2 = 1 + x_37_1;
T_1_131_1: if (x_36_1 < x_11_1) x_50_0 = 1946801323;
T_1_132_1: if (x_36_1 < x_11_1) x_50_1 = 47995739887360;
T_1_133_1: if (x_52_1 < x_11_1) x_0_4 = x_0_2 + x_52_1;
T_1_134_1: if (x_36_1 < x_11_1) x_0_5 = x_0_3 + x_36_1;
T_1_135_1: if (x_52_1 < x_11_1) x_67_0 = 1920893799;
T_1_136_1: if (x_52_1 < x_11_1) x_67_1 = 47995741988608;
T_1_137_1: if (x_52_1 < x_11_1) x_68_0 = 1262438841;
T_1_138_1: if (x_52_1 < x_11_1) x_68_1 = 47995741988608;
T_2_139_2: if (x_52_1 < x_11_1) assert(x_0_5 == x_64_1);
}
|
the_stack_data/87138.c
|
/* LL raised several warnings, ignore them */
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-parameter"
#ifdef STM32F0xx
#include "stm32f0xx_ll_usart.c"
#elif STM32F1xx
#include "stm32f1xx_ll_usart.c"
#elif STM32F2xx
#include "stm32f2xx_ll_usart.c"
#elif STM32F3xx
#include "stm32f3xx_ll_usart.c"
#elif STM32F4xx
#include "stm32f4xx_ll_usart.c"
#elif STM32F7xx
#include "stm32f7xx_ll_usart.c"
#elif STM32G0xx
#include "stm32g0xx_ll_usart.c"
#elif STM32G4xx
#include "stm32g4xx_ll_usart.c"
#elif STM32H7xx
#include "stm32h7xx_ll_usart.c"
#elif STM32L0xx
#include "stm32l0xx_ll_usart.c"
#elif STM32L1xx
#include "stm32l1xx_ll_usart.c"
#elif STM32L4xx
#include "stm32l4xx_ll_usart.c"
#elif STM32L5xx
#include "stm32l5xx_ll_usart.c"
#elif STM32MP1xx
#include "stm32mp1xx_ll_usart.c"
#elif STM32U5xx
#include "stm32u5xx_ll_usart.c"
#elif STM32WBxx
#include "stm32wbxx_ll_usart.c"
#elif STM32WLxx
#include "stm32wlxx_ll_usart.c"
#endif
#pragma GCC diagnostic pop
|
the_stack_data/76699975.c
|
/*
* This file will outline chapter concepts
*
* Serves for educational and testing purposes.
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
// Prints topic name
#define PRINT_TOPIC(...) \
printf("\n\n" #__VA_ARGS__ "\n==========\n")
// Allocate memory for string argument
static char *alloc_string(const char *str);
// Concantenate s1 and s2 and allocate memory for them.
static char *concat(const char *s1, const char *s2);
int main(void)
{
// String allocation
{
PRINT_TOPIC(String allocation);
char *s1 = alloc_string("Hello world!");
printf("s1: %s\n", s1);
char *s2 = concat("Hello", " world!");
printf("s2: %s\n", s2);
free(s1);
free(s2);
}
// Restricted Pointers
// I don't understand - no warnings for code below.
{
PRINT_TOPIC(Restricted Pointers);
int a = 5;
int * restrict p;
int * restrict q;
p = &a;
*p = 6;
q = p;
printf("*q = %d\n", *q);
*q = 7;
}
// Flexible array members
{
PRINT_TOPIC(Flexible array Members C99);
// Struct hack - before C99
struct vstring {
int n;
char str[4];
};
int strsize = 5;
const char *mystr = "abcd";
// Should allocate 9 bytes
struct vstring *vstr = malloc(sizeof *vstr - sizeof vstr->str + strsize);
printf("sizeof *vstr = %zu\n", sizeof *vstr - sizeof vstr->str + strsize);
vstr->n = strlen(mystr) + 1;
strcpy(vstr->str, mystr);
printf("vstr->str = %s\n", vstr->str);
free(vstr);
// C99 Flexible array members
// P.S. struct flexvstr - incomplete type
struct flexvstr {
int size;
char str[];
};
printf("\nsizeof (flexvstr) = %zu\n", sizeof (struct flexvstr));
struct flexvstr *fvstr = malloc(sizeof *vstr + strsize);
fvstr->size = strsize;
strcpy(fvstr->str, mystr);
free(fvstr);
// Only array of pointers is possible
struct flexvstr *fvstrarr[2] = {
malloc(sizeof **fvstrarr + sizeof "abcde"),
malloc(sizeof **fvstrarr + sizeof "fghij"),
};
free(fvstrarr[0]);
free(fvstrarr[1]);
}
return 0;
}
static char *alloc_string(const char *str)
{
char *p;
p = malloc(strlen(str) + 1);
if (!p)
printf("Allocation failed\n");
else
strcpy(p, str);
return p;
}
static char *concat(const char *s1, const char *s2)
{
char *p;
p = malloc(strlen(s1) + strlen(s2) + 1);
if (!p)
printf("Allocation failed!\n");
else
strcpy(p, s1), strcat(p, s2);
return p;
}
|
the_stack_data/9512604.c
|
#include <stdio.h>
#include <string.h>
#define SIZE 40
#define LIMIT 5
char * s_gets(char *, int);
int main(void)
{
char qwords[LIMIT][SIZE];
char temp[SIZE];
int i = 0;
printf("Enter %d words beginnig with q:\n", LIMIT);
while (i < LIMIT && s_gets(temp, SIZE))
{
if (temp[0] != 'q')
printf("%s doesn't begin with q!\n", temp);
else
{
strcpy(qwords[i], temp);
i++;
}
}
puts("Here are the words accepted:");
for (i =0; i < LIMIT;i++)
puts(qwords[i]);
return 0;
}
char * s_gets(char * string, int n)
{
char *ret_val;
int i = 0;
ret_val = fgets(string, SIZE, stdin);
if (ret_val)
{
while(string[i] != '\n' && string[i] != '\0')
i++;
if (string[i] == '\n')
string[i] = '\0';
else
while (getchar() != '\n')
continue;
}
return ret_val;
}
|
the_stack_data/768539.c
|
#include <stdio.h>
int main()
{
printf("Hello World\r\n");
return 0;
}
|
the_stack_data/32949938.c
|
#include<stdio.h>
main()
{
char ch[100],g;
int i;
printf("Enter the string\n");
gets(ch);
printf("Enter the character to enter \n");
g=getchar();
for(i=0;ch[i]!='\0';i++)
{ if(i%2==0)
ch[i]=g;
}
printf("New string is \n");
puts(ch);
}
|
the_stack_data/119949.c
|
/*
**********************************************************************
** md5.h -- Header file for implementation of MD5 **
** RSA Data Security, Inc. MD5 Message Digest Algorithm **
** Created: 2/17/90 RLR **
** Revised: 12/27/90 SRD,AJ,BSK,JT Reference C version **
** Revised (for MD5): RLR 4/27/91 **
** -- G modified to have y&~z instead of y&z **
** -- FF, GG, HH modified to add in last register done **
** -- Access pattern: round 2 works mod 5, round 3 works mod 3 **
** -- distinct additive constant for each step **
** -- round 4 added, working mod 7 **
**********************************************************************
*/
/*
**********************************************************************
** Copyright (C) 1990, RSA Data Security, Inc. All rights reserved. **
** **
** License to copy and use this software is granted provided that **
** it is identified as the "RSA Data Security, Inc. MD5 Message **
** Digest Algorithm" in all material mentioning or referencing this **
** software or this function. **
** **
** License is also granted to make and use derivative works **
** provided that such works are identified as "derived from the RSA **
** Data Security, Inc. MD5 Message Digest Algorithm" in all **
** material mentioning or referencing the derived work. **
** **
** RSA Data Security, Inc. makes no representations concerning **
** either the merchantability of this software or the suitability **
** of this software for any particular purpose. It is provided "as **
** is" without express or implied warranty of any kind. **
** **
** These notices must be retained in any copies of any part of this **
** documentation and/or software. **
**********************************************************************
*/
/* typedef a 32 bit type */
typedef unsigned long int UINT4;
/* Data structure for MD5 (Message Digest) computation */
typedef struct {
UINT4 i[2]; /* number of _bits_ handled mod 2^64 */
UINT4 buf[4]; /* scratch buffer */
unsigned char in[64]; /* input buffer */
unsigned char digest[16]; /* actual digest after MD5Final call */
} MD5_CTX;
void MD5Init ();
void MD5Update ();
void MD5Final ();
/*
**********************************************************************
** End of md5.h **
******************************* (cut) ********************************
*/
/*
**********************************************************************
** md5.c **
** RSA Data Security, Inc. MD5 Message Digest Algorithm **
** Created: 2/17/90 RLR **
** Revised: 1/91 SRD,AJ,BSK,JT Reference C Version **
**********************************************************************
*/
/*
**********************************************************************
** Copyright (C) 1990, RSA Data Security, Inc. All rights reserved. **
** **
** License to copy and use this software is granted provided that **
** it is identified as the "RSA Data Security, Inc. MD5 Message **
** Digest Algorithm" in all material mentioning or referencing this **
** software or this function. **
** **
** License is also granted to make and use derivative works **
** provided that such works are identified as "derived from the RSA **
** Data Security, Inc. MD5 Message Digest Algorithm" in all **
** material mentioning or referencing the derived work. **
** **
** RSA Data Security, Inc. makes no representations concerning **
** either the merchantability of this software or the suitability **
** of this software for any particular purpose. It is provided "as **
** is" without express or implied warranty of any kind. **
** **
** These notices must be retained in any copies of any part of this **
** documentation and/or software. **
**********************************************************************
*/
/* -- include the following line if the md5.h header file is separate -- */
/* #include "md5.h" */
/* forward declaration */
static void Transform ();
static unsigned char PADDING[64] = {
0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
};
/* F, G and H are basic MD5 functions: selection, majority, parity */
#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
#define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
#define H(x, y, z) ((x) ^ (y) ^ (z))
#define I(x, y, z) ((y) ^ ((x) | (~z)))
/* ROTATE_LEFT rotates x left n bits */
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
/* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4 */
/* Rotation is separate from addition to prevent recomputation */
#define FF(a, b, c, d, x, s, ac) \
{(a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define GG(a, b, c, d, x, s, ac) \
{(a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define HH(a, b, c, d, x, s, ac) \
{(a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
#define II(a, b, c, d, x, s, ac) \
{(a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \
(a) = ROTATE_LEFT ((a), (s)); \
(a) += (b); \
}
void MD5Init (mdContext)
MD5_CTX *mdContext;
{
mdContext->i[0] = mdContext->i[1] = (UINT4)0;
/* Load magic initialization constants.
*/
mdContext->buf[0] = (UINT4)0x67452301;
mdContext->buf[1] = (UINT4)0xefcdab89;
mdContext->buf[2] = (UINT4)0x98badcfe;
mdContext->buf[3] = (UINT4)0x10325476;
}
void MD5Update (mdContext, inBuf, inLen)
MD5_CTX *mdContext;
unsigned char *inBuf;
unsigned int inLen;
{
UINT4 in[16];
int mdi;
unsigned int i, ii;
/* compute number of bytes mod 64 */
mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
/* update number of bits */
if ((mdContext->i[0] + ((UINT4)inLen << 3)) < mdContext->i[0])
mdContext->i[1]++;
mdContext->i[0] += ((UINT4)inLen << 3);
mdContext->i[1] += ((UINT4)inLen >> 29);
while (inLen--) {
/* add new character to buffer, increment mdi */
mdContext->in[mdi++] = *inBuf++;
/* transform if necessary */
if (mdi == 0x40) {
for (i = 0, ii = 0; i < 16; i++, ii += 4)
in[i] = (((UINT4)mdContext->in[ii+3]) << 24) |
(((UINT4)mdContext->in[ii+2]) << 16) |
(((UINT4)mdContext->in[ii+1]) << 8) |
((UINT4)mdContext->in[ii]);
Transform (mdContext->buf, in);
mdi = 0;
}
}
}
void MD5Final (mdContext)
MD5_CTX *mdContext;
{
UINT4 in[16];
int mdi;
unsigned int i, ii;
unsigned int padLen;
/* save number of bits */
in[14] = mdContext->i[0];
in[15] = mdContext->i[1];
/* compute number of bytes mod 64 */
mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
/* pad out to 56 mod 64 */
padLen = (mdi < 56) ? (56 - mdi) : (120 - mdi);
MD5Update (mdContext, PADDING, padLen);
/* append length in bits and transform */
for (i = 0, ii = 0; i < 14; i++, ii += 4)
in[i] = (((UINT4)mdContext->in[ii+3]) << 24) |
(((UINT4)mdContext->in[ii+2]) << 16) |
(((UINT4)mdContext->in[ii+1]) << 8) |
((UINT4)mdContext->in[ii]);
Transform (mdContext->buf, in);
/* store buffer in digest */
for (i = 0, ii = 0; i < 4; i++, ii += 4) {
mdContext->digest[ii] = (unsigned char)(mdContext->buf[i] & 0xFF);
mdContext->digest[ii+1] =
(unsigned char)((mdContext->buf[i] >> 8) & 0xFF);
mdContext->digest[ii+2] =
(unsigned char)((mdContext->buf[i] >> 16) & 0xFF);
mdContext->digest[ii+3] =
(unsigned char)((mdContext->buf[i] >> 24) & 0xFF);
}
}
/* Basic MD5 step. Transform buf based on in.
*/
static void Transform (buf, in)
UINT4 *buf;
UINT4 *in;
{
UINT4 a = buf[0], b = buf[1], c = buf[2], d = buf[3];
/* Round 1 */
#define S11 7
#define S12 12
#define S13 17
#define S14 22
FF ( a, b, c, d, in[ 0], S11, 3614090360); /* 1 */
FF ( d, a, b, c, in[ 1], S12, 3905402710); /* 2 */
FF ( c, d, a, b, in[ 2], S13, 606105819); /* 3 */
FF ( b, c, d, a, in[ 3], S14, 3250441966); /* 4 */
FF ( a, b, c, d, in[ 4], S11, 4118548399); /* 5 */
FF ( d, a, b, c, in[ 5], S12, 1200080426); /* 6 */
FF ( c, d, a, b, in[ 6], S13, 2821735955); /* 7 */
FF ( b, c, d, a, in[ 7], S14, 4249261313); /* 8 */
FF ( a, b, c, d, in[ 8], S11, 1770035416); /* 9 */
FF ( d, a, b, c, in[ 9], S12, 2336552879); /* 10 */
FF ( c, d, a, b, in[10], S13, 4294925233); /* 11 */
FF ( b, c, d, a, in[11], S14, 2304563134); /* 12 */
FF ( a, b, c, d, in[12], S11, 1804603682); /* 13 */
FF ( d, a, b, c, in[13], S12, 4254626195); /* 14 */
FF ( c, d, a, b, in[14], S13, 2792965006); /* 15 */
FF ( b, c, d, a, in[15], S14, 1236535329); /* 16 */
/* Round 2 */
#define S21 5
#define S22 9
#define S23 14
#define S24 20
GG ( a, b, c, d, in[ 1], S21, 4129170786); /* 17 */
GG ( d, a, b, c, in[ 6], S22, 3225465664); /* 18 */
GG ( c, d, a, b, in[11], S23, 643717713); /* 19 */
GG ( b, c, d, a, in[ 0], S24, 3921069994); /* 20 */
GG ( a, b, c, d, in[ 5], S21, 3593408605); /* 21 */
GG ( d, a, b, c, in[10], S22, 38016083); /* 22 */
GG ( c, d, a, b, in[15], S23, 3634488961); /* 23 */
GG ( b, c, d, a, in[ 4], S24, 3889429448); /* 24 */
GG ( a, b, c, d, in[ 9], S21, 568446438); /* 25 */
GG ( d, a, b, c, in[14], S22, 3275163606); /* 26 */
GG ( c, d, a, b, in[ 3], S23, 4107603335); /* 27 */
GG ( b, c, d, a, in[ 8], S24, 1163531501); /* 28 */
GG ( a, b, c, d, in[13], S21, 2850285829); /* 29 */
GG ( d, a, b, c, in[ 2], S22, 4243563512); /* 30 */
GG ( c, d, a, b, in[ 7], S23, 1735328473); /* 31 */
GG ( b, c, d, a, in[12], S24, 2368359562); /* 32 */
/* Round 3 */
#define S31 4
#define S32 11
#define S33 16
#define S34 23
HH ( a, b, c, d, in[ 5], S31, 4294588738); /* 33 */
HH ( d, a, b, c, in[ 8], S32, 2272392833); /* 34 */
HH ( c, d, a, b, in[11], S33, 1839030562); /* 35 */
HH ( b, c, d, a, in[14], S34, 4259657740); /* 36 */
HH ( a, b, c, d, in[ 1], S31, 2763975236); /* 37 */
HH ( d, a, b, c, in[ 4], S32, 1272893353); /* 38 */
HH ( c, d, a, b, in[ 7], S33, 4139469664); /* 39 */
HH ( b, c, d, a, in[10], S34, 3200236656); /* 40 */
HH ( a, b, c, d, in[13], S31, 681279174); /* 41 */
HH ( d, a, b, c, in[ 0], S32, 3936430074); /* 42 */
HH ( c, d, a, b, in[ 3], S33, 3572445317); /* 43 */
HH ( b, c, d, a, in[ 6], S34, 76029189); /* 44 */
HH ( a, b, c, d, in[ 9], S31, 3654602809); /* 45 */
HH ( d, a, b, c, in[12], S32, 3873151461); /* 46 */
HH ( c, d, a, b, in[15], S33, 530742520); /* 47 */
HH ( b, c, d, a, in[ 2], S34, 3299628645); /* 48 */
/* Round 4 */
#define S41 6
#define S42 10
#define S43 15
#define S44 21
II ( a, b, c, d, in[ 0], S41, 4096336452); /* 49 */
II ( d, a, b, c, in[ 7], S42, 1126891415); /* 50 */
II ( c, d, a, b, in[14], S43, 2878612391); /* 51 */
II ( b, c, d, a, in[ 5], S44, 4237533241); /* 52 */
II ( a, b, c, d, in[12], S41, 1700485571); /* 53 */
II ( d, a, b, c, in[ 3], S42, 2399980690); /* 54 */
II ( c, d, a, b, in[10], S43, 4293915773); /* 55 */
II ( b, c, d, a, in[ 1], S44, 2240044497); /* 56 */
II ( a, b, c, d, in[ 8], S41, 1873313359); /* 57 */
II ( d, a, b, c, in[15], S42, 4264355552); /* 58 */
II ( c, d, a, b, in[ 6], S43, 2734768916); /* 59 */
II ( b, c, d, a, in[13], S44, 1309151649); /* 60 */
II ( a, b, c, d, in[ 4], S41, 4149444226); /* 61 */
II ( d, a, b, c, in[11], S42, 3174756917); /* 62 */
II ( c, d, a, b, in[ 2], S43, 718787259); /* 63 */
II ( b, c, d, a, in[ 9], S44, 3951481745); /* 64 */
buf[0] += a;
buf[1] += b;
buf[2] += c;
buf[3] += d;
}
/*
**********************************************************************
** End of md5.c **
******************************* (cut) ********************************
*/
/*
**********************************************************************
** md5driver.c -- sample routines to test **
** RSA Data Security, Inc. MD5 message digest algorithm. **
** Created: 2/16/90 RLR **
** Updated: 1/91 SRD **
**********************************************************************
*/
/*
**********************************************************************
** Copyright (C) 1990, RSA Data Security, Inc. All rights reserved. **
** **
** RSA Data Security, Inc. makes no representations concerning **
** either the merchantability of this software or the suitability **
** of this software for any particular purpose. It is provided "as **
** is" without express or implied warranty of any kind. **
** **
** These notices must be retained in any copies of any part of this **
** documentation and/or software. **
**********************************************************************
*/
#include <stdio.h>
#include <sys/types.h>
#include <time.h>
#include <string.h>
/* -- include the following file if the file md5.h is separate -- */
/* #include "md5.h" */
/* Prints message digest buffer in mdContext as 32 hexadecimal digits.
Order is from low-order byte to high-order byte of digest.
Each byte is printed with high-order hexadecimal digit first.
*/
static void MDPrint (mdContext)
MD5_CTX *mdContext;
{
int i;
for (i = 0; i < 16; i++)
printf ("%02x", mdContext->digest[i]);
}
/* size of test block */
#define TEST_BLOCK_SIZE 1000
/* number of blocks to process */
#define TEST_BLOCKS 10000
/* number of test bytes = TEST_BLOCK_SIZE * TEST_BLOCKS */
static long TEST_BYTES = (long)TEST_BLOCK_SIZE * (long)TEST_BLOCKS;
/* A time trial routine, to measure the speed of MD5.
Measures wall time required to digest TEST_BLOCKS * TEST_BLOCK_SIZE
characters.
*/
static void MDTimeTrial ()
{
MD5_CTX mdContext;
time_t endTime, startTime;
unsigned char data[TEST_BLOCK_SIZE];
unsigned int i;
/* initialize test data */
for (i = 0; i < TEST_BLOCK_SIZE; i++)
data[i] = (unsigned char)(i & 0xFF);
/* start timer */
printf ("MD5 time trial. Processing %ld characters...\n", TEST_BYTES);
time (&startTime);
/* digest data in TEST_BLOCK_SIZE byte blocks */
MD5Init (&mdContext);
for (i = TEST_BLOCKS; i > 0; i--)
MD5Update (&mdContext, data, TEST_BLOCK_SIZE);
MD5Final (&mdContext);
/* stop timer, get time difference */
time (&endTime);
MDPrint (&mdContext);
printf (" is digest of test input.\n");
printf
("Seconds to process test input: %ld\n", (long)(endTime-startTime));
printf
("Characters processed per second: %ld\n",
TEST_BYTES/(endTime-startTime));
}
/* Computes the message digest for string inString.
Prints out message digest, a space, the string (in quotes) and a
carriage return.
*/
static void MDString (inString)
char *inString;
{
MD5_CTX mdContext;
unsigned int len = strlen (inString);
MD5Init (&mdContext);
MD5Update (&mdContext, inString, len);
MD5Final (&mdContext);
MDPrint (&mdContext);
printf (" \"%s\"\n\n", inString);
}
/* Computes the message digest for a specified file.
Prints out message digest, a space, the file name, and a carriage
return.
*/
static void MDFile (filename)
char *filename;
{
FILE *inFile = fopen (filename, "rb");
MD5_CTX mdContext;
int bytes;
unsigned char data[1024];
if (inFile == NULL) {
printf ("%s can't be opened.\n", filename);
return;
}
MD5Init (&mdContext);
while ((bytes = fread (data, 1, 1024, inFile)) != 0)
MD5Update (&mdContext, data, bytes);
MD5Final (&mdContext);
MDPrint (&mdContext);
printf (" %s\n", filename);
fclose (inFile);
}
/* Writes the message digest of the data from stdin onto stdout,
followed by a carriage return.
*/
static void MDFilter ()
{
MD5_CTX mdContext;
int bytes;
unsigned char data[16];
MD5Init (&mdContext);
while ((bytes = fread (data, 1, 16, stdin)) != 0)
MD5Update (&mdContext, data, bytes);
MD5Final (&mdContext);
MDPrint (&mdContext);
printf ("\n");
}
/* Runs a standard suite of test data.
*/
static void MDTestSuite ()
{
printf ("MD5 test suite results:\n\n");
MDString ("");
MDString ("a");
MDString ("abc");
MDString ("message digest");
MDString ("abcdefghijklmnopqrstuvwxyz");
MDString
("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789");
MDString
("1234567890123456789012345678901234567890\
1234567890123456789012345678901234567890");
/* Contents of file foo are "abc" */
MDFile ("foo");
}
void main (argc, argv)
int argc;
char *argv[];
{
int i;
/* For each command line argument in turn:
** filename -- prints message digest and name of file
** -sstring -- prints message digest and contents of string
** -t -- prints time trial statistics for 1M characters
** -x -- execute a standard suite of test data
** (no args) -- writes messages digest of stdin onto stdout
*/
if (argc == 1)
MDFilter ();
else
for (i = 1; i < argc; i++)
if (argv[i][0] == '-' && argv[i][1] == 's')
MDString (argv[i] + 2);
else if (strcmp (argv[i], "-t") == 0)
MDTimeTrial ();
else if (strcmp (argv[i], "-x") == 0)
MDTestSuite ();
else MDFile (argv[i]);
}
/*
**********************************************************************
** End of md5driver.c **
******************************* (cut) ********************************
*/
|
the_stack_data/7373.c
|
/* Exercise 1 - Calculations
Write a C program to input marks of two subjects. Calculate and print the average of the two marks. */
#include <stdio.h>
// begin of the main function
int main() {
int Marks1, Marks2; // declare variables
double Average; // declare variable
printf("Enter 1st subject Marks : "); // get inputs
scanf("%d", &Marks1); // read values
printf("Enter 2nd subject Marks : "); // get inputs
scanf("%d", &Marks2); // read values
Average = (Marks1 + Marks2) / 2; // calculation
printf("Average of 2 subjects : %.2f", Average); // display result
return 0;
} // end of main function
|
the_stack_data/3263663.c
|
#if HAVE_LIBUV
#include "ejs-runloop.h"
#include "uv.h"
typedef struct {
uv_timer_t timer;
Task task;
void* data;
TaskDataDtor dtor;
} task_timer;
static void
invoke_task(uv_timer_t* timer, int unused)
{
task_timer* t = (task_timer*)timer->data;
t->task(t->data);
t->dtor(t->data);
uv_timer_stop(timer);
free(t);
}
void
_ejs_runloop_add_task(Task task, void* data, TaskDataDtor dtor)
{
task_timer* t = malloc(sizeof(task_timer));
uv_timer_init(uv_default_loop(), &t->timer);
t->timer.data = t;
t->task = task;
t->data = data;
t->dtor = dtor;
uv_timer_start(&t->timer, invoke_task, 0, 0);
}
void
_ejs_runloop_start()
{
uv_run(uv_default_loop(), UV_RUN_DEFAULT);
}
#endif // HAVE_LIBUV
|
the_stack_data/78532.c
|
/*
* $WAR_COUNT: 1
* $UNCUT_WAR_COUNT: 0
*/
int g;
void foo() {
return;
}
int main(void) {
// Read
int tmp = g;
// If/else breaks BB
if (tmp > 42)
tmp = 1;
else
tmp = 2;
// Call breaks the path
foo();
// Write
g = tmp + 1;
return g;
}
|
the_stack_data/243893740.c
|
#include <stdio.h>
int main(void){
int a, b, aux;
printf("Informe um numero: ");
scanf("%d", &a);
printf("Informe outro numero: ");
scanf("%d", &b);
aux = b;
b = a;
a = aux;
printf("Numeros %d e %d\n", a, b);
return 0;
}
|
the_stack_data/37836.c
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#include <ctype.h>
#define SYMTABSZ 8000
#define nil NULL
typedef int64_t word;
typedef uint64_t uword;
typedef int32_t hword;
#define WORD(l, r) (((l)&0777777) << 18 | ((r)&0777777))
#define LW(w) (((w) >> 18)&0777777)
#define RW(w) ((w)&0777777)
enum Valtype
{
Undef = 0,
Abs,
Op,
Io,
Asm,
};
enum Toktype
{
Unused = 0,
Eof,
Symbol,
Word,
Newline,
Space,
Not,
DQuote,
Mod,
And,
LParen,
RParen,
Times,
Plus,
Comma,
Cons,
Minus,
Period,
Div,
Colon,
Semi,
Less,
Equal,
Great,
At,
LBrack,
RBrack,
LBrace,
Or,
RBrace,
/* only used as character classes */
Digit,
Letter,
};
typedef struct Value Value;
struct Value
{
int type;
word value;
};
typedef struct Sym Sym;
struct Sym
{
char name[24];
Value v;
};
typedef struct Token Token;
struct Token
{
int type;
union {
word w;
Sym *s;
};
};
typedef struct Section Section;
struct Section
{
hword start;
hword size;
};
int chartab[] = {
Unused, Unused, Unused, Unused, Unused, Unused, Unused, Unused,
Unused, Unused, Newline, Unused, Unused, Unused, Unused, Unused,
Unused, Unused, Unused, Unused, Unused, Unused, Unused, Unused,
Unused, Unused, Unused, Unused, Unused, Unused, Unused, Unused,
Space, Not, DQuote, Unused, Unused, Mod, And, Unused,
LParen, RParen, Times, Plus, Comma, Minus, Period, Div,
Digit, Digit, Digit, Digit, Digit, Digit, Digit, Digit,
Digit, Digit, Colon, Semi, Less, Equal, Great, Unused,
At, Letter, Letter, Letter, Letter, Letter, Letter, Letter,
Letter, Letter, Letter, Letter, Letter, Letter, Letter, Letter,
Letter, Letter, Letter, Letter, Letter, Letter, Letter, Letter,
Letter, Letter, Letter, LBrack, Unused, RBrack, Unused, Letter,
Unused, Letter, Letter, Letter, Letter, Letter, Letter, Letter,
Letter, Letter, Letter, Letter, Letter, Letter, Letter, Letter,
Letter, Letter, Letter, Letter, Letter, Letter, Letter, Letter,
Letter, Letter, Letter, LBrace, Or, RBrace, Unused, Unused
};
#define CTYPE(c) chartab[(c)&0177]
Sym *symtab[SYMTABSZ];
Sym syms[] = {
{ ".", Abs, 0 },
{ "ASCII", Asm, 0 },
{ "DFAD", Op, 0110 },
{ "DFSB", Op, 0111 },
{ "DFMP", Op, 0112 },
{ "DFDV", Op, 0113 },
{ "DMOVE", Op, 0120 },
{ "DMOVN", Op, 0121 },
{ "FIX", Op, 0122 },
{ "XBLT", Op, 0123 },
{ "DMOVEM",Op, 0124 },
{ "DMOVNM",Op, 0125 },
{ "FIXR", Op, 0126 },
{ "FLTR", Op, 0127 },
{ "UFA", Op, 0130 },
{ "DFN", Op, 0131 },
{ "FSC", Op, 0132 },
{ "IBP", Op, 0133 },
{ "ILDB", Op, 0134 },
{ "LDB", Op, 0135 },
{ "IDPB", Op, 0136 },
{ "DPB", Op, 0137 },
{ "FAD", Op, 0140 },
{ "FADL", Op, 0141 },
{ "FADM", Op, 0142 },
{ "FADB", Op, 0143 },
{ "FADR", Op, 0144 },
{ "FADRI", Op, 0145 },
{ "FADRM", Op, 0146 },
{ "FADRB", Op, 0147 },
{ "FSB", Op, 0150 },
{ "FSBL", Op, 0151 },
{ "FSBM", Op, 0152 },
{ "FSBB", Op, 0153 },
{ "FSBR", Op, 0154 },
{ "FSBRI", Op, 0155 },
{ "FSBRM", Op, 0156 },
{ "FSBRB", Op, 0157 },
{ "FMP", Op, 0160 },
{ "FMPL", Op, 0161 },
{ "FMPM", Op, 0162 },
{ "FMPB", Op, 0163 },
{ "FMPR", Op, 0164 },
{ "FMPRI", Op, 0165 },
{ "FMPRM", Op, 0166 },
{ "FMPRB", Op, 0167 },
{ "FDV", Op, 0170 },
{ "FDVL", Op, 0171 },
{ "FDVM", Op, 0172 },
{ "FDVB", Op, 0173 },
{ "FDVR", Op, 0174 },
{ "FDVRI", Op, 0175 },
{ "FDVRM", Op, 0176 },
{ "FDVRB", Op, 0177 },
{ "MOVE", Op, 0200 },
{ "MOVEI", Op, 0201 },
{ "MOVEM", Op, 0202 },
{ "MOVES", Op, 0203 },
{ "MOVS", Op, 0204 },
{ "MOVSI", Op, 0205 },
{ "MOVSM", Op, 0206 },
{ "MOVSS", Op, 0207 },
{ "MOVN", Op, 0210 },
{ "MOVNI", Op, 0211 },
{ "MOVNM", Op, 0212 },
{ "MOVNS", Op, 0213 },
{ "MOVM", Op, 0214 },
{ "MOVMI", Op, 0215 },
{ "MOVMM", Op, 0216 },
{ "MOVMS", Op, 0217 },
{ "IMUL", Op, 0220 },
{ "IMULI", Op, 0221 },
{ "IMULM", Op, 0222 },
{ "IMULB", Op, 0223 },
{ "MUL", Op, 0224 },
{ "MULI", Op, 0225 },
{ "MULM", Op, 0226 },
{ "MULB", Op, 0227 },
{ "IDIV", Op, 0230 },
{ "IDIVI", Op, 0231 },
{ "IDIVM", Op, 0232 },
{ "IDIVB", Op, 0233 },
{ "DIV", Op, 0234 },
{ "DIVI", Op, 0235 },
{ "DIVM", Op, 0236 },
{ "DIVB", Op, 0237 },
{ "ASH", Op, 0240 },
{ "ROT", Op, 0241 },
{ "LSH", Op, 0242 },
{ "JFFO", Op, 0243 },
{ "ASHC", Op, 0244 },
{ "ROTC", Op, 0245 },
{ "LSHC", Op, 0246 },
{ "EXCH", Op, 0250 },
{ "BLT", Op, 0251 },
{ "AOBJP", Op, 0252 },
{ "AOBJN", Op, 0253 },
{ "JRST", Op, 0254 },
{ "JFCL", Op, 0255 },
{ "XCT", Op, 0256 },
{ "MAP", Op, 0257 },
{ "PUSHJ", Op, 0260 },
{ "PUSH", Op, 0261 },
{ "POP", Op, 0262 },
{ "POPJ", Op, 0263 },
{ "JSR", Op, 0264 },
{ "JSP", Op, 0265 },
{ "JSA", Op, 0266 },
{ "JRA", Op, 0267 },
{ "ADD", Op, 0270 },
{ "ADDI", Op, 0271 },
{ "ADDM", Op, 0272 },
{ "ADDB", Op, 0273 },
{ "SUB", Op, 0274 },
{ "SUBI", Op, 0275 },
{ "SUBM", Op, 0276 },
{ "SUBB", Op, 0277 },
{ "CAI", Op, 0300 },
{ "CAIL", Op, 0301 },
{ "CAIE", Op, 0302 },
{ "CAILE", Op, 0303 },
{ "CAIA", Op, 0304 },
{ "CAIGE", Op, 0305 },
{ "CAIN", Op, 0306 },
{ "CAIG", Op, 0307 },
{ "CAM", Op, 0310 },
{ "CAML", Op, 0311 },
{ "CAME", Op, 0312 },
{ "CAMLE", Op, 0313 },
{ "CAMA", Op, 0314 },
{ "CAMGE", Op, 0315 },
{ "CAMN", Op, 0316 },
{ "CAMG", Op, 0317 },
{ "JUMP", Op, 0320 },
{ "JUMPL", Op, 0321 },
{ "JUMPE", Op, 0322 },
{ "JUMPLE",Op, 0323 },
{ "JUMPA", Op, 0324 },
{ "JUMPGE",Op, 0325 },
{ "JUMPN", Op, 0326 },
{ "JUMPG", Op, 0327 },
{ "SKIP", Op, 0330 },
{ "SKIPL", Op, 0331 },
{ "SKIPE", Op, 0332 },
{ "SKIPLE",Op, 0333 },
{ "SKIPA", Op, 0334 },
{ "SKIPGE",Op, 0335 },
{ "SKIPN", Op, 0336 },
{ "SKIPG", Op, 0337 },
{ "AOJ", Op, 0340 },
{ "AOJL", Op, 0341 },
{ "AOJE", Op, 0342 },
{ "AOJLE", Op, 0343 },
{ "AOJA", Op, 0344 },
{ "AOJGE", Op, 0345 },
{ "AOJN", Op, 0346 },
{ "AOJG", Op, 0347 },
{ "AOS", Op, 0350 },
{ "AOSL", Op, 0351 },
{ "AOSE", Op, 0352 },
{ "AOSLE", Op, 0353 },
{ "AOSA", Op, 0354 },
{ "AOSGE", Op, 0355 },
{ "AOSN", Op, 0356 },
{ "AOSG", Op, 0357 },
{ "SOJ", Op, 0360 },
{ "SOJL", Op, 0361 },
{ "SOJE", Op, 0362 },
{ "SOJLE", Op, 0363 },
{ "SOJA", Op, 0364 },
{ "SOJGE", Op, 0365 },
{ "SOJN", Op, 0366 },
{ "SOJG", Op, 0367 },
{ "SOS", Op, 0370 },
{ "SOSL", Op, 0371 },
{ "SOSE", Op, 0372 },
{ "SOSLE", Op, 0373 },
{ "SOSA", Op, 0374 },
{ "SOSGE", Op, 0375 },
{ "SOSN", Op, 0376 },
{ "SOSG", Op, 0377 },
{ "SETZ", Op, 0400 },
{ "SETZI", Op, 0401 },
{ "SETZM", Op, 0402 },
{ "SETZB", Op, 0403 },
{ "AND", Op, 0404 },
{ "ANDI", Op, 0405 },
{ "ANDM", Op, 0406 },
{ "ANDB", Op, 0407 },
{ "ANDCA", Op, 0410 },
{ "ANDCAI",Op, 0411 },
{ "ANDCAM",Op, 0412 },
{ "ANDCAB",Op, 0413 },
{ "SETM", Op, 0414 },
{ "SETMI", Op, 0415 },
{ "XMOVEI",Op, 0415 },
{ "SETMM", Op, 0416 },
{ "SETMB", Op, 0417 },
{ "ANDCM", Op, 0420 },
{ "ANDCMI",Op, 0421 },
{ "ANDCMM",Op, 0422 },
{ "ANDCMB",Op, 0423 },
{ "SETA", Op, 0424 },
{ "SETAI", Op, 0425 },
{ "SETAM", Op, 0426 },
{ "SETAB", Op, 0427 },
{ "XOR", Op, 0430 },
{ "XORI", Op, 0431 },
{ "XORM", Op, 0432 },
{ "XORB", Op, 0433 },
{ "IOR", Op, 0434 },
{ "IORI", Op, 0435 },
{ "IORM", Op, 0436 },
{ "IORB", Op, 0437 },
{ "ANDCB", Op, 0440 },
{ "ANDCBI",Op, 0441 },
{ "ANDCBM",Op, 0442 },
{ "ANDCBB",Op, 0443 },
{ "EQV", Op, 0444 },
{ "EQVI", Op, 0445 },
{ "EQVM", Op, 0446 },
{ "EQVB", Op, 0447 },
{ "SETCA", Op, 0450 },
{ "SETCAI",Op, 0451 },
{ "SETCAM",Op, 0452 },
{ "SETCAB",Op, 0453 },
{ "ORCA", Op, 0454 },
{ "ORCAI", Op, 0455 },
{ "ORCAM", Op, 0456 },
{ "ORCAB", Op, 0457 },
{ "SETCM", Op, 0460 },
{ "SETCMI",Op, 0461 },
{ "SETCMM",Op, 0462 },
{ "SETCMB",Op, 0463 },
{ "ORCM", Op, 0464 },
{ "ORCMI", Op, 0465 },
{ "ORCMM", Op, 0466 },
{ "ORCMB", Op, 0467 },
{ "ORCB", Op, 0470 },
{ "ORCBI", Op, 0471 },
{ "ORCBM", Op, 0472 },
{ "ORCBB", Op, 0473 },
{ "SETO", Op, 0474 },
{ "SETOI", Op, 0475 },
{ "SETOM", Op, 0476 },
{ "SETOB", Op, 0477 },
{ "HLL", Op, 0500 },
{ "HLLI", Op, 0501 },
{ "HLLM", Op, 0502 },
{ "HLLS", Op, 0503 },
{ "HRL", Op, 0504 },
{ "HRLI", Op, 0505 },
{ "HRLM", Op, 0506 },
{ "HRLS", Op, 0507 },
{ "HLLZ", Op, 0510 },
{ "HLLZI", Op, 0511 },
{ "HLLZM", Op, 0512 },
{ "HLLZS", Op, 0513 },
{ "HRLZ", Op, 0514 },
{ "HRLZI", Op, 0515 },
{ "HRLZM", Op, 0516 },
{ "HRLZS", Op, 0517 },
{ "HLLO", Op, 0520 },
{ "HLLOI", Op, 0521 },
{ "HLLOM", Op, 0522 },
{ "HLLOS", Op, 0523 },
{ "HRLO", Op, 0524 },
{ "HRLOI", Op, 0525 },
{ "HRLOM", Op, 0526 },
{ "HRLOS", Op, 0527 },
{ "HLLE", Op, 0530 },
{ "HLLEI", Op, 0531 },
{ "HLLEM", Op, 0532 },
{ "HLLES", Op, 0533 },
{ "HRLE", Op, 0534 },
{ "HRLEI", Op, 0535 },
{ "HRLEM", Op, 0536 },
{ "HRLES", Op, 0537 },
{ "HRR", Op, 0540 },
{ "HRRI", Op, 0541 },
{ "HRRM", Op, 0542 },
{ "HRRS", Op, 0543 },
{ "HLR", Op, 0544 },
{ "HLRI", Op, 0545 },
{ "HLRM", Op, 0546 },
{ "HLRS", Op, 0547 },
{ "HRRZ", Op, 0550 },
{ "HRRZI", Op, 0551 },
{ "HRRZM", Op, 0552 },
{ "HRRZS", Op, 0553 },
{ "HLRZ", Op, 0554 },
{ "HLRZI", Op, 0555 },
{ "HLRZM", Op, 0556 },
{ "HLRZS", Op, 0557 },
{ "HRRO", Op, 0560 },
{ "HRROI", Op, 0561 },
{ "HRROM", Op, 0562 },
{ "HRROS", Op, 0563 },
{ "HLRO", Op, 0564 },
{ "HLROI", Op, 0565 },
{ "HLROM", Op, 0566 },
{ "HLROS", Op, 0567 },
{ "HRRE", Op, 0570 },
{ "HRREI", Op, 0571 },
{ "HRREM", Op, 0572 },
{ "HRRES", Op, 0573 },
{ "HLRE", Op, 0574 },
{ "HLREI", Op, 0575 },
{ "HLREM", Op, 0576 },
{ "HLRES", Op, 0577 },
{ "TRN", Op, 0600 },
{ "TLN", Op, 0601 },
{ "TRNE", Op, 0602 },
{ "TLNE", Op, 0603 },
{ "TRNA", Op, 0604 },
{ "TLNA", Op, 0605 },
{ "TRNN", Op, 0606 },
{ "TLNN", Op, 0607 },
{ "TDN", Op, 0610 },
{ "TSN", Op, 0611 },
{ "TDNE", Op, 0612 },
{ "TSNE", Op, 0613 },
{ "TDNA", Op, 0614 },
{ "TSNA", Op, 0615 },
{ "TDNN", Op, 0616 },
{ "TSNN", Op, 0617 },
{ "TRZ", Op, 0620 },
{ "TLZ", Op, 0621 },
{ "TRZE", Op, 0622 },
{ "TLZE", Op, 0623 },
{ "TRZA", Op, 0624 },
{ "TLZA", Op, 0625 },
{ "TRZN", Op, 0626 },
{ "TLZN", Op, 0627 },
{ "TDZ", Op, 0630 },
{ "TSZ", Op, 0631 },
{ "TDZE", Op, 0632 },
{ "TSZE", Op, 0633 },
{ "TDZA", Op, 0634 },
{ "TSZA", Op, 0635 },
{ "TDZN", Op, 0636 },
{ "TSZN", Op, 0637 },
{ "TRC", Op, 0640 },
{ "TLC", Op, 0641 },
{ "TRCE", Op, 0642 },
{ "TLCE", Op, 0643 },
{ "TRCA", Op, 0644 },
{ "TLCA", Op, 0645 },
{ "TRCN", Op, 0646 },
{ "TLCN", Op, 0647 },
{ "TDC", Op, 0650 },
{ "TSC", Op, 0651 },
{ "TDCE", Op, 0652 },
{ "TSCE", Op, 0653 },
{ "TDCA", Op, 0654 },
{ "TSCA", Op, 0655 },
{ "TDCN", Op, 0656 },
{ "TSCN", Op, 0657 },
{ "TRO", Op, 0660 },
{ "TLO", Op, 0661 },
{ "TROE", Op, 0662 },
{ "TLOE", Op, 0663 },
{ "TROA", Op, 0664 },
{ "TLOA", Op, 0665 },
{ "TRON", Op, 0666 },
{ "TLON", Op, 0667 },
{ "TDO", Op, 0670 },
{ "TSO", Op, 0671 },
{ "TDOE", Op, 0672 },
{ "TSOE", Op, 0673 },
{ "TDOA", Op, 0674 },
{ "TSOA", Op, 0675 },
{ "TDON", Op, 0676 },
{ "TSON", Op, 0677 },
{ "BLKI", Io, 070000 },
{ "BLKO", Io, 070010 },
{ "DATAI", Io, 070004 },
{ "DATAO", Io, 070014 },
{ "CONO", Io, 070020 },
{ "CONI", Io, 070024 },
{ "CONSZ", Io, 070030 },
{ "CONSO", Io, 070034 },
{ "", 0, 0 }
};
hword assemble(void);
int pass2;
int error;
word origin;
word mem[01000000];
#define MAXSECT 100 /* increase if necessary */
Section sects[MAXSECT];
int nsect;
hword nextdot;
FILE *tokf;
FILE *wf;
FILE *outf;
int nextc;
int toksp;
Token tokstk[2];
Sym *dot;
#define PUSHT(t) tokstk[toksp++] = (t)
void
putw10(word w, FILE *f)
{
int i;
w &= 0777777777777;
for(i = 5; i >= 0; i--)
putc(((w>>i*6)&077)|0200, f);
}
void
writeblock(word origin, word count)
{
int i;
word chksm;
word w;
chksm = 0;
putw10(w = WORD(-count, origin-1), outf);
chksm += w;
for(i = 0; i < count; i++){
chksm += mem[i+origin];
putw10(mem[i+origin], outf);
}
putw10(-chksm, outf);
}
int
ch(void)
{
int c;
if(nextc){
c = nextc;
nextc = 0;
return c;
}
c = getchar();
tail:
if(c == '#'){
while(c = getchar(), c != '\n')
if(c == EOF) return c;
goto tail;
}
if(c == '\t' || c == '\r')
c = ' ';
return c;
}
int
chsp(void)
{
int c;
while(c = ch(), c == ' ');
return c;
}
int
hash(char *s)
{
int hsh;
hsh = 0;
for(; *s != '\0'; s++)
hsh += *s;
return hsh % SYMTABSZ;
}
Sym**
findsym(char *name)
{
int hsh;
char *p;
Sym **s;
hsh = hash(name);
s = &symtab[hsh];
for(;;){
if(*s == nil ||
strncmp((*s)->name, name, 24) == 0)
return s;
s++;
if(s == &symtab[SYMTABSZ])
s = symtab;
if(s == &symtab[hsh]){
fprintf(stderr, "symbol table full\n");
exit(1);
}
}
}
Sym*
getsym(char *name)
{
Sym **p;
p = findsym(name);
if(*p)
return *p;
*p = malloc(sizeof(Sym));
strncpy((*p)->name, name, 24);
(*p)->v.type = Undef;
(*p)->v.value = 0;
return *p;
}
word
number(void)
{
int c;
word n, oct, dec;
int sign;
sign = 1;
if(c = ch(), c == '-')
sign = -1;
else
nextc = c;
oct = dec = 0;
while(c = ch(), CTYPE(c) == Digit){
oct = (oct << 3) | (c-'0');
dec = dec*10 + (c-'0');
}
if(c == '.')
n = dec;
else{
n = oct;
nextc = c;
}
return (n*sign)&0777777777777;
}
int
strchar(int delim)
{
int c;
c = getchar();
if(delim && c == delim)
return 0400;
if(c != '\\')
return c;
c = getchar();
switch(c){
case 'b':
c = '\b';
break;
case 'n':
c = '\n';
break;
case 'r':
c = '\r';
break;
case '\\':
c = '\\';
break;
case '0':
c = 0;
break;
}
return c;
}
Token
token(void)
{
char name[24];
char *p;
int c;
Token t;
if(toksp){
t = tokstk[--toksp];
return t;
}
if(pass2){
fread(&t, sizeof(t), 1, tokf);
return t;
}
c = chsp();
if(c == EOF)
t.type = Eof;
else
switch(CTYPE(c)){
case Period:
case Letter:
p = name;
do{
if(p < name+23)
*p++ = toupper(c);
}while(c = ch(), CTYPE(c) == Letter ||
CTYPE(c) == Period ||
CTYPE(c) == Digit);
nextc = c;
*p++ = '\0';
t.type = Symbol;
t.s = getsym(name);
break;
case Digit:
nextc = c;
t.type = Word;
t.w = number();
break;
case DQuote:
t.type = Word;
t.w = strchar(0);
break;
case Comma:
c = chsp();
if(CTYPE(c) == Comma)
t.type = Cons;
else{
t.type = Comma;
nextc = c;
}
break;
case Unused:
fprintf(stderr, "unknown char: %c\n", c);
break;
default:
t.type = CTYPE(c);
break;
}
fwrite(&t, sizeof(t), 1, tokf);
return t;
}
void
directive(int type)
{
uword w;
int c, i, s;
if(type == 0){ /* ascii */
/* save ascii words in word file because they're not tokens */
if(!pass2){
c = chsp();
if(c != '"'){
fprintf(stderr, "\" expected\n");
return;
}
w = 0;
i = 0;
s = 29;
while(c = strchar('"'), c != 0400 && c != EOF){
c &= 0177;
w = w | ((uword)c << s);
s -= 7;
if(++i == 5){
fwrite(&w, sizeof(w), 1, wf);
dot->v.value++;
i = 0;
s = 29;
w = 0;
}
}
if(i){
fwrite(&w, sizeof(w), 1, wf);
dot->v.value++;
}
w = ~0;
fwrite(&w, sizeof(w), 1, wf);
dot->v.value++;
}else{
while(fread(&w, sizeof(w), 1, wf), w != ~0)
mem[dot->v.value++] = w;
}
}
}
Value
apply(int op, Value v1, Value v2)
{
switch(op){
case Not:
v1.value |= ~v2.value;
break;
case Plus:
v1.value += v2.value;
break;
case Minus:
v1.value -= v2.value;
break;
case Times:
v1.value *= v2.value;
break;
case Div:
v1.value /= v2.value;
break;
case Mod:
v1.value %= v2.value;
break;
case And:
v1.value &= v2.value;
break;
case Or:
v1.value |= v2.value;
break;
case Less:
v1.value <<= v2.value;
break;
case Great:
v1.value >>= v2.value;
break;
case Cons:
v1.value = WORD(v1.value, v2.value);
break;
default:
fprintf(stderr, "unknown op %d\n", op);
return v2;
}
v1.value &= 0777777777777;
return v1;
}
Value
expr(void)
{
Token t;
int op;
Value v, v2;
hword savedot;
v.type = Abs;
v.value = 0;
op = Plus;
/* TODO: just accept possible tokens */
while(t = token(),
t.type != RBrack && t.type != RBrace && t.type != Comma &&
t.type != LParen && t.type != RParen &&
t.type != Newline && t.type != Semi){
switch(t.type){
case Word:
v2.type = Abs;
v2.value = t.w;
v = apply(op, v, v2);
op = Plus;
break;
case Symbol:
v = apply(op, v, t.s->v);
op = Plus;
break;
case LBrack:
v2 = expr();
t = token();
if(t.type != RBrack){
fprintf(stderr, "']' expected\n");
error = 1;
PUSHT(t);
}
v = apply(op, v, v2);
op = Plus;
break;
case LBrace:
v2.type = Abs;
savedot = dot->v.value;
v2.value = assemble();
dot->v.value = savedot;
t = token();
if(t.type != RBrace){
fprintf(stderr, "'}' expected\n");
error = 1;
PUSHT(t);
}
v = apply(op, v, v2);
op = Plus;
break;
case Not:
case Plus:
case Minus:
case Times:
case Div:
case Mod:
case And:
case Or:
case Less:
case Great:
case Cons:
op = t.type;
break;
default:
fprintf(stderr, "can't parse expr %d\n", t.type);
error = 1;
v.type = Abs;
v.value = 0;
}
}
PUSHT(t);
return v;
}
word
opline(void)
{
word inst;
word op, ac, i, x, y;
word w;
Token t;
Value v;
int type;
type = 0;
ac = i = x = y = 0;
t = token();
if(t.s->v.type == Op){
op = t.s->v.value & 0777;
}else if(t.s->v.type == Io){
type = 1;
op = t.s->v.value & 077774;
}else{
fprintf(stderr, "expected opcode\n");
error = 1;
}
/* So many gotos, sorry Edsger */
t = token();
if(t.type == At){
i = 1;
t = token();
goto Y;
}
if(t.type == LParen)
goto X;
if(t.type == Newline || t.type == Semi){
PUSHT(t);
goto end;
}
PUSHT(t); /* has to be AC or Y now */
w = expr().value;
t = token();
if(t.type == Comma)
ac = w & (type == 0 ? 017 : 0774);
else{
y = w & 0777777;
if(t.type == LParen)
goto X;
PUSHT(t);
goto end;
}
t = token();
if(t.type == Newline || t.type == Semi){
PUSHT(t);
goto end;
}
if(t.type == At){
i = 1;
t = token();
}
Y:
if(t.type != LParen){
PUSHT(t);
y = expr().value & 0777777;
t = token();
if(t.type == LParen)
goto X;
PUSHT(t);
}else{
X:
x = expr().value & 017;
t = token();
if(t.type != RParen){
fprintf(stderr, ") expected\n");
error = 1;
PUSHT(t);
}
}
end:
if(type == 0)
inst = op << 27 |
ac << 23 |
i << 22 |
x << 18 |
y;
else
inst = op << 21 |
ac << 24 | /* this is correct */
i << 22 |
x << 18 |
y;
// printf("inst: %lo\n", inst);
return inst;
}
hword
assemble(void)
{
Token t, tt;
Section *sect;
sect = §s[nsect++];
if(sect == §s[MAXSECT]){
fprintf(stderr, "ran out of sections\n");
exit(1);
}
dot->v.value = sect->start;
// printf("section %d %o %o\n", nsect, sect->start, sect->size);
while(t = token(), t.type != Eof && t.type != RBrace){
switch(t.type){
case Symbol:
if(t.s->v.type == Asm){
directive(t.s->v.value);
t = token();
break;
}
if(t.s->v.type == Op ||
t.s->v.type == Io){
PUSHT(t);
mem[dot->v.value] = opline();
dot->v.value++;
t = token();
break;
}
tt = token();
if(tt.type == Colon){
// if(t.s->v.type != Undef &&
// t.s->v.value != dot->v.value)
// fprintf(stderr, "redefining %s\n",
// t.s->name);
t.s->v = dot->v;
continue;
}else if(tt.type == Equal){
t.s->v = expr();
t = token();
}else{
PUSHT(tt);
goto exp;
}
break;
exp:
case Not:
case LBrace:
case LBrack:
case Minus:
case Word:
PUSHT(t);
mem[dot->v.value++] = expr().value;
t = token();
break;
default:
if(t.type != Newline && t.type != Semi){
fprintf(stderr, "can't parse %d\n", t.type);
error = 1;
}
}
// if(!pass2)
// printf("statement %d\n", t.type);
if(t.type == RBrace)
break;
if(t.type != Newline && t.type != Semi){
PUSHT(t);
fprintf(stderr, "statement not ended %d\n", t.type);
error = 1;
while(t.type != Newline && t.type != Semi)
t = token();
}
}
PUSHT(t);
if(!pass2){
sect->size = dot->v.value - sect->start;
sect->start = nextdot;
nextdot += sect->size;
// printf("size: %o %o\n", sect->size, sect->start);
}
return sect->start;
}
void
dumpsymbols(void)
{
int i;
for(i = 0; i < SYMTABSZ; i++)
if(symtab[i] && symtab[i]->v.type != Op &&
symtab[i]->v.type != Io)
fprintf(stderr, "%s %o %lo\n", symtab[i]->name,
symtab[i]->v.type, symtab[i]->v.value);
}
void
dumpmem(word start, word end)
{
for(; start < end; start++)
printf("%lo: %lo\n", start, mem[start]);
}
void
initsyms(void)
{
int hsh;
Sym *s, **sp;
for(s = syms; s->name[0]; s++){
sp = findsym(s->name);
*sp = s;
}
dot = getsym(".");
}
int
main(int argc, char *argv[])
{
Section *s;
Sym **start;
hword blkstart, blksize;
origin = 01000;
initsyms();
/* first pass - figure out sections mostly */
tokf = fopen("a.tok", "wb");
if(tokf == NULL)
return 1;
wf = fopen("a.w", "wb");
if(wf == NULL)
return 1;
nextdot = origin;
assemble();
fclose(tokf);
fclose(wf);
/* second pass - figure out addresses */
if(error){
fprintf(stderr, "errors\n");
return 1;
}
pass2++;
tokf = fopen("a.tok", "rb");
if(tokf == NULL)
return 1;
wf = fopen("a.w", "rb");
if(wf == NULL)
return 1;
toksp = 0;
nsect = 0;
assemble();
/* third pass */
fseek(tokf, 0, 0);
fseek(wf, 0, 0);
toksp = 0;
nsect = 0;
assemble();
fclose(tokf);
fclose(wf);
outf = fopen("a.rim", "wb");
if(outf == NULL)
return 1;
/*
blkstart = sects[nsect-1].start;
blksize = 0;
for(s = §s[nsect-1]; s >= sects; s--){
printf("sect %ld: %o %o\n", s-sects, s->start, s->size);
blksize += s->size;
}
writeblock(blkstart, blksize);
dumpmem(blkstart, blkstart+blksize);
*/
for(s = §s[nsect-1]; s >= sects; s--){
writeblock(s->start, s->size);
dumpmem(s->start, s->start+s->size);
}
if(start = findsym("START"), *start)
putw10(WORD(0254000L, (*start)->v.value), outf);
else
putw10(WORD(0254000L, origin), outf);
fclose(outf);
dumpsymbols();
}
|
the_stack_data/98074.c
|
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
struct subdir
{
char sbDirName[10],parentDirName[10],fname[10][10];
int fcnt;
};
struct
{
char dname[10],fname[10][10],parentDir[10];
struct subdir *SubDirectory[10];
int fcnt,subcnt;
}dir[10];
int main()
{
int i,ch,dcnt,k;
char f[30], d[30],sbd[30],master[15];
dcnt=0;
printf("Welcome to Tree structured Directory.\n");
printf("Enter the name of the Master Directory:\t");
scanf("%s",master);
printf("\n");
while(1)
{
printf("1.Create Directory\t2.Create Sub Directory\t3.Create File\n4.Delete File\t5.Delete file in Sub Directory");
printf("\t6.Display Directories\n7.Display Sub Directory\t8.Search File\t9.Exit");
printf("\nEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1:
{
printf("\nEnter name of directory: ");
scanf("%s", dir[dcnt].dname);
strcpy(dir[dcnt].parentDir,master);
dir[dcnt].fcnt=0;
dcnt++;
printf("Directory created");
printf("\n\n");
}
break;
case 2:
{
printf("\nEnter Directory into which Sub Directory is to be created: ");
scanf("%s",d);
for(i=0;i<dcnt;i++)
if(strcmp(d,dir[i].dname)==0)
{
struct subdir *sd =(struct subdir*)malloc(sizeof(struct subdir));
strcpy(sd->parentDirName,dir[i].dname);
printf("Enter name of newly Sub Directory: ");
scanf("%s",sd->sbDirName);
dir[i].SubDirectory[dir[i].subcnt] = sd;
dir[i].subcnt++;
printf("SubDirectory created");
printf("\n\n");
break;
}
if(i==dcnt)
printf("\nNo Such Directory exist");
printf("\n\n");
}break;
case 3:
{
printf("\nEnter name of the Directory : ");
scanf("%s",d);
for(i=0;i<dcnt;i++)
if(strcmp(d,dir[i].dname)==0)
{
if(dir[i].subcnt>0)
{
printf("Whether to place the file in any Sub Directory(y/n): ");
char c;
scanf(" %c",&c);
if(c=='y')
{
printf("Enter name of Sub Directory: ");
scanf("%s",sbd); for(int j=0;j<dir[i].subcnt;j++)
{
if(strcmp(sbd,dir[i].SubDirectory[j]->sbDirName)==0)
{
printf("Enter name of the file: "); scanf("%s",dir[i].SubDirectory[j]->fname[dir[i].SubDirectory[j]->fcnt]);
dir[i].SubDirectory[j]->fcnt++;
printf("File created in Sub Directory");
printf("\n\n");
goto break1;
}
if(j == dir[i].subcnt) printf("No such Sub Directory");
}
}
else
{
printf("OK then ");
goto n_cr;
}
}
n_cr:
printf("Enter name of the file: ");
scanf("%s",dir[i].fname[dir[i].fcnt]);
dir[i].fcnt++;
printf("File created in Directory");
printf("\n\n");
break;
}
if(i==dcnt)
printf("Directory %s not found\n",d);
}
break1:break;
case 4:
{
printf("\nEnter name of the Directory: ");
scanf("%s",d);
for(i=0;i<dcnt;i++)
{
if(strcmp(d,dir[i].dname)==0)
{
printf("Enter name of the file: ");
scanf("%s",f);
for(k=0;k<dir[i].fcnt;k++)
{
if(strcmp(f, dir[i].fname[k])==0)
{
printf("File %s is deleted ",f);
dir[i].fcnt--;
strcpy(dir[i].fname[k],dir[i].fname[dir[i].fcnt]);
printf("\n\n");
goto jmp;
}
}
printf("File %s not found",f);
printf("\n");
goto jmp;
}
}
printf("Directory %s not found",d);
printf("\n");
}jmp : break;
case 5:
{
printf("\nEnter name of the Directory: ");
scanf("%s",d);
for(i=0;i<dcnt;i++)
{
if(strcmp(d,dir[i].dname)==0)
{
printf("Enter name of Sub Directory: ");
scanf("%s",sbd); for(int j=0;j<dir[i].subcnt;j++)
{
if(strcmp(sbd,dir[i].SubDirectory[j]->sbDirName)==0)
{
printf("Enter name of the file: ");
scanf("%s",f); for(k=0;k<dir[i].SubDirectory[j]->fcnt;k++)
{
if(strcmp(f, dir[i].SubDirectory[j]->fname[k])==0)
{ printf("File %s is deleted ",f);
printf("\n\n");
dir[i].SubDirectory[j]->fcnt--;
strcpy(dir[i].SubDirectory[j]->fname[k],
dir[i].SubDirectory[j]->fname[dir[i].SubDirectory[j]->fcnt]);
goto jmp2;
}
}
printf("File %s not found",f);
printf("\n");
goto jmp2;
}
printf("Sub Directory %s Not found",sbd);
printf("\n\n");
goto jmp2;
}
}
}
printf("Directory %s not found",d);
printf("\n\n");
}
jmp2: break;
case 6:
{
if(dcnt==0)
printf("\nNo Directory found");
else
{
printf("\nDirectory\t\t\tSub Directories\t\tFiles");
for(i=0;i<dcnt;i++)
{
printf("\n%s\t\t\t",dir[i].dname);
for(int j=0;j<dir[i].subcnt;j++)
printf("\t%s",dir[i].SubDirectory[j]->sbDirName);
for(int j=0;j<dir[i].fcnt;j++) printf("\t\t%s",dir[i].fname[j]);
}
}
printf("\n\n");
}
break;
case 7:
{
for(i=0;i<dcnt;i++)
{
printf("\n%s\n",dir[i].dname);
printf("Sub Directories\t\tParent Directory\t\tFiles\n");
for(int j=0;j<dir[i].subcnt;j++)
{
printf("%s\t\t\t%s\t\t\t",dir[i].SubDirectory[j]->sbDirName,dir[i].SubDirectory[j]->parentDirName);
for(int k=0; k<dir[i].SubDirectory[j]->fcnt; k++)
{printf("%s",dir[i].SubDirectory[j]->fname[k]);}
}
printf("\n");
}
printf("\n\n");
}break;
case 8:
{
printf("\nEnter name of the Directory: ");
scanf("%s",d);
for(i=0;i<dcnt;i++)
{
if(strcmp(d,dir[i].dname)==0)
{
printf("\nEnter name of Subdirectory:(Enter n if file not in Sub Directory): ");
scanf("%s",sbd);
if(strcmp(sbd,"n") ==0) goto no_sb_dir;
else
{
for(int j=0;j<dir[i].subcnt;j++)
if(strcmp(sbd,dir[i].SubDirectory[j]->sbDirName) == 0)
{
printf("Enter the name of the file: \t");
scanf("%s",f);
for(k=0; k<dir[i].SubDirectory[j]->fcnt ;k++) {
if(strcmp(f, dir[i].SubDirectory[j]->fname[k])==0)
{
printf("File %s/%s/%s/%s found ",master,dir[i].dname,dir[i].SubDirectory[j]->sbDirName,f);
printf("\n\n\n");
goto jmp3;
}
} printf("File %s not found",f);
printf("\n\n");
goto jmp3;
}
}
no_sb_dir:
printf("Enter the name of the file: ");
scanf("%s",f);
for(k=0;k<dir[i].fcnt;k++)
{
if(strcmp(f, dir[i].fname[k])==0) {
printf("File %s/%s/%s found ",master,dir[i].dname,f);
printf("\n\n\n");
goto jmp3;
}
}
printf("File %s not found",f);
printf("\n\n");
goto jmp3;
}
printf("Directory %s not found",d);
printf("\n\n");
}
jmp3: break;
default: exit(0);
}
}
}
return 0;
}
|
the_stack_data/777475.c
|
/* gzread.c -- zlib functions for reading gzip files
* Copyright (C) 2004, 2005, 2010, 2011, 2012, 2013 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
#ifdef BUILDSYSTEM_ENABLE_ZLIB_SUPPORT
#include "gzguts.h"
/* Local functions */
local int gz_load OF((gz_statep, unsigned char *, unsigned, unsigned *));
local int gz_avail OF((gz_statep));
local int gz_look OF((gz_statep));
local int gz_decomp OF((gz_statep));
local int gz_fetch OF((gz_statep));
local int gz_skip OF((gz_statep, z_off64_t));
/* Use read() to load a buffer -- return -1 on error, otherwise 0. Read from
state->fd, and update state->eof, state->err, and state->msg as appropriate.
This function needs to loop on read(), since read() is not guaranteed to
read the number of bytes requested, depending on the type of descriptor. */
local int gz_load(state, buf, len, have)
gz_statep state;
unsigned char *buf;
unsigned len;
unsigned *have;
{
int ret;
*have = 0;
do {
ret = _read(state->fd, buf + *have, len - *have);
if (ret <= 0)
break;
*have += ret;
} while (*have < len);
if (ret < 0) {
gz_error(state, Z_ERRNO, zstrerror());
return -1;
}
if (ret == 0)
state->eof = 1;
return 0;
}
/* Load up input buffer and set eof flag if last data loaded -- return -1 on
error, 0 otherwise. Note that the eof flag is set when the end of the input
file is reached, even though there may be unused data in the buffer. Once
that data has been used, no more attempts will be made to read the file.
If strm->avail_in != 0, then the current data is moved to the beginning of
the input buffer, and then the remainder of the buffer is loaded with the
available data from the input file. */
local int gz_avail(state)
gz_statep state;
{
unsigned got;
z_streamp strm = &(state->strm);
if (state->err != Z_OK && state->err != Z_BUF_ERROR)
return -1;
if (state->eof == 0) {
if (strm->avail_in) { /* copy what's there to the start */
unsigned char *p = state->in;
unsigned const char *q = strm->next_in;
unsigned n = strm->avail_in;
do {
*p++ = *q++;
} while (--n);
}
if (gz_load(state, state->in + strm->avail_in,
state->size - strm->avail_in, &got) == -1)
return -1;
strm->avail_in += got;
strm->next_in = state->in;
}
return 0;
}
/* Look for gzip header, set up for inflate or copy. state->x.have must be 0.
If this is the first time in, allocate required memory. state->how will be
left unchanged if there is no more input data available, will be set to COPY
if there is no gzip header and direct copying will be performed, or it will
be set to GZIP for decompression. If direct copying, then leftover input
data from the input buffer will be copied to the output buffer. In that
case, all further file reads will be directly to either the output buffer or
a user buffer. If decompressing, the inflate state will be initialized.
gz_look() will return 0 on success or -1 on failure. */
local int gz_look(state)
gz_statep state;
{
z_streamp strm = &(state->strm);
/* allocate read buffers and inflate memory */
if (state->size == 0) {
/* allocate buffers */
state->in = (unsigned char *)malloc(state->want);
state->out = (unsigned char *)malloc(state->want << 1);
if (state->in == NULL || state->out == NULL) {
if (state->out != NULL)
free(state->out);
if (state->in != NULL)
free(state->in);
gz_error(state, Z_MEM_ERROR, "out of memory");
return -1;
}
state->size = state->want;
/* allocate inflate memory */
state->strm.zalloc = Z_NULL;
state->strm.zfree = Z_NULL;
state->strm.opaque = Z_NULL;
state->strm.avail_in = 0;
state->strm.next_in = Z_NULL;
if (inflateInit2(&(state->strm), 15 + 16) != Z_OK) { /* gunzip */
free(state->out);
free(state->in);
state->size = 0;
gz_error(state, Z_MEM_ERROR, "out of memory");
return -1;
}
}
/* get at least the magic bytes in the input buffer */
if (strm->avail_in < 2) {
if (gz_avail(state) == -1)
return -1;
if (strm->avail_in == 0)
return 0;
}
/* look for gzip magic bytes -- if there, do gzip decoding (note: there is
a logical dilemma here when considering the case of a partially written
gzip file, to wit, if a single 31 byte is written, then we cannot tell
whether this is a single-byte file, or just a partially written gzip
file -- for here we assume that if a gzip file is being written, then
the header will be written in a single operation, so that reading a
single byte is sufficient indication that it is not a gzip file) */
if (strm->avail_in > 1 &&
strm->next_in[0] == 31 && strm->next_in[1] == 139) {
inflateReset(strm);
state->how = GZIP;
state->direct = 0;
return 0;
}
/* no gzip header -- if we were decoding gzip before, then this is trailing
garbage. Ignore the trailing garbage and finish. */
if (state->direct == 0) {
strm->avail_in = 0;
state->eof = 1;
state->x.have = 0;
return 0;
}
/* doing raw i/o, copy any leftover input to output -- this assumes that
the output buffer is larger than the input buffer, which also assures
space for gzungetc() */
state->x.next = state->out;
if (strm->avail_in) {
memcpy(state->x.next, strm->next_in, strm->avail_in);
state->x.have = strm->avail_in;
strm->avail_in = 0;
}
state->how = COPY;
state->direct = 1;
return 0;
}
/* Decompress from input to the provided next_out and avail_out in the state.
On return, state->x.have and state->x.next point to the just decompressed
data. If the gzip stream completes, state->how is reset to LOOK to look for
the next gzip stream or raw data, once state->x.have is depleted. Returns 0
on success, -1 on failure. */
local int gz_decomp(state)
gz_statep state;
{
int ret = Z_OK;
unsigned had;
z_streamp strm = &(state->strm);
/* fill output buffer up to end of deflate stream */
had = strm->avail_out;
do {
/* get more input for inflate() */
if (strm->avail_in == 0 && gz_avail(state) == -1)
return -1;
if (strm->avail_in == 0) {
gz_error(state, Z_BUF_ERROR, "unexpected end of file");
break;
}
/* decompress and handle errors */
ret = inflate(strm, Z_NO_FLUSH);
if (ret == Z_STREAM_ERROR || ret == Z_NEED_DICT) {
gz_error(state, Z_STREAM_ERROR,
"internal error: inflate stream corrupt");
return -1;
}
if (ret == Z_MEM_ERROR) {
gz_error(state, Z_MEM_ERROR, "out of memory");
return -1;
}
if (ret == Z_DATA_ERROR) { /* deflate stream invalid */
gz_error(state, Z_DATA_ERROR,
strm->msg == NULL ? "compressed data error" : strm->msg);
return -1;
}
} while (strm->avail_out && ret != Z_STREAM_END);
/* update available output */
state->x.have = had - strm->avail_out;
state->x.next = strm->next_out - state->x.have;
/* if the gzip stream completed successfully, look for another */
if (ret == Z_STREAM_END)
state->how = LOOK;
/* good decompression */
return 0;
}
/* Fetch data and put it in the output buffer. Assumes state->x.have is 0.
Data is either copied from the input file or decompressed from the input
file depending on state->how. If state->how is LOOK, then a gzip header is
looked for to determine whether to copy or decompress. Returns -1 on error,
otherwise 0. gz_fetch() will leave state->how as COPY or GZIP unless the
end of the input file has been reached and all data has been processed. */
local int gz_fetch(state)
gz_statep state;
{
z_streamp strm = &(state->strm);
do {
switch(state->how) {
case LOOK: /* -> LOOK, COPY (only if never GZIP), or GZIP */
if (gz_look(state) == -1)
return -1;
if (state->how == LOOK)
return 0;
break;
case COPY: /* -> COPY */
if (gz_load(state, state->out, state->size << 1, &(state->x.have))
== -1)
return -1;
state->x.next = state->out;
return 0;
case GZIP: /* -> GZIP or LOOK (if end of gzip stream) */
strm->avail_out = state->size << 1;
strm->next_out = state->out;
if (gz_decomp(state) == -1)
return -1;
}
} while (state->x.have == 0 && (!state->eof || strm->avail_in));
return 0;
}
/* Skip len uncompressed bytes of output. Return -1 on error, 0 on success. */
local int gz_skip(state, len)
gz_statep state;
z_off64_t len;
{
unsigned n;
/* skip over len bytes or reach end-of-file, whichever comes first */
while (len)
/* skip over whatever is in output buffer */
if (state->x.have) {
n = GT_OFF(state->x.have) || (z_off64_t)state->x.have > len ?
(unsigned)len : state->x.have;
state->x.have -= n;
state->x.next += n;
state->x.pos += n;
len -= n;
}
/* output buffer empty -- return if we're at the end of the input */
else if (state->eof && state->strm.avail_in == 0)
break;
/* need more data to skip -- load up output buffer */
else {
/* get more output, looking for header if required */
if (gz_fetch(state) == -1)
return -1;
}
return 0;
}
/* -- see zlib.h -- */
int ZEXPORT gzread(file, buf, len)
gzFile file;
voidp buf;
unsigned len;
{
unsigned got, n;
gz_statep state;
z_streamp strm;
/* get internal structure */
if (file == NULL)
return -1;
state = (gz_statep)file;
strm = &(state->strm);
/* check that we're reading and that there's no (serious) error */
if (state->mode != GZ_READ ||
(state->err != Z_OK && state->err != Z_BUF_ERROR))
return -1;
/* since an int is returned, make sure len fits in one, otherwise return
with an error (this avoids the flaw in the interface) */
if ((int)len < 0) {
gz_error(state, Z_DATA_ERROR, "requested length does not fit in int");
return -1;
}
/* if len is zero, avoid unnecessary operations */
if (len == 0)
return 0;
/* process a skip request */
if (state->seek) {
state->seek = 0;
if (gz_skip(state, state->skip) == -1)
return -1;
}
/* get len bytes to buf, or less than len if at the end */
got = 0;
do {
/* first just try copying data from the output buffer */
if (state->x.have) {
n = state->x.have > len ? len : state->x.have;
memcpy(buf, state->x.next, n);
state->x.next += n;
state->x.have -= n;
}
/* output buffer empty -- return if we're at the end of the input */
else if (state->eof && strm->avail_in == 0) {
state->past = 1; /* tried to read past end */
break;
}
/* need output data -- for small len or new stream load up our output
buffer */
else if (state->how == LOOK || len < (state->size << 1)) {
/* get more output, looking for header if required */
if (gz_fetch(state) == -1)
return -1;
continue; /* no progress yet -- go back to copy above */
/* the copy above assures that we will leave with space in the
output buffer, allowing at least one gzungetc() to succeed */
}
/* large len -- read directly into user buffer */
else if (state->how == COPY) { /* read directly */
if (gz_load(state, (unsigned char *)buf, len, &n) == -1)
return -1;
}
/* large len -- decompress directly into user buffer */
else { /* state->how == GZIP */
strm->avail_out = len;
strm->next_out = (unsigned char *)buf;
if (gz_decomp(state) == -1)
return -1;
n = state->x.have;
state->x.have = 0;
}
/* update progress */
len -= n;
buf = (char *)buf + n;
got += n;
state->x.pos += n;
} while (len);
/* return number of bytes read into user buffer (will fit in int) */
return (int)got;
}
/* -- see zlib.h -- */
#ifdef Z_PREFIX_SET
# undef z_gzgetc
#else
# undef gzgetc
#endif
int ZEXPORT gzgetc(file)
gzFile file;
{
int ret;
unsigned char buf[1];
gz_statep state;
/* get internal structure */
if (file == NULL)
return -1;
state = (gz_statep)file;
/* check that we're reading and that there's no (serious) error */
if (state->mode != GZ_READ ||
(state->err != Z_OK && state->err != Z_BUF_ERROR))
return -1;
/* try output buffer (no need to check for skip request) */
if (state->x.have) {
state->x.have--;
state->x.pos++;
return *(state->x.next)++;
}
/* nothing there -- try gzread() */
ret = gzread(file, buf, 1);
return ret < 1 ? -1 : buf[0];
}
int ZEXPORT gzgetc_(file)
gzFile file;
{
return gzgetc(file);
}
/* -- see zlib.h -- */
int ZEXPORT gzungetc(c, file)
int c;
gzFile file;
{
gz_statep state;
/* get internal structure */
if (file == NULL)
return -1;
state = (gz_statep)file;
/* check that we're reading and that there's no (serious) error */
if (state->mode != GZ_READ ||
(state->err != Z_OK && state->err != Z_BUF_ERROR))
return -1;
/* process a skip request */
if (state->seek) {
state->seek = 0;
if (gz_skip(state, state->skip) == -1)
return -1;
}
/* can't push EOF */
if (c < 0)
return -1;
/* if output buffer empty, put byte at end (allows more pushing) */
if (state->x.have == 0) {
state->x.have = 1;
state->x.next = state->out + (state->size << 1) - 1;
state->x.next[0] = c;
state->x.pos--;
state->past = 0;
return c;
}
/* if no room, give up (must have already done a gzungetc()) */
if (state->x.have == (state->size << 1)) {
gz_error(state, Z_DATA_ERROR, "out of room to push characters");
return -1;
}
/* slide output data if needed and insert byte before existing data */
if (state->x.next == state->out) {
unsigned char *src = state->out + state->x.have;
unsigned char *dest = state->out + (state->size << 1);
while (src > state->out)
*--dest = *--src;
state->x.next = dest;
}
state->x.have++;
state->x.next--;
state->x.next[0] = c;
state->x.pos--;
state->past = 0;
return c;
}
/* -- see zlib.h -- */
char * ZEXPORT gzgets(file, buf, len)
gzFile file;
char *buf;
int len;
{
unsigned left, n;
char *str;
unsigned char *eol;
gz_statep state;
/* check parameters and get internal structure */
if (file == NULL || buf == NULL || len < 1)
return NULL;
state = (gz_statep)file;
/* check that we're reading and that there's no (serious) error */
if (state->mode != GZ_READ ||
(state->err != Z_OK && state->err != Z_BUF_ERROR))
return NULL;
/* process a skip request */
if (state->seek) {
state->seek = 0;
if (gz_skip(state, state->skip) == -1)
return NULL;
}
/* copy output bytes up to new line or len - 1, whichever comes first --
append a terminating zero to the string (we don't check for a zero in
the contents, let the user worry about that) */
str = buf;
left = (unsigned)len - 1;
if (left) do {
/* assure that something is in the output buffer */
if (state->x.have == 0 && gz_fetch(state) == -1)
return NULL; /* error */
if (state->x.have == 0) { /* end of file */
state->past = 1; /* read past end */
break; /* return what we have */
}
/* look for end-of-line in current output buffer */
n = state->x.have > left ? left : state->x.have;
eol = (unsigned char *)memchr(state->x.next, '\n', n);
if (eol != NULL)
n = (unsigned)(eol - state->x.next) + 1;
/* copy through end-of-line, or remainder if not found */
memcpy(buf, state->x.next, n);
state->x.have -= n;
state->x.next += n;
state->x.pos += n;
left -= n;
buf += n;
} while (left && eol == NULL);
/* return terminated string, or if nothing, end of file */
if (buf == str)
return NULL;
buf[0] = 0;
return str;
}
/* -- see zlib.h -- */
int ZEXPORT gzdirect(file)
gzFile file;
{
gz_statep state;
/* get internal structure */
if (file == NULL)
return 0;
state = (gz_statep)file;
/* if the state is not known, but we can find out, then do so (this is
mainly for right after a gzopen() or gzdopen()) */
if (state->mode == GZ_READ && state->how == LOOK && state->x.have == 0)
(void)gz_look(state);
/* return 1 if transparent, 0 if processing a gzip stream */
return state->direct;
}
/* -- see zlib.h -- */
int ZEXPORT gzclose_r(file)
gzFile file;
{
int ret, err;
gz_statep state;
/* get internal structure */
if (file == NULL)
return Z_STREAM_ERROR;
state = (gz_statep)file;
/* check that we're reading */
if (state->mode != GZ_READ)
return Z_STREAM_ERROR;
/* free memory and close file */
if (state->size) {
inflateEnd(&(state->strm));
free(state->out);
free(state->in);
}
err = state->err == Z_BUF_ERROR ? Z_BUF_ERROR : Z_OK;
gz_error(state, Z_OK, NULL);
free(state->path);
ret = _close(state->fd);
free(state);
return ret ? Z_ERRNO : err;
}
#endif // BUILDSYSTEM_ENABLE_ZLIB_SUPPORT
|
the_stack_data/12368.c
|
/*************************************************************************
> File Name: char_reversal.c
> Author: Maxwell
> Mail: [email protected]
> Created Time: 2019年03月14日 星期四 19时23分22秒
************************************************************************/
#include<stdio.h>
#include<string.h>
void reverse_string(char* str)
{
if (str == NULL)
return;
int begin = 0;
int end = strlen(str) - 1;
while(begin < end)
{
char temp = str[begin];
str[begin] = str[end];
str[end] = temp;
begin++;
end--;
}
}
void test()
{
char str[] = "abcdefghj";
printf("str = (%s)\n", str);
reverse_string(str);
printf("str = (%s)\n", str);
}
int main()
{
test();
return 0;
}
|
the_stack_data/34514055.c
|
#include <stdio.h>
int main(int count, char* arg[]){
unsigned int distance = -100;
float power = 2.345f;
double super_power = 56789.4532;
char initial = 'A';
char first_name[] = "Zed";
char last_name[] = "Shaw";
printf("You are %d miles away.\n", distance);
printf("You have %f levels of power.\n", power);
printf("You have %f awesome super powers.\n", super_power);
printf("I have an initial %c.\n", initial);
printf("I have a first name %s.\n", first_name);
printf("I have a last name %s.\n", last_name);
printf("My whole name is %s %c. %s.\n", first_name, initial, last_name);
int bugs = 100;
double bug_rate = 1.2;
printf("You have %d bugs at the imaginary rate of %f.\n", bugs, bug_rate);
long universe_of_defects = 184467440737095516;
printf("The entire universe has %ld bugs.\n", universe_of_defects);
double expected_bugs = bugs * bug_rate;
printf("You are expected to have %f bugs.\n", expected_bugs);
double part_of_universe = expected_bugs / universe_of_defects;
printf("That is only a %e portion of the universe.\n", part_of_universe);
//this makes no sense, just a demo of something weird.
char nul_byte = '\0';
int care_percentage = bugs * nul_byte;
printf("Which means you should care %d%%.\n", care_percentage);
return 0;
}
|
the_stack_data/154855.c
|
int minStartValue(int* nums, int numsSize)
{
int sum = 1, startValue = 1;
for (int i = 0; i < numsSize; ++i)
{
sum += nums[i];
if (sum < 1)
{
startValue += 1 - sum;
sum = 1;
}
}
return startValue;
}
|
the_stack_data/841889.c
|
#include <string.h>
#include <stdio.h>
struct User {
char *usuario;
char *password;
};
/*
* Comprueba si un user tiene credenciales en la base de datos.
* formato de cred = usuario@password
* El programa recibe las credenciales como argumento tal como:
* ./credenciales paco@luna123
*/
int comprobarCredenciales(char *cred, struct User *db, int dbSize);
int main(int argc, char *argv[]){
/* 1- Comprobar argumentos.
* La condicion que aparece abajo comprueba que hay argumentos a parte
* de ./credenciales. Si no los hay explica el uso del programa y devuelve -1
*/
if (argc < 2){
printf("Error! Uso: %s <usuario@password>", argv[0]);
return -1;
}
/* 2- Simulamos la base de datos */
struct User database[] ={
{"paco","luna"},
{"juan","juan123"},
{"mari","luz"}};
/* 3- Comprobamos que las credenciales facilitadas coinciden e imprimimos
* el resultado de la comprobacion. */
int resultado = comprobarCredenciales(argv[1],database,3);
printf("resultado = %d\n",resultado);
}
int comprobarCredenciales(char *cred, struct User *db, int dbSize){
/* 1- Buscamos @. El puntero declarado a continuacion utiliza la funcion
* strstr() para buscar la cadena "@" en cred y apunta a donde esta alojado */
char *p = strstr(cred, "@");
if(p == NULL){ // No se ha encontrado @ en cred
return -1;
} else {
*p = '\0'; // Sustituimos @ por \0
char *usuario = cred;
char *password = p+1;
/* 2- Buscamos usuario y password dentro de db */
for(int i = 0; i < dbSize; i++){
int res1 = strcmp(db[i].usuario, usuario);
int res2 = strcmp(db[i].password, password);
if(res1 == 0 && res2 == 0){
return 0;
}
}
}
return 1;
}
|
the_stack_data/159514485.c
|
#define _GNU_SOURCE
#include <sys/mman.h>
#include "syscall.h"
int posix_madvise(void *addr, size_t len, int advice)
{
if (advice == MADV_DONTNEED) return 0;
return -__syscall(SYS_madvise, addr, len, advice);
}
|
the_stack_data/1022879.c
|
/** @file pa_devs.c
@ingroup examples_src
@brief List available devices, including device information.
@author Phil Burk http://www.softsynth.com
@note Define PA_USE_ASIO=0 to compile this code on Windows without
ASIO support.
*/
/*
* $Id: pa_devs.c 1953 2015-04-10 04:00:09Z philburk $
*
* This program uses the PortAudio Portable Audio Library.
* For more information see: http://www.portaudio.com
* Copyright (c) 1999-2000 Ross Bencina and Phil Burk
*
* 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.
*/
/*
* The text above constitutes the entire PortAudio license; however,
* the PortAudio community also makes the following non-binding requests:
*
* Any person wishing to distribute modifications to the Software is
* requested to send the modifications to the original developer so that
* they can be incorporated into the canonical version. It is also
* requested that these non-binding requests be included along with the
* license above.
*/
#include <stdio.h>
#include <math.h>
#include "portaudio.h"
#ifdef WIN32
#include <windows.h>
#if PA_USE_ASIO
#include "pa_asio.h"
#endif
#endif
/*******************************************************************/
static void PrintSupportedStandardSampleRates(
const PaStreamParameters *inputParameters,
const PaStreamParameters *outputParameters )
{
static double standardSampleRates[] = {
8000.0, 9600.0, 11025.0, 12000.0, 16000.0, 22050.0, 24000.0, 32000.0,
44100.0, 48000.0, 88200.0, 96000.0, 192000.0, -1 /* negative terminated list */
};
int i, printCount;
PaError err;
printCount = 0;
for( i=0; standardSampleRates[i] > 0; i++ )
{
err = Pa_IsFormatSupported( inputParameters, outputParameters, standardSampleRates[i] );
if( err == paFormatIsSupported )
{
if( printCount == 0 )
{
printf( "\t%8.2f", standardSampleRates[i] );
printCount = 1;
}
else if( printCount == 4 )
{
printf( ",\n\t%8.2f", standardSampleRates[i] );
printCount = 1;
}
else
{
printf( ", %8.2f", standardSampleRates[i] );
++printCount;
}
}
}
if( !printCount )
printf( "None\n" );
else
printf( "\n" );
}
/*******************************************************************/
int main(void);
int main(void)
{
int i, numDevices, defaultDisplayed;
const PaDeviceInfo *deviceInfo;
PaStreamParameters inputParameters, outputParameters;
PaError err;
err = Pa_Initialize();
if( err != paNoError )
{
printf( "ERROR: Pa_Initialize returned 0x%x\n", err );
goto error;
}
printf( "PortAudio version: 0x%08X\n", Pa_GetVersion());
printf( "Version text: '%s'\n", Pa_GetVersionInfo()->versionText );
numDevices = Pa_GetDeviceCount();
if( numDevices < 0 )
{
printf( "ERROR: Pa_GetDeviceCount returned 0x%x\n", numDevices );
err = numDevices;
goto error;
}
printf( "Number of devices = %d\n", numDevices );
for( i=0; i<numDevices; i++ )
{
deviceInfo = Pa_GetDeviceInfo( i );
printf( "--------------------------------------- device #%d\n", i );
/* Mark global and API specific default devices */
defaultDisplayed = 0;
if( i == Pa_GetDefaultInputDevice() )
{
printf( "[ Default Input" );
defaultDisplayed = 1;
}
else if( i == Pa_GetHostApiInfo( deviceInfo->hostApi )->defaultInputDevice )
{
const PaHostApiInfo *hostInfo = Pa_GetHostApiInfo( deviceInfo->hostApi );
printf( "[ Default %s Input", hostInfo->name );
defaultDisplayed = 1;
}
if( i == Pa_GetDefaultOutputDevice() )
{
printf( (defaultDisplayed ? "," : "[") );
printf( " Default Output" );
defaultDisplayed = 1;
}
else if( i == Pa_GetHostApiInfo( deviceInfo->hostApi )->defaultOutputDevice )
{
const PaHostApiInfo *hostInfo = Pa_GetHostApiInfo( deviceInfo->hostApi );
printf( (defaultDisplayed ? "," : "[") );
printf( " Default %s Output", hostInfo->name );
defaultDisplayed = 1;
}
if( defaultDisplayed )
printf( " ]\n" );
/* print device info fields */
#ifdef WIN32
{ /* Use wide char on windows, so we can show UTF-8 encoded device names */
wchar_t wideName[MAX_PATH];
MultiByteToWideChar(CP_UTF8, 0, deviceInfo->name, -1, wideName, MAX_PATH-1);
wprintf( L"Name = %s\n", wideName );
}
#else
printf( "Name = %s\n", deviceInfo->name );
#endif
printf( "Host API = %s\n", Pa_GetHostApiInfo( deviceInfo->hostApi )->name );
printf( "Max inputs = %d", deviceInfo->maxInputChannels );
printf( ", Max outputs = %d\n", deviceInfo->maxOutputChannels );
printf( "Default low input latency = %8.4f\n", deviceInfo->defaultLowInputLatency );
printf( "Default low output latency = %8.4f\n", deviceInfo->defaultLowOutputLatency );
printf( "Default high input latency = %8.4f\n", deviceInfo->defaultHighInputLatency );
printf( "Default high output latency = %8.4f\n", deviceInfo->defaultHighOutputLatency );
#ifdef WIN32
#if PA_USE_ASIO
/* ASIO specific latency information */
if( Pa_GetHostApiInfo( deviceInfo->hostApi )->type == paASIO ){
long minLatency, maxLatency, preferredLatency, granularity;
err = PaAsio_GetAvailableLatencyValues( i,
&minLatency, &maxLatency, &preferredLatency, &granularity );
printf( "ASIO minimum buffer size = %ld\n", minLatency );
printf( "ASIO maximum buffer size = %ld\n", maxLatency );
printf( "ASIO preferred buffer size = %ld\n", preferredLatency );
if( granularity == -1 )
printf( "ASIO buffer granularity = power of 2\n" );
else
printf( "ASIO buffer granularity = %ld\n", granularity );
}
#endif /* PA_USE_ASIO */
#endif /* WIN32 */
printf( "Default sample rate = %8.2f\n", deviceInfo->defaultSampleRate );
/* poll for standard sample rates */
inputParameters.device = i;
inputParameters.channelCount = deviceInfo->maxInputChannels;
inputParameters.sampleFormat = paInt16;
inputParameters.suggestedLatency = 0; /* ignored by Pa_IsFormatSupported() */
inputParameters.hostApiSpecificStreamInfo = NULL;
outputParameters.device = i;
outputParameters.channelCount = deviceInfo->maxOutputChannels;
outputParameters.sampleFormat = paInt16;
outputParameters.suggestedLatency = 0; /* ignored by Pa_IsFormatSupported() */
outputParameters.hostApiSpecificStreamInfo = NULL;
if( inputParameters.channelCount > 0 )
{
printf("Supported standard sample rates\n for half-duplex 16 bit %d channel input = \n",
inputParameters.channelCount );
PrintSupportedStandardSampleRates( &inputParameters, NULL );
}
if( outputParameters.channelCount > 0 )
{
printf("Supported standard sample rates\n for half-duplex 16 bit %d channel output = \n",
outputParameters.channelCount );
PrintSupportedStandardSampleRates( NULL, &outputParameters );
}
if( inputParameters.channelCount > 0 && outputParameters.channelCount > 0 )
{
printf("Supported standard sample rates\n for full-duplex 16 bit %d channel input, %d channel output = \n",
inputParameters.channelCount, outputParameters.channelCount );
PrintSupportedStandardSampleRates( &inputParameters, &outputParameters );
}
}
Pa_Terminate();
printf("----------------------------------------------\n");
return 0;
error:
Pa_Terminate();
fprintf( stderr, "Error number: %d\n", err );
fprintf( stderr, "Error message: %s\n", Pa_GetErrorText( err ) );
return err;
}
|
the_stack_data/68887968.c
|
/*
Comando 'se-entao-senao' com impressao
Helena Caseli
2010
*/
#include <stdio.h>
#include <stdlib.h>
int main() {
if (4 == 3) {
printf("4 eh igual a 3");
}
else {
printf("4 eh diferente de 3");
}
return 0;
}
|
the_stack_data/43888945.c
|
#include<stdio.h>
#include<math.h>
void main()
{
int n,x[100],i,j,s;
printf("Enter the number of numbers to be entered n : ");
scanf("%d",&n);
printf("Enter %d numbers : ",n);
for(i=1;i<=n;i++)
{
scanf("%d",&x[i]);
}
s=x[n];
for(j=n-1;j>=1;j--)
{
s=x[j]-s;
}
printf("The required sum is = %d.",s);
}
|
the_stack_data/105795.c
|
#include <stdlib.h>
#include <stdio.h>
#include <stdint.h>
#define RETURN_ERROR (-1)
#define RETURN_SUCCESS (0)
enum element_size
{
element_size_word = 0,
element_size_dword,
element_size_qword
};
void prep_array(uint8_t **array, int array_len_bytes)
{
*array = (uint8_t*)malloc(array_len_bytes);
// Sequentially fill the array
for (uint8_t i = 0; i < array_len_bytes; ++i)
{
// @todo1:
// this assignment will not behave as commented above, please fix
*array[i] = i;
}
}
int reverse_bytes_by_element(void *array, int array_len_bytes, enum element_size element_size)
{
// @todo2:
// 1. Ignore any outstanding bytes, process only full size elements of the array
// 2. Reverse byte order within each element e.g.
// for element_size_word { 0x1234, 0xabcd } -> { 0x3412, 0xcdab }
// 3. return RETURN_ERROR for any use case this function will not handle
// return RETURN_SUCCESS otherwise
return RETURN_SUCCESS;
}
void ugly_print_array(uint8_t *array, int array_len_bytes)
{
for (uint8_t i = 0; i < array_len_bytes; ++i)
{
printf("%02x", array[i]);
}
printf("\n");
}
void pretty_print_array(void *array, int array_len_bytes, enum element_size element_size)
{
// @todo3:
// 1. print array in a way that will make it easier on the eyes to see if the bytes are flipped
// 2. use it instead of ugly_print_array
}
int main(int argc, char *argv[])
{
int array_len_bytes = 16;
enum element_size element_size = element_size_word;
uint8_t *array = NULL;
prep_array(&array, array_len_bytes);
ugly_print_array(array, array_len_bytes);
if (reverse_bytes_by_element(array, array_len_bytes, element_size))
return RETURN_ERROR;
ugly_print_array(array, array_len_bytes);
return RETURN_SUCCESS;
}
// @todo4:
// there is an memory leak somewhere, please fix it
|
the_stack_data/70449987.c
|
extern const unsigned char Pods_AcceptSDKVersionString[];
extern const double Pods_AcceptSDKVersionNumber;
const unsigned char Pods_AcceptSDKVersionString[] __attribute__ ((used)) = "@(#)PROGRAM:Pods_AcceptSDK PROJECT:Pods-1" "\n";
const double Pods_AcceptSDKVersionNumber __attribute__ ((used)) = (double)1.;
|
the_stack_data/231392585.c
|
/*
* SPDX-FileCopyrightText: 2015-2021 Espressif Systems (Shanghai) CO LTD
*
* SPDX-License-Identifier: Apache-2.0
*/
#ifdef CONFIG_WPA3_SAE
#include <stdio.h>
#include <ctype.h>
#include <errno.h>
#include <stdlib.h>
#include <time.h>
#include "unity.h"
#include <string.h>
#include "crypto/crypto.h"
#include "../src/common/sae.h"
#include "utils/wpabuf.h"
typedef struct crypto_bignum crypto_bignum;
static struct wpabuf *wpabuf_alloc2(size_t len)
{
struct wpabuf *buf = (struct wpabuf *)os_zalloc(sizeof(struct wpabuf) + len);
if (buf == NULL)
return NULL;
buf->size = len;
buf->buf = (u8 *)(buf+1);
return buf;
}
/**
* * wpabuf_free - Free a wpabuf
* * @buf: wpabuf buffer
* */
void wpabuf_free2(struct wpabuf *buf)
{
if (buf == NULL)
return;
os_free(buf);
}
TEST_CASE("Test SAE functionality with ECC group", "[wpa3_sae]")
{
ESP_LOGI("SAE Test", "### Beginning SAE init and deinit ###");
{
/* Test init and deinit*/
struct sae_data sae;
memset(&sae, 0, sizeof(sae));
TEST_ASSERT(sae_set_group(&sae, IANA_SECP256R1) == 0);
sae_clear_temp_data(&sae);
sae_clear_data(&sae);
}
ESP_LOGI("SAE Test", "=========== Complete ============");
ESP_LOGI("SAE Test", "### Beginning SAE commit msg formation and parsing ###");
{
/* Test SAE commit msg formation and parsing*/
struct sae_data sae;
u8 addr1[ETH_ALEN] = {0xaa, 0xbb, 0xcc, 0xdd, 0xee, 0x11};
u8 addr2[ETH_ALEN] = {0x11, 0x22, 0x33, 0x44, 0x55, 0x66};
u8 pwd[] = "ESP32-WPA3";
struct wpabuf *buf;
int default_groups[] = { IANA_SECP256R1, 0 };
memset(&sae, 0, sizeof(sae));
TEST_ASSERT(sae_set_group(&sae, IANA_SECP256R1) == 0);
TEST_ASSERT(sae_prepare_commit(addr1, addr2, pwd, strlen((const char *)pwd), NULL, &sae) == 0);
buf = wpabuf_alloc2(SAE_COMMIT_MAX_LEN);
TEST_ASSERT( buf != NULL);
sae_write_commit(&sae, buf, NULL, NULL);// No anti-clogging token
/* Parsing commit created by self will be detected as reflection attack*/
TEST_ASSERT(sae_parse_commit(&sae,
wpabuf_mhead(buf), buf->used, NULL, 0, default_groups) == SAE_SILENTLY_DISCARD);
wpabuf_free2(buf);
sae_clear_temp_data(&sae);
sae_clear_data(&sae);
}
ESP_LOGI("SAE Test", "=========== Complete ============");
ESP_LOGI("SAE Test", "### Beginning SAE handshake ###");
{
/* SAE handshake*/
struct sae_data sae1; // STA1 data
struct sae_data sae2; // STA2 data
u8 addr1[ETH_ALEN] = {0xaa, 0xbb, 0xcc, 0xdd, 0xee, 0x11};
u8 addr2[ETH_ALEN] = {0x11, 0x22, 0x33, 0x44, 0x55, 0x66};
u8 pwd[] = "ESP32-WPA3";
memset(&sae1, 0, sizeof(sae1));
memset(&sae2, 0, sizeof(sae2));
struct wpabuf *buf1, *buf2, *buf3, *buf4;
int default_groups[] = { IANA_SECP256R1, 0 };
TEST_ASSERT(sae_set_group(&sae1, IANA_SECP256R1) == 0);
TEST_ASSERT(sae_set_group(&sae2, IANA_SECP256R1) == 0);
/* STA1 prepares for commit*/
TEST_ASSERT(sae_prepare_commit(addr1, addr2, pwd, strlen((const char *)pwd), NULL, &sae1) == 0);
/* STA2 prepares for commit*/
TEST_ASSERT(sae_prepare_commit(addr2, addr1, pwd, strlen((const char *)pwd), NULL, &sae2) == 0);
/* STA1 creates commit msg buffer*/
buf1 = wpabuf_alloc2(SAE_COMMIT_MAX_LEN);
TEST_ASSERT( buf1 != NULL);
sae_write_commit(&sae1, buf1, NULL, NULL);// No anti-clogging token
ESP_LOG_BUFFER_HEXDUMP("SAE: Commit1", wpabuf_mhead_u8(buf1), wpabuf_len(buf1), ESP_LOG_INFO);
/* STA2 creates commit msg buffer*/
buf2 = wpabuf_alloc2(SAE_COMMIT_MAX_LEN);
TEST_ASSERT( buf2 != NULL);
sae_write_commit(&sae2, buf2, NULL, NULL);// No anti-clogging token
ESP_LOG_BUFFER_HEXDUMP("SAE: Commit2", wpabuf_mhead_u8(buf2), wpabuf_len(buf2), ESP_LOG_INFO);
sae1.state = SAE_COMMITTED;
sae2.state = SAE_COMMITTED;
/* STA1 parses STA2 commit*/
TEST_ASSERT(sae_parse_commit(&sae1,
wpabuf_mhead(buf2), buf2->used, NULL, 0, default_groups) == 0);
/* STA2 parses STA1 commit*/
TEST_ASSERT(sae_parse_commit(&sae2,
wpabuf_mhead(buf1), buf1->used, NULL, 0, default_groups) == 0);
/* STA1 processes commit*/
TEST_ASSERT(sae_process_commit(&sae1) == 0);
/* STA2 processes commit*/
TEST_ASSERT(sae_process_commit(&sae2) == 0);
/* STA1 creates confirm msg buffer*/
buf3 = wpabuf_alloc2(SAE_COMMIT_MAX_LEN);
TEST_ASSERT( buf3 != NULL);
sae_write_confirm(&sae1, buf3);
ESP_LOG_BUFFER_HEXDUMP("SAE: Confirm1", wpabuf_mhead_u8(buf3), wpabuf_len(buf3), ESP_LOG_INFO);
/* STA2 creates confirm msg buffer*/
buf4 = wpabuf_alloc2(SAE_COMMIT_MAX_LEN);
TEST_ASSERT( buf3 != NULL);
sae_write_confirm(&sae2, buf4);
ESP_LOG_BUFFER_HEXDUMP("SAE: Confirm2", wpabuf_mhead_u8(buf4), wpabuf_len(buf4), ESP_LOG_INFO);
/* STA1 checks confirm from STA2*/
TEST_ASSERT(sae_check_confirm(&sae1, wpabuf_mhead(buf4), buf4->used) == 0);
/* STA2 checks confirm from STA1*/
TEST_ASSERT(sae_check_confirm(&sae2, wpabuf_mhead(buf3), buf3->used) == 0);
ESP_LOG_BUFFER_HEXDUMP("SAE: PMK1", sae1.pmk, SAE_PMK_LEN, ESP_LOG_INFO);
ESP_LOG_BUFFER_HEXDUMP("SAE: PMK2", sae2.pmk, SAE_PMK_LEN, ESP_LOG_INFO);
wpabuf_free2(buf1);
wpabuf_free2(buf2);
wpabuf_free2(buf3);
wpabuf_free2(buf4);
sae_clear_temp_data(&sae1);
sae_clear_temp_data(&sae2);
sae_clear_data(&sae1);
sae_clear_data(&sae2);
}
ESP_LOGI("SAE Test", "=========== Complete ============");
ESP_LOGI("SAE Test", "### SAE handshake negative testcase. ###");
{
/* SAE handshake failure when different passwords are used.*/
struct sae_data sae1; // STA1 data
struct sae_data sae2; // STA2 data
u8 addr1[ETH_ALEN] = {0xaa, 0xbb, 0xcc, 0xdd, 0xee, 0x11};
u8 addr2[ETH_ALEN] = {0x11, 0x22, 0x33, 0x44, 0x55, 0x66};
u8 pwd1[] = "abcd1234";
u8 pwd2[] = "wxyz5678";
memset(&sae1, 0, sizeof(sae1));
memset(&sae2, 0, sizeof(sae2));
struct wpabuf *buf1, *buf2, *buf3, *buf4;
int default_groups[] = { IANA_SECP256R1, 0 };
TEST_ASSERT(sae_set_group(&sae1, IANA_SECP256R1) == 0);
TEST_ASSERT(sae_set_group(&sae2, IANA_SECP256R1) == 0);
/* STA1 prepares for commit*/
TEST_ASSERT(sae_prepare_commit(addr1, addr2, pwd1, strlen((const char *)pwd1), NULL, &sae1) == 0);
/* STA2 prepares for commit*/
TEST_ASSERT(sae_prepare_commit(addr2, addr1, pwd2, strlen((const char *)pwd2), NULL, &sae2) == 0);
/* STA1 creates commit msg buffer*/
buf1 = wpabuf_alloc2(SAE_COMMIT_MAX_LEN);
TEST_ASSERT( buf1 != NULL);
sae_write_commit(&sae1, buf1, NULL, NULL);// No anti-clogging token
/* STA2 creates commit msg buffer*/
buf2 = wpabuf_alloc2(SAE_COMMIT_MAX_LEN);
TEST_ASSERT( buf2 != NULL);
sae_write_commit(&sae2, buf2, NULL, NULL);// No anti-clogging token
sae1.state = SAE_COMMITTED;
sae2.state = SAE_COMMITTED;
/* STA1 parses STA2 commit*/
TEST_ASSERT(sae_parse_commit(&sae1,
wpabuf_mhead(buf2), buf2->used, NULL, 0, default_groups) == 0);
/* STA2 parses STA1 commit*/
TEST_ASSERT(sae_parse_commit(&sae2,
wpabuf_mhead(buf1), buf1->used, NULL, 0, default_groups) == 0);
/* STA1 processes commit*/
TEST_ASSERT(sae_process_commit(&sae1) == 0);
/* STA2 processes commit*/
TEST_ASSERT(sae_process_commit(&sae2) == 0);
/* STA1 creates confirm msg buffer*/
buf3 = wpabuf_alloc2(SAE_COMMIT_MAX_LEN);
TEST_ASSERT( buf3 != NULL);
sae_write_confirm(&sae1, buf3);
/* STA2 creates confirm msg buffer*/
buf4 = wpabuf_alloc2(SAE_COMMIT_MAX_LEN);
TEST_ASSERT( buf3 != NULL);
sae_write_confirm(&sae2, buf4);
/* STA1 checks confirm from STA2 and the check fails*/
TEST_ASSERT(sae_check_confirm(&sae1, wpabuf_mhead(buf4), buf4->used) != 0);
/* STA2 checks confirm from STA1 and the check fails*/
TEST_ASSERT(sae_check_confirm(&sae2, wpabuf_mhead(buf3), buf3->used) != 0);
wpabuf_free2(buf1);
wpabuf_free2(buf2);
wpabuf_free2(buf3);
wpabuf_free2(buf4);
sae_clear_temp_data(&sae1);
sae_clear_temp_data(&sae2);
sae_clear_data(&sae1);
sae_clear_data(&sae2);
}
ESP_LOGI("SAE Test", "=========== Complete ============");
}
#endif /* CONFIG_WPA3_SAE */
|
the_stack_data/585331.c
|
#include <fcntl.h>
#include <string.h>
// @@@
#ifdef _MSC_VER
#include<efi.h>
#include<efilib.h>
#endif
// @@@
int __fmodeflags(const char *mode)
{
// @@@
#ifdef _MSC_VER
int flags = 0;
if (strchr(mode, '+')) flags = EFI_FILE_MODE_READ | EFI_FILE_MODE_WRITE;
else if (*mode == 'r') flags = EFI_FILE_MODE_READ;
else flags = EFI_FILE_MODE_WRITE;
if (*mode != 'r') flags |= EFI_FILE_MODE_WRITE;
return flags;
#else
// @@@
int flags;
if (strchr(mode, '+')) flags = O_RDWR;
else if (*mode == 'r') flags = O_RDONLY;
else flags = O_WRONLY;
if (strchr(mode, 'x')) flags |= O_EXCL;
if (strchr(mode, 'e')) flags |= O_CLOEXEC;
if (*mode != 'r') flags |= O_CREAT;
if (*mode == 'w') flags |= O_TRUNC;
if (*mode == 'a') flags |= O_APPEND;
return flags;
// @@@
#endif
// @@@
}
|
the_stack_data/65866.c
|
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
//@ #include <listex.gh>
int read_int()
//@ requires true;
//@ ensures true;
{
int x;
int scanf_result = scanf("%i", &x);
if (scanf_result < 1) abort();
return x;
}
char *read_line()
//@ requires true;
//@ ensures string(result, ?cs) &*& malloc_block_chars(result, length(cs) + 1);
{
char buffer[100];
int scanf_result = scanf(" %99[^\n]", buffer);
if (scanf_result < 1) abort();
//@ chars_separate_string(buffer);
char *result = strdup(buffer);
//@ chars_unseparate_string(buffer);
if (result == 0) abort();
return result;
}
//@ predicate student(char *name;) = string(name, ?cs) &*& malloc_block_chars(name, length(cs) + 1);
int main() //@ : main
//@ requires true;
//@ ensures true;
{
printf("How many students do you have? ");
int n = read_int();
if (n < 0 || 0x20000000 <= n) abort();
char **names = malloc(n * sizeof(char **));
if (names == 0) abort();
for (int i = 0; ; i++)
//@ requires names[i..n] |-> _;
//@ ensures names[old_i..n] |-> ?ps &*& foreachp(ps, student);
{
//@ open pointers(_, _, _);
if (i == n) {
break;
}
printf("Please enter the name of student number %d: ", i + 1);
char *name = read_line();
printf("Adding '%s'...\n", name);
names[i] = name;
}
for (;;)
//@ invariant names[0..n] |-> ?ps &*& foreachp(ps, student);
{
printf("Please enter a student number: ");
int k = read_int();
if (k < 1 || n < k) {
printf("Student number out of range. Terminating...\n");
break;
} else {
char *name = names[k - 1];
//@ foreachp_remove_nth(k - 1);
printf("Student number %d is called %s.\n", k, name);
//@ foreachp_unremove_nth(ps, k - 1);
}
}
for (int i = 0; ; i++)
//@ requires names[i..n] |-> ?ps &*& foreachp(ps, student);
//@ ensures names[old_i..n] |-> _;
{
//@ open pointers(_, _, _);
if (i == n) {
break;
}
//@ open foreachp(_, _);
//@ string_to_chars(names[i]);
free(names[i]);
}
free(names);
return 0;
}
|
the_stack_data/90764645.c
|
#include <stdio.h>
typedef struct student
{
char name[20];
int age;
int num;
} stu;
int main()
{
struct student stuArray[3];
for (int i=0; i < 3; i++)
{
scanf("%s %d %d", stuArray[i].name, &stuArray[i].age, &stuArray[i].num);
printf("OK! \n");
}
for (int i=0; i<3; i++)
{
printf("第 %d 学生的名字： %s 年龄： %d 学号： %d \n", i+1, stuArray[i].name, stuArray[i].age, stuArray[i].num);
}
return 0;
}
|
the_stack_data/9511994.c
|
/* Calculate sum of digits of a number.
Example:
INPUT: (12345)
SUM = (1+2+3+4+5)
OUTPUT: 15
*/
#include <stdio.h>
int main()
{
int n, t, sum = 0, remainder;
printf("Enter an integer\n");
scanf("%d", &n);
t = n;
while (t != 0)
{
remainder = t % 10;
sum = sum + remainder;
t = t / 10;
}
printf("Sum of digits of %d = %d\n", n, sum);
return 0;
}
|
the_stack_data/48574546.c
|
/*
* dblink_sqlite3.c
*
* Copyright (c) 2011-2020, NIPPON TELEGRAPH AND TELEPHONE CORPORATION
*/
#ifdef ENABLE_SQLITE3
#include "postgres.h"
#include "utils/memutils.h"
#include "lib/stringinfo.h"
#include "mb/pg_wchar.h"
#include "miscadmin.h"
#include "dblink.h"
#include "dblink_internal.h"
#include <sqlite3.h>
typedef struct sq3link_connection
{
dblink_connection base;
sqlite3 *db;
} sq3link_connection;
typedef struct sq3link_row
{
struct sq3link_row *next;
char *values[1];
} sq3link_row;
typedef struct sq3link_cursor
{
dblink_cursor base;
sq3link_row *head;
sq3link_row *iter;
} sq3link_cursor;
static sq3link_connection *sq3link_connection_new(sqlite3 *db);
static void sq3link_disconnect(sq3link_connection *conn);
static int64 sq3link_exec(sq3link_connection *conn, const char *sql);
static sq3link_cursor *sq3link_open(sq3link_connection *conn, const char *func, int32 fetchsize, int32 max_value_len);
static sq3link_cursor *sq3link_call(sq3link_connection *conn, const char *sql, int32 fetchsize, int32 max_value_len);
static bool sq3link_command(sq3link_connection *conn, dblink_command type);
static sq3link_cursor *sq3link_cursor_new(void);
static bool sq3link_fetch(sq3link_cursor *cur, const char *values[]);
static void sq3link_close(sq3link_cursor *cur);
static int sq3link_callback(void *userdata, int argc, char **argv, char **columns);
static void sq3link_error(sqlite3 *db, const char *message);
dblink_connection *
sq3link_connect(const char *location)
{
sqlite3 *db = NULL;
int rc;
rc = sqlite3_open(location, &db);
if (rc != 0)
{
if (db)
sqlite3_close(db);
dblink_error(ERRCODE_SQLCLIENT_UNABLE_TO_ESTABLISH_SQLCONNECTION,
"could not establish connection", location, NULL, NULL);
}
return (dblink_connection *) sq3link_connection_new(db);
}
static sq3link_connection *
sq3link_connection_new(sqlite3 *db)
{
sq3link_connection *p;
p = malloc(sizeof(sq3link_connection));
p->base.disconnect = (dblink_disconnect_t) sq3link_disconnect;
p->base.exec = (dblink_exec_t) sq3link_exec;
p->base.open = (dblink_open_t) sq3link_open;
p->base.call = (dblink_call_t) sq3link_call;
p->base.command = (dblink_command_t) sq3link_command;
p->db = db;
return p;
}
static void
sq3link_disconnect(sq3link_connection *conn)
{
if (conn->db)
sqlite3_close(conn->db);
free(conn);
}
static int64
sq3link_exec(sq3link_connection *conn, const char *sql)
{
char *sql_utf8;
char *message;
int rc;
int64 ntuples;
sql_utf8 = (char *) pg_do_encoding_conversion((unsigned char *) sql,
strlen(sql), GetDatabaseEncoding(), PG_UTF8);
rc = sqlite3_exec(conn->db, sql_utf8, NULL, NULL, &message);
switch (rc)
{
case SQLITE_OK:
ntuples = sqlite3_changes(conn->db);
break;
default:
sq3link_error(conn->db, message);
return 0; /* keep compiler quiet */
}
return ntuples;
}
static sq3link_cursor *
sq3link_open(sq3link_connection *conn, const char *sql, int32 fetchsize, int32 max_value_len)
{
sq3link_cursor *cur;
char *sql_utf8;
char *message;
int rc;
cur = sq3link_cursor_new();
sql_utf8 = (char *) pg_do_encoding_conversion((unsigned char *) sql,
strlen(sql), GetDatabaseEncoding(), PG_UTF8);
rc = sqlite3_exec(conn->db, sql_utf8, sq3link_callback, cur, &message);
if (rc == SQLITE_OK)
{
cur->iter = cur->head;
return cur;
}
sq3link_close(cur);
sq3link_error(conn->db, message);
return NULL; /* keep compiler quiet */
}
static sq3link_cursor *
sq3link_call(sq3link_connection *conn, const char *func, int32 fetchsize, int32 max_value_len)
{
StringInfoData sql;
initStringInfo(&sql);
appendStringInfoString(&sql, "SELECT ");
appendStringInfoString(&sql, func);
return sq3link_open(conn, sql.data, fetchsize, max_value_len);
}
static bool
sq3link_command(sq3link_connection *conn, dblink_command type)
{
const char *sql;
int rc;
char *message;
/* SQLite3 doesn't support 2PC. */
switch (type)
{
case DBLINK_BEGIN:
case DBLINK_XA_START:
sql = "BEGIN";
break;
case DBLINK_COMMIT:
case DBLINK_XA_PREPARE:
sql = "COMMIT";
break;
case DBLINK_ROLLBACK:
sql = "ROLLBACK";
break;
case DBLINK_XA_COMMIT:
return true;
case DBLINK_XA_ROLLBACK:
default:
return false;
}
rc = sqlite3_exec(conn->db, sql, NULL, NULL, &message);
return rc == SQLITE_OK;
}
static sq3link_cursor *
sq3link_cursor_new(void)
{
MemoryContext old_context;
sq3link_cursor *p;
old_context = MemoryContextSwitchTo(TopTransactionContext);
p = palloc(sizeof(sq3link_cursor));
p->base.fetch = (dblink_fetch_t) sq3link_fetch;
p->base.close = (dblink_close_t) sq3link_close;
p->base.nfields = 0;
p->head = p->iter = NULL;
MemoryContextSwitchTo(old_context);
return p;
}
static bool
sq3link_fetch(sq3link_cursor *cur, const char *values[])
{
if (cur->iter == NULL)
return false;
memcpy(values, cur->iter->values, sizeof(char * ) * cur->base.nfields);
cur->iter = cur->iter->next;
return true;
}
static void
sq3link_close(sq3link_cursor *cur)
{
sq3link_row *i = cur->head;
while (i != NULL)
{
int c;
sq3link_row *prev;
for (c = 0; c < cur->base.nfields; c++)
if (i->values[c])
pfree(i->values[c]);
prev = i;
i = i->next;
pfree(prev);
}
pfree(cur);
}
static char *
strdup_utf8(const char *utf8)
{
if (utf8 == NULL)
return NULL;
else if (GetDatabaseEncoding() == PG_UTF8)
return pstrdup(utf8);
else
{
elog(WARNING, "sq3link: non-utf8 encoding is not supported");
return pstrdup(utf8);
}
}
static int
sq3link_callback(void *userdata, int argc, char **argv, char **columns)
{
sq3link_cursor *cur = (sq3link_cursor *) userdata;
sq3link_row *row;
int i;
MemoryContext old_context;
/* CHECK_FOR_INTERRUPTS */
#ifdef WIN32
if (UNBLOCKED_SIGNAL_QUEUE())
pgwin32_dispatch_queued_signals();
#endif
if (InterruptPending)
return SQLITE_ABORT;
old_context = MemoryContextSwitchTo(TopTransactionContext);
row = palloc(offsetof(sq3link_row, values) + sizeof(char * ) * argc);
row->next = NULL;
for (i = 0; i < argc; i++)
row->values[i] = strdup_utf8(argv[i]);
MemoryContextSwitchTo(old_context);
cur->base.nfields = argc;
if (cur->iter)
{
cur->iter->next = row;
cur->iter = row;
}
else
{
cur->head = cur->iter = row;
}
return SQLITE_OK;
}
static void
sq3link_error(sqlite3 *db, const char *message)
{
int code = sqlite3_errcode(db);
int sqlstate;
switch (code)
{
case SQLITE_ERROR: /* SQL error or missing database */
sqlstate = ERRCODE_CONNECTION_EXCEPTION;
break;
case SQLITE_INTERNAL: /* Internal logic error in SQLite */
sqlstate = ERRCODE_INTERNAL_ERROR;
break;
case SQLITE_PERM: /* Access permission denied */
case SQLITE_ABORT: /* Callback routine requested an abort */
case SQLITE_BUSY: /* The database file is locked */
case SQLITE_LOCKED: /* A table in the database is locked */
case SQLITE_NOMEM: /* A malloc() failed */
case SQLITE_READONLY: /* Attempt to write a readonly database */
case SQLITE_INTERRUPT: /* Operation terminated by sqlite3_interrupt()*/
case SQLITE_IOERR: /* Some kind of disk I/O error occurred */
case SQLITE_CORRUPT: /* The database disk image is malformed */
case SQLITE_NOTFOUND: /* NOT USED. Table or record not found */
case SQLITE_FULL: /* Insertion failed because database is full */
case SQLITE_CANTOPEN: /* Unable to open the database file */
case SQLITE_PROTOCOL: /* NOT USED. Database lock protocol error */
case SQLITE_EMPTY: /* Database is empty */
case SQLITE_SCHEMA: /* The database schema changed */
case SQLITE_TOOBIG: /* String or BLOB exceeds size limit */
case SQLITE_CONSTRAINT: /* Abort due to constraint violation */
case SQLITE_MISMATCH: /* Data type mismatch */
case SQLITE_MISUSE: /* Library used incorrectly */
case SQLITE_NOLFS: /* Uses OS features not supported on host */
case SQLITE_AUTH: /* Authorization denied */
case SQLITE_FORMAT: /* Auxiliary database format error */
case SQLITE_RANGE: /* 2nd parameter to sqlite3_bind out of range */
case SQLITE_NOTADB: /* File opened that is not a database file */
case SQLITE_ROW: /* sqlite3_step() has another row ready */
case SQLITE_DONE: /* sqlite3_step() has finished executing */
default:
sqlstate = ERRCODE_EXTERNAL_ROUTINE_EXCEPTION;
break;
}
dblink_error(sqlstate, message, NULL, NULL, NULL);
}
#endif
|
the_stack_data/1072431.c
|
// KMSAN: uninit-value in hidraw_ioctl
// https://syzkaller.appspot.com/bug?id=7739ea2b2e4cafe10110612c6b330c25986d2f60
// status:invalid
// autogenerated by syzkaller (https://github.com/google/syzkaller)
#define _GNU_SOURCE
#include <dirent.h>
#include <endian.h>
#include <errno.h>
#include <fcntl.h>
#include <signal.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/mount.h>
#include <sys/prctl.h>
#include <sys/stat.h>
#include <sys/syscall.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <time.h>
#include <unistd.h>
#include <linux/usb/ch9.h>
unsigned long long procid;
static void sleep_ms(uint64_t ms)
{
usleep(ms * 1000);
}
static uint64_t current_time_ms(void)
{
struct timespec ts;
if (clock_gettime(CLOCK_MONOTONIC, &ts))
exit(1);
return (uint64_t)ts.tv_sec * 1000 + (uint64_t)ts.tv_nsec / 1000000;
}
static bool write_file(const char* file, const char* what, ...)
{
char buf[1024];
va_list args;
va_start(args, what);
vsnprintf(buf, sizeof(buf), what, args);
va_end(args);
buf[sizeof(buf) - 1] = 0;
int len = strlen(buf);
int fd = open(file, O_WRONLY | O_CLOEXEC);
if (fd == -1)
return false;
if (write(fd, buf, len) != len) {
int err = errno;
close(fd);
errno = err;
return false;
}
close(fd);
return true;
}
#define USB_DEBUG 0
#define USB_MAX_IFACE_NUM 4
#define USB_MAX_EP_NUM 32
struct usb_iface_index {
struct usb_interface_descriptor* iface;
struct usb_endpoint_descriptor* eps[USB_MAX_EP_NUM];
unsigned eps_num;
};
struct usb_device_index {
struct usb_device_descriptor* dev;
struct usb_config_descriptor* config;
unsigned config_length;
struct usb_iface_index ifaces[USB_MAX_IFACE_NUM];
unsigned ifaces_num;
};
static bool parse_usb_descriptor(char* buffer, size_t length,
struct usb_device_index* index)
{
if (length < sizeof(*index->dev) + sizeof(*index->config))
return false;
memset(index, 0, sizeof(*index));
index->dev = (struct usb_device_descriptor*)buffer;
index->config = (struct usb_config_descriptor*)(buffer + sizeof(*index->dev));
index->config_length = length - sizeof(*index->dev);
size_t offset = 0;
while (true) {
if (offset + 1 >= length)
break;
uint8_t desc_length = buffer[offset];
uint8_t desc_type = buffer[offset + 1];
if (desc_length <= 2)
break;
if (offset + desc_length > length)
break;
if (desc_type == USB_DT_INTERFACE &&
index->ifaces_num < USB_MAX_IFACE_NUM) {
struct usb_interface_descriptor* iface =
(struct usb_interface_descriptor*)(buffer + offset);
index->ifaces[index->ifaces_num++].iface = iface;
}
if (desc_type == USB_DT_ENDPOINT && index->ifaces_num > 0) {
struct usb_iface_index* iface = &index->ifaces[index->ifaces_num - 1];
if (iface->eps_num < USB_MAX_EP_NUM)
iface->eps[iface->eps_num++] =
(struct usb_endpoint_descriptor*)(buffer + offset);
}
offset += desc_length;
}
return true;
}
enum usb_fuzzer_event_type {
USB_FUZZER_EVENT_INVALID,
USB_FUZZER_EVENT_CONNECT,
USB_FUZZER_EVENT_DISCONNECT,
USB_FUZZER_EVENT_SUSPEND,
USB_FUZZER_EVENT_RESUME,
USB_FUZZER_EVENT_CONTROL,
};
struct usb_fuzzer_event {
uint32_t type;
uint32_t length;
char data[0];
};
struct usb_fuzzer_init {
uint64_t speed;
const char* driver_name;
const char* device_name;
};
struct usb_fuzzer_ep_io {
uint16_t ep;
uint16_t flags;
uint32_t length;
char data[0];
};
#define USB_FUZZER_IOCTL_INIT _IOW('U', 0, struct usb_fuzzer_init)
#define USB_FUZZER_IOCTL_RUN _IO('U', 1)
#define USB_FUZZER_IOCTL_EVENT_FETCH _IOR('U', 2, struct usb_fuzzer_event)
#define USB_FUZZER_IOCTL_EP0_WRITE _IOW('U', 3, struct usb_fuzzer_ep_io)
#define USB_FUZZER_IOCTL_EP0_READ _IOWR('U', 4, struct usb_fuzzer_ep_io)
#define USB_FUZZER_IOCTL_EP_ENABLE _IOW('U', 5, struct usb_endpoint_descriptor)
#define USB_FUZZER_IOCTL_EP_WRITE _IOW('U', 7, struct usb_fuzzer_ep_io)
#define USB_FUZZER_IOCTL_EP_READ _IOWR('U', 8, struct usb_fuzzer_ep_io)
#define USB_FUZZER_IOCTL_CONFIGURE _IO('U', 9)
#define USB_FUZZER_IOCTL_VBUS_DRAW _IOW('U', 10, uint32_t)
int usb_fuzzer_open()
{
return open("/sys/kernel/debug/usb-fuzzer", O_RDWR);
}
int usb_fuzzer_init(int fd, uint32_t speed, const char* driver,
const char* device)
{
struct usb_fuzzer_init arg;
arg.speed = speed;
arg.driver_name = driver;
arg.device_name = device;
return ioctl(fd, USB_FUZZER_IOCTL_INIT, &arg);
}
int usb_fuzzer_run(int fd)
{
return ioctl(fd, USB_FUZZER_IOCTL_RUN, 0);
}
int usb_fuzzer_event_fetch(int fd, struct usb_fuzzer_event* event)
{
return ioctl(fd, USB_FUZZER_IOCTL_EVENT_FETCH, event);
}
int usb_fuzzer_ep0_write(int fd, struct usb_fuzzer_ep_io* io)
{
return ioctl(fd, USB_FUZZER_IOCTL_EP0_WRITE, io);
}
int usb_fuzzer_ep0_read(int fd, struct usb_fuzzer_ep_io* io)
{
return ioctl(fd, USB_FUZZER_IOCTL_EP0_READ, io);
}
int usb_fuzzer_ep_write(int fd, struct usb_fuzzer_ep_io* io)
{
return ioctl(fd, USB_FUZZER_IOCTL_EP_WRITE, io);
}
int usb_fuzzer_ep_read(int fd, struct usb_fuzzer_ep_io* io)
{
return ioctl(fd, USB_FUZZER_IOCTL_EP_READ, io);
}
int usb_fuzzer_ep_enable(int fd, struct usb_endpoint_descriptor* desc)
{
return ioctl(fd, USB_FUZZER_IOCTL_EP_ENABLE, desc);
}
int usb_fuzzer_configure(int fd)
{
return ioctl(fd, USB_FUZZER_IOCTL_CONFIGURE, 0);
}
int usb_fuzzer_vbus_draw(int fd, uint32_t power)
{
return ioctl(fd, USB_FUZZER_IOCTL_VBUS_DRAW, power);
}
#define USB_MAX_PACKET_SIZE 1024
struct usb_fuzzer_control_event {
struct usb_fuzzer_event inner;
struct usb_ctrlrequest ctrl;
char data[USB_MAX_PACKET_SIZE];
};
struct usb_fuzzer_ep_io_data {
struct usb_fuzzer_ep_io inner;
char data[USB_MAX_PACKET_SIZE];
};
struct vusb_connect_string_descriptor {
uint32_t len;
char* str;
} __attribute__((packed));
struct vusb_connect_descriptors {
uint32_t qual_len;
char* qual;
uint32_t bos_len;
char* bos;
uint32_t strs_len;
struct vusb_connect_string_descriptor strs[0];
} __attribute__((packed));
static const char default_string[] = {8, USB_DT_STRING, 's', 0, 'y', 0, 'z', 0};
static const char default_lang_id[] = {4, USB_DT_STRING, 0x09, 0x04};
static bool lookup_connect_response(struct vusb_connect_descriptors* descs,
struct usb_device_index* index,
struct usb_ctrlrequest* ctrl,
char** response_data,
uint32_t* response_length)
{
uint8_t str_idx;
switch (ctrl->bRequestType & USB_TYPE_MASK) {
case USB_TYPE_STANDARD:
switch (ctrl->bRequest) {
case USB_REQ_GET_DESCRIPTOR:
switch (ctrl->wValue >> 8) {
case USB_DT_DEVICE:
*response_data = (char*)index->dev;
*response_length = sizeof(*index->dev);
return true;
case USB_DT_CONFIG:
*response_data = (char*)index->config;
*response_length = index->config_length;
return true;
case USB_DT_STRING:
str_idx = (uint8_t)ctrl->wValue;
if (descs && str_idx < descs->strs_len) {
*response_data = descs->strs[str_idx].str;
*response_length = descs->strs[str_idx].len;
return true;
}
if (str_idx == 0) {
*response_data = (char*)&default_lang_id[0];
*response_length = default_lang_id[0];
return true;
}
*response_data = (char*)&default_string[0];
*response_length = default_string[0];
return true;
case USB_DT_BOS:
*response_data = descs->bos;
*response_length = descs->bos_len;
return true;
case USB_DT_DEVICE_QUALIFIER:
if (!descs->qual) {
struct usb_qualifier_descriptor* qual =
(struct usb_qualifier_descriptor*)response_data;
qual->bLength = sizeof(*qual);
qual->bDescriptorType = USB_DT_DEVICE_QUALIFIER;
qual->bcdUSB = index->dev->bcdUSB;
qual->bDeviceClass = index->dev->bDeviceClass;
qual->bDeviceSubClass = index->dev->bDeviceSubClass;
qual->bDeviceProtocol = index->dev->bDeviceProtocol;
qual->bMaxPacketSize0 = index->dev->bMaxPacketSize0;
qual->bNumConfigurations = index->dev->bNumConfigurations;
qual->bRESERVED = 0;
*response_length = sizeof(*qual);
return true;
}
*response_data = descs->qual;
*response_length = descs->qual_len;
return true;
default:
exit(1);
return false;
}
break;
default:
exit(1);
return false;
}
break;
default:
exit(1);
return false;
}
return false;
}
static volatile long syz_usb_connect(volatile long a0, volatile long a1,
volatile long a2, volatile long a3)
{
uint64_t speed = a0;
uint64_t dev_len = a1;
char* dev = (char*)a2;
struct vusb_connect_descriptors* descs = (struct vusb_connect_descriptors*)a3;
if (!dev) {
return -1;
}
struct usb_device_index index;
memset(&index, 0, sizeof(index));
int rv = 0;
rv = parse_usb_descriptor(dev, dev_len, &index);
if (!rv) {
return rv;
}
int fd = usb_fuzzer_open();
if (fd < 0) {
return fd;
}
char device[32];
sprintf(&device[0], "dummy_udc.%llu", procid);
rv = usb_fuzzer_init(fd, speed, "dummy_udc", &device[0]);
if (rv < 0) {
return rv;
}
rv = usb_fuzzer_run(fd);
if (rv < 0) {
return rv;
}
bool done = false;
while (!done) {
struct usb_fuzzer_control_event event;
event.inner.type = 0;
event.inner.length = sizeof(event.ctrl);
rv = usb_fuzzer_event_fetch(fd, (struct usb_fuzzer_event*)&event);
if (rv < 0) {
return rv;
}
if (event.inner.type != USB_FUZZER_EVENT_CONTROL)
continue;
bool response_found = false;
char* response_data = NULL;
uint32_t response_length = 0;
if (event.ctrl.bRequestType & USB_DIR_IN) {
response_found = lookup_connect_response(
descs, &index, &event.ctrl, &response_data, &response_length);
if (!response_found) {
return -1;
}
} else {
if ((event.ctrl.bRequestType & USB_TYPE_MASK) != USB_TYPE_STANDARD ||
event.ctrl.bRequest != USB_REQ_SET_CONFIGURATION) {
exit(1);
return -1;
}
done = true;
}
if (done) {
rv = usb_fuzzer_vbus_draw(fd, index.config->bMaxPower);
if (rv < 0) {
return rv;
}
rv = usb_fuzzer_configure(fd);
if (rv < 0) {
return rv;
}
unsigned ep;
for (ep = 0; ep < index.ifaces[0].eps_num; ep++) {
rv = usb_fuzzer_ep_enable(fd, index.ifaces[0].eps[ep]);
if (rv < 0) {
} else {
}
}
}
struct usb_fuzzer_ep_io_data response;
response.inner.ep = 0;
response.inner.flags = 0;
if (response_length > sizeof(response.data))
response_length = 0;
if (event.ctrl.wLength < response_length)
response_length = event.ctrl.wLength;
response.inner.length = response_length;
if (response_data)
memcpy(&response.data[0], response_data, response_length);
else
memset(&response.data[0], 0, response_length);
if (event.ctrl.bRequestType & USB_DIR_IN) {
rv = usb_fuzzer_ep0_write(fd, (struct usb_fuzzer_ep_io*)&response);
} else {
rv = usb_fuzzer_ep0_read(fd, (struct usb_fuzzer_ep_io*)&response);
}
if (rv < 0) {
return rv;
}
}
sleep_ms(200);
return fd;
}
struct vusb_descriptor {
uint8_t req_type;
uint8_t desc_type;
uint32_t len;
char data[0];
} __attribute__((packed));
struct vusb_descriptors {
uint32_t len;
struct vusb_descriptor* generic;
struct vusb_descriptor* descs[0];
} __attribute__((packed));
struct vusb_response {
uint8_t type;
uint8_t req;
uint32_t len;
char data[0];
} __attribute__((packed));
struct vusb_responses {
uint32_t len;
struct vusb_response* generic;
struct vusb_response* resps[0];
} __attribute__((packed));
static bool lookup_control_response(struct vusb_descriptors* descs,
struct vusb_responses* resps,
struct usb_ctrlrequest* ctrl,
char** response_data,
uint32_t* response_length)
{
int descs_num = 0;
int resps_num = 0;
if (descs)
descs_num = (descs->len - offsetof(struct vusb_descriptors, descs)) /
sizeof(descs->descs[0]);
if (resps)
resps_num = (resps->len - offsetof(struct vusb_responses, resps)) /
sizeof(resps->resps[0]);
uint8_t req = ctrl->bRequest;
uint8_t req_type = ctrl->bRequestType & USB_TYPE_MASK;
uint8_t desc_type = ctrl->wValue >> 8;
if (req == USB_REQ_GET_DESCRIPTOR) {
int i;
for (i = 0; i < descs_num; i++) {
struct vusb_descriptor* desc = descs->descs[i];
if (!desc)
continue;
if (desc->req_type == req_type && desc->desc_type == desc_type) {
*response_length = desc->len;
if (*response_length != 0)
*response_data = &desc->data[0];
else
*response_data = NULL;
return true;
}
}
if (descs && descs->generic) {
*response_data = &descs->generic->data[0];
*response_length = descs->generic->len;
return true;
}
} else {
int i;
for (i = 0; i < resps_num; i++) {
struct vusb_response* resp = resps->resps[i];
if (!resp)
continue;
if (resp->type == req_type && resp->req == req) {
*response_length = resp->len;
if (*response_length != 0)
*response_data = &resp->data[0];
else
*response_data = NULL;
return true;
}
}
if (resps && resps->generic) {
*response_data = &resps->generic->data[0];
*response_length = resps->generic->len;
return true;
}
}
return false;
}
static volatile long syz_usb_control_io(volatile long a0, volatile long a1,
volatile long a2)
{
int fd = a0;
struct vusb_descriptors* descs = (struct vusb_descriptors*)a1;
struct vusb_responses* resps = (struct vusb_responses*)a2;
struct usb_fuzzer_control_event event;
event.inner.type = 0;
event.inner.length = USB_MAX_PACKET_SIZE;
int rv = usb_fuzzer_event_fetch(fd, (struct usb_fuzzer_event*)&event);
if (rv < 0) {
return rv;
}
if (event.inner.type != USB_FUZZER_EVENT_CONTROL) {
return -1;
}
bool response_found = false;
char* response_data = NULL;
uint32_t response_length = 0;
if ((event.ctrl.bRequestType & USB_DIR_IN) && event.ctrl.wLength) {
response_found = lookup_control_response(descs, resps, &event.ctrl,
&response_data, &response_length);
if (!response_found) {
return -1;
}
} else {
response_length = event.ctrl.wLength;
}
struct usb_fuzzer_ep_io_data response;
response.inner.ep = 0;
response.inner.flags = 0;
if (response_length > sizeof(response.data))
response_length = 0;
if (event.ctrl.wLength < response_length)
response_length = event.ctrl.wLength;
if ((event.ctrl.bRequestType & USB_DIR_IN) && !event.ctrl.wLength) {
response_length = USB_MAX_PACKET_SIZE;
}
response.inner.length = response_length;
if (response_data)
memcpy(&response.data[0], response_data, response_length);
else
memset(&response.data[0], 0, response_length);
if ((event.ctrl.bRequestType & USB_DIR_IN) && event.ctrl.wLength) {
rv = usb_fuzzer_ep0_write(fd, (struct usb_fuzzer_ep_io*)&response);
} else {
rv = usb_fuzzer_ep0_read(fd, (struct usb_fuzzer_ep_io*)&response);
}
if (rv < 0) {
return rv;
}
sleep_ms(200);
return 0;
}
static long syz_open_dev(volatile long a0, volatile long a1, volatile long a2)
{
if (a0 == 0xc || a0 == 0xb) {
char buf[128];
sprintf(buf, "/dev/%s/%d:%d", a0 == 0xc ? "char" : "block", (uint8_t)a1,
(uint8_t)a2);
return open(buf, O_RDWR, 0);
} else {
char buf[1024];
char* hash;
strncpy(buf, (char*)a0, sizeof(buf) - 1);
buf[sizeof(buf) - 1] = 0;
while ((hash = strchr(buf, '#'))) {
*hash = '0' + (char)(a1 % 10);
a1 /= 10;
}
return open(buf, a2, 0);
}
}
static void kill_and_wait(int pid, int* status)
{
kill(-pid, SIGKILL);
kill(pid, SIGKILL);
int i;
for (i = 0; i < 100; i++) {
if (waitpid(-1, status, WNOHANG | __WALL) == pid)
return;
usleep(1000);
}
DIR* dir = opendir("/sys/fs/fuse/connections");
if (dir) {
for (;;) {
struct dirent* ent = readdir(dir);
if (!ent)
break;
if (strcmp(ent->d_name, ".") == 0 || strcmp(ent->d_name, "..") == 0)
continue;
char abort[300];
snprintf(abort, sizeof(abort), "/sys/fs/fuse/connections/%s/abort",
ent->d_name);
int fd = open(abort, O_WRONLY);
if (fd == -1) {
continue;
}
if (write(fd, abort, 1) < 0) {
}
close(fd);
}
closedir(dir);
} else {
}
while (waitpid(-1, status, __WALL) != pid) {
}
}
static void setup_test()
{
prctl(PR_SET_PDEATHSIG, SIGKILL, 0, 0, 0);
setpgrp();
write_file("/proc/self/oom_score_adj", "1000");
}
static void execute_one(void);
#define WAIT_FLAGS __WALL
static void loop(void)
{
int iter;
for (iter = 0;; iter++) {
int pid = fork();
if (pid < 0)
exit(1);
if (pid == 0) {
setup_test();
execute_one();
exit(0);
}
int status = 0;
uint64_t start = current_time_ms();
for (;;) {
if (waitpid(-1, &status, WNOHANG | WAIT_FLAGS) == pid)
break;
sleep_ms(1);
if (current_time_ms() - start < 5 * 1000)
continue;
kill_and_wait(pid, &status);
break;
}
}
}
uint64_t r[2] = {0xffffffffffffffff, 0xffffffffffffffff};
void execute_one(void)
{
intptr_t res = 0;
memcpy((void*)0x20000140,
"\x12\x01\x00\x00\x00\x00\x00\x20\x6d\x04\x1c\xc7\x40\x00\x00\x00\x00"
"\x01\x09\x02\x24\x00\x01\x00\x00\xa0\x00\x09\x04\x00\x00\x09\x03\x01"
"\x01\x00\x09\x21\x00\x00\x00\x01\x22\x15\x00\x09\x05\x81\x03\x00\x00"
"\x00\x00\x00\xee\xb4\x88\x8f\xff\xfc\x1f\xe0\x2d\xa3\x65\xa9\xc4\xce"
"\xfe\x8b\x90\x61\x70\x1c\x3c\xcd\x35\x2d\x15\x83\x70\x3e\xe6\xa2\xce"
"\x0b\x65\xf5\x4a\x55\x25\xda\xaa\xfd\xc4\x9f\x59\x66\xf9\x00\x63\x4c"
"\x11\xc5\x62\x10\x23\x5d\xca\x74\xb0\x5a\xbe\x3b\x46\xe5\xb6\x48\x2b"
"\x05\x00\xe1\x8c\x4a\x00\x00\x00\x00\x9c\xc7\x04\xcc\x79\x15\x55\x97"
"\x94\x80\x5a\x7a\xb1\x3d\x44\x84\x90\xdb\xac\xf2\x68\xac\x24\x72\x3a"
"\xcf\x3c\xa4\x84\xb1\xb7\x39\xb7\xf9\xb8\x36\xbd\xe4\x66\xbe\x4d\x32"
"\x35\x99\x80\x1b\x61\xa4\xa4\xfd\x48\x44\xf9\xeb\xc1\xd2\xc0\x99\xd1"
"\x74\x7d\x8a\x91\xb7\x62\xf8\x21\x02\x49\x1b\x72\x36\x20\xa3\xb8\x27"
"\x0a\x84\x5f\xf9\xf1\x09\x00\x00\x00\x00\x00\x00\x00\x64\xe0\x73\x61"
"\x9b\x76\x05\xc4\x6f\xe4\x0f\xa7\xc3\xf5\x04\xd8\xc8\xea\x34\xf3\xb2"
"\x2e\x92\x00",
241);
res = syz_usb_connect(0, 0x36, 0x20000140, 0);
if (res != -1)
r[0] = res;
syscall(__NR_write, -1, 0, 0);
syz_usb_control_io(r[0], 0, 0);
*(uint32_t*)0x20000040 = 0x24;
*(uint64_t*)0x20000044 = 0;
*(uint64_t*)0x2000004c = 0;
*(uint64_t*)0x20000054 = 0;
*(uint64_t*)0x2000005c = 0x20000380;
memcpy((void*)0x20000380,
"\x00\x22\x15\x00\x00\x00\x8e\x03\xdd\x03\x4f\x4e\x37\x85\x15\xe0\x81",
17);
syz_usb_control_io(r[0], 0x20000040, 0);
memcpy((void*)0x20000000, "/dev/hidraw#\000", 13);
res = syz_open_dev(0x20000000, 0, 0);
if (res != -1)
r[1] = res;
syscall(__NR_ioctl, r[1], 0xc0404807, 0);
syscall(__NR_ioctl, r[1], 0x80404804, 0);
}
int main(void)
{
syscall(__NR_mmap, 0x20000000, 0x1000000, 3, 0x32, -1, 0);
for (procid = 0; procid < 6; procid++) {
if (fork() == 0) {
loop();
}
}
sleep(1000000);
return 0;
}
|
the_stack_data/1055377.c
|
#include <stdio.h>
#include <stdlib.h>
#define MAX 1000001
typedef struct Stack{
int stack_arr[MAX];
int size;
}Stack;
int empty(Stack *s)
{
return s->size==0;
}
int top(Stack *s)
{
return s->stack_arr[s->size-1];
}
void push(Stack *s, int num)
{
s->stack_arr[s->size++]=num;
}
int pop(Stack *s)
{
return s->stack_arr[--s->size];
}
int main(void)
{
Stack* stack = (Stack *)malloc(sizeof(Stack));
int N;
scanf("%d",&N);
int arr[N];
int ans[N];
for(int i=0;i<N;i++)
{
scanf("%d", &arr[i]);
ans[i]=-1;
}
for(int i=0;i<N;i++)
{
while(!empty(stack) && arr[top(stack)] < arr[i])
ans[pop(stack)] = arr[i];
push(stack, i);
}
for(int i=0;i<N;i++)
printf("%d ", ans[i]);
return 0;
}
|
the_stack_data/528620.c
|
#include <stdio.h>
int main()
{
int n, i, numero, soma;
printf("quantidade de numeros: ");
scanf("%d", &n);
soma = 0;
for (i=0; i<n; i++) {
printf("digite o %dº valor: ", i);
scanf("%d", &numero);
soma = soma + numero;
}
printf("valor da soma: %d", soma);
return 0;
}
|
the_stack_data/32949873.c
|
/**
* Basic server created using socket programming
*/
|
the_stack_data/165764790.c
|
#include<stdio.h>
int main()
{
int row,column,space,in,n,k,M_loop;
printf("Enter the value of N: ");
scanf("%d",&n);
k=n;
for(row=1;row<=n;row++)
{
for(column=1;column<=row;column++)
{
printf("*");
}
printf("\n");
}
for(M_loop=1;M_loop<=n-1;M_loop++)
{
for(row=1;row<=n;row++)
{
for(space=1;space<=k;space++)
{
printf("_");
}
for(column=1;column<=row;column++)
{
printf("*");
}
printf("\n");
}
k=k+n;
}
return 0;
}
|
the_stack_data/87073.c
|
int quadratic_c(int x, int a, int b, int c) {
int r;
r = (a * x * x) + (b * x) + c;
return r;
}
|
the_stack_data/28831.c
|
//@ #include "nat.gh"
/*@
lemma void induction(nat n1, nat n2, nat n3)
requires true;
ensures true;
{
switch(n1)
{
case succ(n10):
switch(n2)
{
case succ(n20):
switch(n3)
{
case succ(n30):
induction(n1, n2, n3); //~
case zero:
}
case zero:
}
case zero:
}
}
@*/
|
the_stack_data/165765418.c
|
#include <stdio.h>
#include <ctype.h>
#define IN 1
#define OUT 0
main() {
int c, nl, nw, nc, state;
state = OUT;
nl = nw = nc = 0;
while ((c = getchar()) != EOF) {
++nc;
if (c == '\n')
++nl;
if (isspace(c))
state = OUT;
else if (state == OUT) {
state = IN;
++nw;
}
}
printf("%d %d %d\n", nl, nw, nc);
}
|
the_stack_data/168892435.c
|
#include <stdio.h>
#include <math.h>
int main() {
double r, n;
while(scanf("%lf %lf", &r, &n) == 2) {
printf("%.3lf\n", n*r*r*sin(2*acos(-1)/n)/2);
}
return 0;
}
|
the_stack_data/31388943.c
|
#include<stdio.h>
#include<stdlib.h>
#define SIZE 5
#define TRUE 1
#define FALSE 0
struct stack {
int TOP;
int Item[SIZE];
};
struct stack S;
void Initalize(void) {
S.TOP = -1;
}
int Empty(void) {
if (S.TOP == -1)
return TRUE;
else
return FALSE;
}
void Push(int x) {
if (S.TOP == SIZE - 1) {
printf("stack overflow");
exit(1);
}
S.TOP = S.TOP + 1;
S.Item[S.TOP] = x;
printf("\n%d was pushed into the stack.", x);
}
int Pop() {
int x;
if (Empty()) {
printf("stack underflow");
exit(1);
}
x = S.Item[S.TOP];
S.TOP = S.TOP - 1;
return x;
}
void main() {
Initalize();
int x;
Push(100);
Push(200);
Push(300);
Push(400);
Push(500);
x = Pop();
printf("\n%d was popped from the stack.", x);
x = Pop();
printf("\n%d was popped from the stack.", x);
x = Pop();
printf("\n%d was popped from the stack.", x);
}
|
the_stack_data/40273.c
|
/* Testing Code */
#include <limits.h>
#include <math.h>
/* Copyright (C) 1991-2014 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C 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 the GNU C Library; if not, see
<http://www.gnu.org/licenses/>. */
/* This header is separate from features.h so that the compiler can
include it implicitly at the start of every compilation. It must
not itself include <features.h> or any other header that includes
<features.h> because the implicit include comes before any feature
test macros that may be defined in a source file before it first
explicitly includes a system header. GCC knows the name of this
header in order to preinclude it. */
/* glibc's intent is to support the IEC 559 math functionality, real
and complex. If the GCC (4.9 and later) predefined macros
specifying compiler intent are available, use them to determine
whether the overall intent is to support these features; otherwise,
presume an older compiler has intent to support these features and
define these macros by default. */
/* wchar_t uses ISO/IEC 10646 (2nd ed., published 2011-03-15) /
Unicode 6.0. */
/* We do not support C11 <threads.h>. */
int test_bit_and(int x, int y) {
return x&y;
}
int test_negate(int x) {
return -x;
}
int test_is_equal(int x, int y) {
return x == y;
}
int test_div_pwr_2(int x, int n) {
int p2n = 1<<n;
return x/p2n;
}
int test_conditional(int x, int y, int z) {
return x?y:z;
}
int test_replaceByte(int x, int n, int c)
{
switch(n) {
case 0:
x = (x & 0xFFFFFF00) | c;
break;
case 1:
x = (x & 0xFFFF00FF) | (c << 8);
break;
case 2:
x = (x & 0xFF00FFFF) | (c << 16);
break;
default:
x = (x & 0x00FFFFFF) | (c << 24);
break;
}
return x;
}
int test_add_ok(int x, int y)
{
long long lsum = (long long) x + y;
return lsum == (int) lsum;
}
int test_abs_val(int x) {
return (x < 0) ? -x : x;
}
int test_bang(int x) {
return !x;
}
|
the_stack_data/67535.c
|
/* PPM to SV image converter */
/* assume 128x128 4bpp GRgB D0-3 */
/* (C)2021 Carlos J. Santisteban */
/* last modified 20210903-0031 */
#include <stdio.h>
int main(void) {
FILE* f;
FILE* o;
unsigned int r, g, gh, gl, b, s;
unsigned char c;
char nombre[80];
/* ask for filename and open files */
printf("File: ");
fgets(nombre, 80, stdin);
s=0;
while (nombre[s]!='\n' && nombre[s]!='\0') {s++;}
nombre[s]=0; /* add termination */
printf("Opening %s...\n", nombre);
f=fopen(nombre, "rb");
if (f==NULL) {
printf("*** no file ***\n");
return -1;
}
o=fopen("output.sv", "wb");
if (o==NULL) {
printf("*** cannot write ***\n");
return -1;
}
/* skip header, may check things */
if ((fgetc(f)!='P')||(fgetc(f)!='6')) {
printf("*** wrong file type ***\n");
return -1;
}
b=0; /* will count LFs here */
while (b<4)
if (fgetc(f)==10) b++;
s=255; /* usual value, may read from header */
do {
/* read three channels of one pixel */
r=fgetc(f);
g=fgetc(f);
b=fgetc(f);
/* quantise them */
r=r/s;
g=g*3/s; /* green is 0...3 */
b=b/s; /* all other channels are 0 or 1 */
gh=g>>1;
gl=g&1;
/* create index for leftmost pixel */
c=b<<7|gl<<6|r<<5|gh<<4;
/* ditto for another pixel */
r=fgetc(f);
g=fgetc(f);
b=fgetc(f);
/* quantise channels */
r=r/s;
g=g*3/s; /* green is 0...3 */
b=b/s; /* all other channels are 0 or 1 */
gh=g>>1;
gl=g&1;
/* add index for rightmost pixel */
c|=b<<3|gl<<2|r<<1|gh;
/* write into output file */
fputc(c, o);
} while(!feof(f));
/* clean up */
fclose(f);
fclose(o);
return 0;
}
|
the_stack_data/238067.c
|
#include<stdlib.h>
#include<stdio.h>
#define PASSWD 1234
int main(void)
{
int i;
for(i=1;i<=13;i++)
{
if(i%2==0)
{
continue;
}
else if(i==11)
{
break;
}
printf("i=%d\n",i);
}
///////////////////////////////////////
system("pause");
return 0;
}
|
the_stack_data/243892583.c
|
// Copyright 2022 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
/*
Linux ELF:
gcc -gdwarf-4 -m64 -c bitfields.c -o bitfields.elf4
*/
typedef struct another_struct {
unsigned short quix;
int xyz[0];
unsigned x:1;
long long array[40];
} t_another_struct;
t_another_struct q2;
|
the_stack_data/154828725.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
typedef int bool;
struct module;
void *__VERIFIER_nondet_pointer(void);
static inline bool try_module_get(struct module *module);
static inline void module_put(struct module *module)
{
}
static inline void __module_get(struct module *module)
{
}
extern void module_put_and_exit(struct module *mod, long code);
int module_refcount(struct module *mod);
void ldv_check_final_state(void);
const int N = 10;
void main(void)
{
struct module *test_module_1 = __VERIFIER_nondet_pointer();
int i;
__module_get(test_module_1);
if (test_module_1) {
module_put_and_exit(test_module_1, 0);
// unreached code
module_put(test_module_1);
module_put(test_module_1);
module_put(test_module_1);
}
ldv_check_final_state();
}
|
the_stack_data/7238.c
|
#include <pthread.h>
#include <stdint.h>
_Noreturn void thrd_exit(int status) {
pthread_exit((void*) (uintptr_t) status);
}
|
the_stack_data/3263728.c
|
#include <stdio.h>
#include <stdlib.h>
/*
Escreva um programa que repita a leitura de uma senha ate que ela seja valida.
Para cada leitura de senha incorreta, escrever a mensagem "SENHA INVALIDA!". Quando a senha for informada corretamente deve ser imressa a mesagem "ACESSO PERMITIDO" e o programa deve ser encerrado.
Considere que a senha correta é o valor 123456.
*/
int main(int argc, char const *argv[])
{
int num, senha;
senha = 123456;
do{
printf("\nDigite sua senha: ");
scanf("%d", &num);
printf("\nSENHA INVALIDA!");
}while(num != senha);
printf("\nACESSO PERMITIDO");
return 0;
}
|
the_stack_data/119802.c
|
#include<stdbool.h>
#include<stdint.h>
#include <stdio.h>
typedef __int128_t int128_t;
typedef __uint128_t uint128_t;
/* Word level operations {{{1 */
static inline
unsigned bit_count(unsigned wc) {
return wc << 6;
}
static inline
bool odd(uint64_t* x) {
return (x[0] & 1) != 0;
}
static inline
bool is_zero(unsigned wcnt, uint64_t* r) {
uint64_t* rend = r + wcnt;
for (; r != rend; ++r) {
if (*r != 0) return false;
}
return true;
}
void set_zero(unsigned wcnt, uint64_t* r) {
uint64_t* rend = r + wcnt;
for (; r != rend; ++r) *r = 0;
}
void set_unit(unsigned wcnt, uint64_t* r) {
unsigned i;
r[0] = 1;
for (i = 1; i < wcnt; ++i) {
r[i] = 0;
}
}
void assign(unsigned wcnt, uint64_t* r, uint64_t* x) {
unsigned i;
for (i = 0; i != wcnt; ++i) {
r[i] = x[i];
}
}
uint64_t inc(unsigned wcnt, uint64_t* r, uint64_t* y) {
unsigned i;
uint128_t c = 0;
for (i = 0; i != wcnt; ++i) {
uint64_t ri = r[i];
uint64_t yi = y[i];
c += ((uint128_t) ri) + yi;
r[i] = (uint64_t) c; c = c >> 64;
}
return (uint64_t) c;
}
int64_t dec(unsigned wcnt, uint64_t* r, uint64_t* y) {
int64_t b = 0;
unsigned i;
for (i = 0; i != wcnt; ++i) {
uint64_t ri = r[i];
uint64_t yi = y[i];
int128_t res = ((int128_t) b) + ((int128_t) ri) - yi;
r[i] = (uint64_t) res; b = ((int64_t) (res >> 64));
}
return b;
}
/* Returns true if x is less than y. */
bool leq(unsigned wcnt, uint64_t* x, uint64_t* y) {
unsigned i = wcnt;
while (i != 0) {
--i;
if (x[i] != y[i]) return x[i] < y[i];
}
return true;
}
/* r and x may alias, but overlapping is unsupported. */
void shr(unsigned wcnt, uint64_t* r, uint64_t carry, uint64_t* x) {
uint64_t c = carry;
unsigned i = wcnt;
while (i != 0) {
--i;
uint64_t xi = x[i];
r[i] = (c << 63) | (xi >> 1);
c = xi;
}
}
/* Stores x * y in r (which must contain twice the number of words as cnt). */
void mul(unsigned wcnt, uint64_t* r, uint64_t* x, uint64_t* y) {
// Initialize r with low-order byte.
{
uint128_t d = 0;
uint64_t x0 = x[0];
unsigned j;
for (j = 0; j != wcnt; ++j) {
d += (((uint128_t) x0) * y[j]);
r[j] = (uint64_t) d; d = d >> 64;
}
r[wcnt] = (uint64_t) d;
}
unsigned i;
for (i = 1; i != wcnt; ++i) {
uint128_t d = 0;
uint64_t xi = x[i];
unsigned ij = i;
unsigned j;
for (j = 0; j != wcnt; ++j, ++ij) {
d += r[ij] + (((uint128_t) xi) * y[j]);
r[ij] = (uint64_t) d; d = d >> 64;
}
r[ij] = (uint64_t) d;
}
}
#if 0
void print_num(unsigned wcnt, uint64_t* x) {
unsigned i = wcnt;
printf("%016llx", x[--i]);
while (i != 0) {
printf(" %016llx", x[--i]);
}
}
#endif
/* Modular arithmetic operations {{{1 */
void mod_inc(unsigned wcnt, uint64_t* r, uint64_t* y, uint64_t* p) {
if (inc(wcnt, r, y) != 0 || leq(wcnt, p, r)) dec(wcnt, r, p);
}
void mod_dec(unsigned wcnt, uint64_t* r, uint64_t* y, uint64_t* p) {
if (dec(wcnt, r, y) != 0) inc(wcnt, r, p);
}
/** Assigns x = x / 2 (mod p). */
void mod_half(unsigned wcnt, uint64_t* x, uint64_t* p) {
// If x[0] is odd
if (odd(x)) {
int c = inc(wcnt, x, p);
shr(wcnt, x, c, x);
} else {
shr(wcnt, x, 0, x);
}
}
static uint128_t mask64 = 0xFFFFFFFFFFFFFFFFULL;
static
void mod_red(unsigned wcnt, uint64_t* r, uint64_t c, uint64_t* p) {
while (c > 10) {
int128_t b = 0;
unsigned j;
for (j = 0; j != wcnt; ++j) {
// m incrementally stores c * group_order
uint128_t m = ((uint128_t) c) * p[j];
b += ((int128_t) r[j]) - (m & mask64);
r[j] = (uint64_t) b;
b = (b >> 64) - (m >> 64);
}
c = (uint64_t) (((int128_t) c) + b);
}
while (c > 0) {
c += dec(wcnt, r, p);
}
}
void mod_mul(unsigned wcnt, uint64_t* r, uint64_t* x, uint64_t* y, uint64_t* p) {
set_zero(wcnt, r);
unsigned i = wcnt;
while (i != 0) {
--i;
// Perform shift by 2<<64 followed by reduction.
{
uint64_t c = r[wcnt - 1];
unsigned j;
for (j = wcnt-1; j != 0; --j) {
r[j] = r[j-1];
}
r[0] = 0;
mod_red(wcnt, r, c, p);
}
// Add in xi * y[j];
uint128_t xi = x[i];
{
uint64_t c = 0;
unsigned j;
for (j = 0; j != wcnt; ++j) {
uint128_t m = xi * y[j];
uint128_t rj = ((uint128_t) c) + (m & mask64) + r[j];
r[j] = (uint64_t) rj;
c = (uint64_t) ((rj >> 64) + (m >> 64));
}
mod_red(wcnt, r, c, p);
}
}
while (leq(wcnt, p, r)) dec(wcnt, r, p);
}
void mod_sq(unsigned wcnt, uint64_t* r, uint64_t* x, uint64_t* p) {
mod_mul(wcnt, r, x, x, p);
}
void sd_mod_exp(unsigned wcnt,
uint64_t* r,
uint64_t* s,
uint64_t* sinv,
uint64_t* d,
uint64_t* p,
uint64_t* h,
uint64_t* temp) {
int cnt = bit_count(wcnt);
shr(wcnt, h, 0, d);
// If h <- d + (d >> 1) overflows
if (inc(wcnt, h, d) != 0) {
assign(wcnt, r, s);
} else {
// Otherwise start with r = 1.
set_unit(wcnt, r);
}
unsigned j = cnt;
while (j != 0) {
--j;
unsigned i = j >> 6;
uint64_t m = 1L << j;
uint64_t hi = h[i];
uint64_t ki = d[i] >> 1;
if (i + 1 < wcnt) {
ki |= (d[i+1] & 1) << 63;
}
mod_sq(wcnt, temp, r, p);
if ((hi & m) != 0 && (ki & m) == 0) {
mod_mul(wcnt, r, temp, s, p);
} else if ((hi & m) == 0 && (ki & m) != 0) {
mod_mul(wcnt, r, temp, sinv, p);
} else {
assign(wcnt, r, temp);
}
}
}
/**
* Assigns ra = 1 / y mod p.
* y, and p are unchanged.
* Buffers must be distinct from each other as well as x,y, and p.
* Overwrites t1, t2, and t2 with random data.
*/
void mod_inv(unsigned wcnt,
uint64_t* ra,
uint64_t* y,
uint64_t* p,
uint64_t* a,
uint64_t* b,
uint64_t* rb) {
assign( wcnt, a, p);
set_zero(wcnt, ra);
assign( wcnt, b, y);
set_unit(wcnt, rb);
bool swapped = false;
while (!is_zero(wcnt, b)) {
// If odd
if (odd(b)) {
if (!leq(wcnt, a, b)) {
uint64_t* t = a;
a = b;
b = t;
t = ra;
ra = rb;
rb = t;
swapped = !swapped;
}
// b <- b - a
dec(wcnt, b, a);
// rb <- rb - ra
mod_dec(wcnt, rb, ra, p);
}
// b <- b >> 1
shr(wcnt, b, 0, b);
// rb <- half(rb)
mod_half(wcnt, rb, p);
}
if (swapped) assign(wcnt, rb, ra);
}
/* Stores b ^ exp (mod p) in r. */
void mod_exp(unsigned wcnt, /* Number of 64-bit words in buffers. */
uint64_t* r, /* Buffer to store result in. */
uint64_t* b, /* Base */
uint64_t* exp, /* Exponent */
uint64_t* p /* Prime modulus */
) {
/* Temporary buffers */
uint64_t t1[wcnt];
uint64_t t2[wcnt];
uint64_t binv[wcnt];
mod_inv(wcnt, binv, b, p, t1, t2, r);
sd_mod_exp(wcnt, r, b, binv, exp, p, t1, t2);
}
/* Montgomery operations {{{1 */
void mont_coef(unsigned wcnt, uint64_t* r, uint64_t* p) {
//TODO: Assert cnt is a non-zero multiple of 64.
// Assert p is odd.
unsigned cnt = bit_count(wcnt);
unsigned i;
uint64_t temp[wcnt];
// Assign r = 1.
set_unit(wcnt, r);
// Assign temp = (p - 1) / 2.
shr(wcnt, temp, 0, p);
for (i = 1; i < cnt; ++i) {
unsigned w = i >> 6;
unsigned j = i & 0x3F;
if (odd(temp)) {
r[w] = r[w] | (((uint64_t) 1) << j);
uint64_t c = inc(wcnt, temp, p);
shr(wcnt, temp, c, temp);
} else {
shr(wcnt, temp, 0, temp);
}
}
}
#if 0
int main(int argc, char** argv) {
unsigned wcnt = 2;
uint64_t x[wcnt];
set_zero(wcnt, x);
x[0] = 0x3;
uint64_t p[wcnt];
p[0] = 0x91;
uint64_t r[wcnt];
mod_mul(1, r, x, x, p);
printf("Result = ");
print_num(1, r);
printf("\n");
mont_coef(1, r, p);
printf("Result = ");
print_num(1, r);
printf("\n");
uint64_t res[2];
mul(1, res, r, p);
printf("Test = ");
print_num(2, res);
printf("\n");
uint64_t t1[wcnt];
uint64_t t2[wcnt];
uint64_t t3[wcnt];
uint64_t xinv[wcnt];
mod_inv(wcnt, xinv, x, p, t1, t2, t3);
printf("xinv = ");
print_num(wcnt, xinv);
printf("\n");
mod_mul(wcnt, res, x, xinv, p);
printf("xinv test = ");
print_num(wcnt, res);
printf("\n");
uint64_t ex[wcnt];
set_zero(wcnt, ex);
ex[0] = 0x5L;
mod_exp(wcnt, res, x, ex, p);
printf("Test = ");
print_num(wcnt, res);
printf("\n");
return 0;
}
#endif
|
the_stack_data/62638444.c
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_putchar_fd.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: alebui <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2018/12/18 15:41:29 by alebui #+# #+# */
/* Updated: 2018/12/18 16:32:12 by alebui ### ########.fr */
/* */
/* ************************************************************************** */
#include <unistd.h>
void ft_putchar_fd(char c, int fd)
{
write(fd, &c, 1);
}
|
the_stack_data/78479.c
|
#include <assert.h>
#include <math.h>
#define NMAX 32
static double _a[NMAX][NMAX];
double ErfcRootXOverRootX(double u,int n)
{
double x = sqrt(u);
double uin,ui;
ui = 1.0/u;
uin = 1.0;
double f =0.0;
for (int k=1;k<=n;k++)
{
uin *= ui;
f += _a[n][k]*uin;
}
f *= exp(-u)/sqrt(M_PI);
f += _a[n][0]*erfc(x)*uin*sqrt(ui);
return f;
}
void ErfcRootXOverRootXInit(int m)
{
assert(m< NMAX);
_a[0][0] = 1.0;
_a[0][1] = 0.0;
_a[1][0] = -0.5*_a[0][0];
_a[1][1] = -1.0;
for (int n=1;n<m;n++)
{
_a[n+1][0] = -(2*n+1)/2.0*_a[n][0];
_a[n+1][1] = -1.0*_a[n][1];
for (int k=1;k<n;k++) _a[n+1][k+1]=(-k)*_a[n][k]-_a[n][k+1];
_a[n+1][n+1] = (-n)*_a[n][n] - _a[n][0] ;
}
}
/* Local Variables: */
/* tab-width: 3 */
/* End: */
|
the_stack_data/98573928.c
|
/*
** EPITECH PROJECT, 2021
** my_put_nbr.c
** File description:
** a function that displays the number given as a parameter.
*/
int my_put_nbr(int nb);
static int my_put_nbr_in_long(long nb);
int my_putchar(char c);
static int handling_negatives(int nb);
static int handling_negatives(int nb)
{
if (nb == 0) {
my_putchar('0');
}
my_putchar('-');
my_put_nbr_in_long(-nb);
return (0);
}
static int my_put_nbr_in_long(long nb)
{
long result = nb;
long multiplier = 1;
if (nb <= 0) {
handling_negatives(nb);
}
while (result > 10) {
result = nb / 10;
multiplier = multiplier * 10;
}
nb = nb - result * multiplier;
if (result != 0 || multiplier != 1) {
my_putchar(result + '0');
}
if (result == 0) {
return (0);
} else {
my_put_nbr(nb % 10);
}
return (0);
}
int my_put_nbr(int nb)
{
my_put_nbr_in_long(nb);
return (0);
}
|
the_stack_data/154827733.c
|
#include <stdio.h>
typedef struct {
int data[2010];
int length;
} Array;
Array equ1, equ2;
Array mul, add;
int max(int a, int b) { return a > b ? a : b; }
void print(Array array) {
printf("%d %d", array.data[array.length], array.length);
int i;
for (i = array.length - 1; i >= 0; --i)
if (array.data[i] != 0)
printf(" %d %d", array.data[i], i);
printf("\n");
}
int main() {
int k, a, n, i, j;
// read equ1
scanf("%d", &k);
while (k--) {
scanf("%d%d", &a, &n);
equ1.data[n] = a;
equ1.length = max(n, equ1.length);
}
// read equ2
scanf("%d", &k);
while (k--) {
scanf("%d%d", &a, &n);
equ2.data[n] = a;
equ2.length = max(n, equ2.length);
}
// mul
mul.length = equ1.length + equ2.length;
for (i = 0; i <= equ1.length; ++i)
for (j = 0; j <= equ2.length; ++j)
mul.data[i + j] += equ1.data[i] * equ2.data[j];
while (mul.data[mul.length] == 0 && mul.length > 0)
--mul.length;
print(mul);
// add
add.length = max(equ1.length, equ2.length);
for (i = 0; i <= add.length; ++i)
add.data[i] = equ1.data[i] + equ2.data[i];
while (add.data[add.length] == 0 && add.length > 0)
--add.length;
print(add);
return 0;
}
|
the_stack_data/59511882.c
|
#include<stdio.h>
#include<math.h>
// function to solve AX=b for X
void gausspivot(int n,double A[n][n+1],double x[]){
int i,j,k;
for(i=0;i<n-1;i++){
//Partial Pivoting
for(k=i+1;k<n;k++){
//If the diagonal element is less than the terms below it
if(fabs(A[i][i])<fabs(A[k][i])){
//Swap the rows in the matrix
for(j=0;j<=n;j++){
double temp;
temp=A[i][j];
A[i][j]=A[k][j];
A[k][j]=temp;
}
}
}
//Begin the Gauss Elimination
for(k=i+1;k<n;k++){
double term;
term=A[k][i]/A[i][i];
for(j=0;j<=n;j++){
A[k][j]=A[k][j]-term*A[i][j];
}
}
}
//Start with the back-substitution
for(i=n-1;i>=0;i--){
x[i]=A[i][n];
for(j=i+1;j<n;j++){
x[i]=x[i]-A[i][j]*x[j];
}
x[i]=x[i]/A[i][i];
}
// printing the x array
for(i=0;i<n;i++) {
printf(" a[%d]= %.3lf\n",i,x[i]);
}
}
int main()
{
int n,N=19; // no of datapoints
// n is order of matrix or n-1 is the order of polynomial
printf("enter the order of augmented matrix:");
scanf("%d",&n);
int i,j,k;
double x[]={0,0.01,0.02,0.03,0.04,0.05,0.06,0.07,0.08,0.09,0.1,0.11,0.12,0.13,0.14,0.15,0.16,0.17,0.18};
double y[]={0.2,0.231895,0.264668,0.289191,0.332345,0.368007,0.403062,0.43739,0.472877,0.508413,0.543893,0.579221,0.614274,0.648984,0.683257,0.717008,0.717008,0.782653,0.814414};
double A[n][n+1];
// part A of augmented matrix [A:b]
for(i=0;i<n;i++) {
for(j=0;j<n;j++) {
double sum=0;
for(k=0;k<N;k++)
sum+=pow(x[k],i+j);
A[i][j]=sum/N;
}
}
// part b of augmented matrix [A:b]
for(i=0;i<n;i++) {
double sum=0;
for(k=0;k<N;k++)
sum=sum+(pow(x[k],i)*y[k]);
A[i][n]=sum/N;
}
double a[n],yf[N]; //yf[N] is fitted values
// finding the coefficients
printf("The coefficients for order [%d] are:\n",n-1);
gausspivot(n,A,a);
FILE*fp=NULL;
fp=fopen("2.txt","w");
// defining the polynomial
k=0;
while(k<N) {
double sum=0;
for (i=0;i<n;++i)
sum += a[i]*pow(x[k],i);
yf[k]=sum;
fprintf(fp,"%.3lf\t%lf\n",x[k],yf[k]);
k++;
}
// calculating the chi square
double chi=0;
for (i=0;i<N;++i)
chi += (yf[i]-y[i])*(yf[i]-y[i]);
printf("Chi square for order [%d]:%lf\n",n-1,chi);
}
|
the_stack_data/62637452.c
|
// LastVoting
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#include <time.h>
#include <stdbool.h>
// Number of processes
#if !defined(NUM_PROC)
#define NUM_PROC 3
#endif
// Number of rounds
#if !defined(MAX_ROUND)
#define MAX_ROUND 10
#endif
#define HALF ((int)(NUM_PROC / 2))
#define TWOTHIRD ((int)(2 * NUM_PROC / 3))
int _randint(int first, int last)
{
int tmp;
#if defined(CBMC)
__CPROVER_assume((first <= tmp) && (tmp <= last));
#else
tmp = rand() % (last + 1 - first) + first;
#endif
return tmp;
}
int decision[NUM_PROC];
int firstdecision = 0;
void decide(int proc, int value)
{
decision[proc] = value;
if (firstdecision == 0)
{
firstdecision = value;
}
else
{
assert(firstdecision == value);
}
}
int main(int argc, char **argv)
{
//short state[NUM_PROC];
int x[NUM_PROC];
int vote[NUM_PROC];
bool voteToSend[NUM_PROC];
int ts[NUM_PROC];
#if defined(CBMC)
// do nothing
#else
// Set random seed
if (argc > 1)
{
srand(atoi(argv[1]));
}
else
{
srand((unsigned)time(NULL));
}
#endif
// Set proposed values randomly
// 1, 2, ..., NUM_PROC
for (int proc = 0; proc < NUM_PROC; proc++)
{
x[proc] = _randint(1, NUM_PROC);
vote[proc] = -1;
voteToSend[proc] = false;
ts[proc] = 0;
}
// Iterate rounds MAX_ROUND times
int round = 1;
for (int phase = 1; round <= MAX_ROUND; phase++)
{
int coord[NUM_PROC];
for (int proc = 0; proc < NUM_PROC; proc++)
{
coord[proc] = _randint(0, NUM_PROC -1 );
}
// start round % 3 = 1
{
// channels
struct _chnl
{
int x;
int ts;
}
chnl[NUM_PROC][NUM_PROC];
// send
for (int proc = 0; proc < NUM_PROC; proc++)
{
for (int peer = 0; peer < NUM_PROC; peer++)
{
if (peer == coord[proc])
{
chnl[peer][proc].x = x[proc];
chnl[peer][proc].ts = ts[proc];
}
else
{
chnl[peer][proc].x = -1;
chnl[peer][proc].ts = -1;
}
}
}
// message faults
for (int proc = 0; proc < NUM_PROC; proc++)
{
struct _chnl *ch = chnl[proc];
for (int i = 0; i < NUM_PROC; i++)
{
if (_randint(0, 1) == 0)
{
ch[i].x = -1;
ch[i].ts = -1;
}
}
// print out
for (int i = 0; i < NUM_PROC; i++)
{
printf("{%d,%d}..", ch[i].x, ch[i].ts);
}
printf("\n");
}
// receive
for (int proc = 0; proc < NUM_PROC; proc++)
{
struct _chnl *ch = chnl[proc];
// count messages
int count = 0;
for (int i = 0; i < NUM_PROC; i++)
{
if (ch[i].x >= 0)
{
count++;
}
}
// check if more than n/2 messages are received
if (proc == coord[proc] && count > HALF)
{
// select x with largest ts
int max_ts = -1;
int cand_x = -1;
for (int i = 0; i < NUM_PROC; i++)
{
if (ch[i].ts > max_ts)
{
max_ts = ch[i].ts;
cand_x = ch[i].x;
}
}
// vote
vote[proc] = cand_x;
voteToSend[proc] = true;
}
}
round++;
} // round end
// round % 3 = 2
{
// channels
struct _chnl
{
int vote;
}
chnl[NUM_PROC][NUM_PROC];
// send
for (int proc = 0; proc < NUM_PROC; proc++)
{
for (int peer = 0; peer < NUM_PROC; peer++)
{
if ((proc == coord[proc]) && (voteToSend[proc] == true))
{
chnl[peer][proc].vote = vote[proc];
}
else
{
chnl[peer][proc].vote = -1;
}
}
}
// message faults
for (int proc = 0; proc < NUM_PROC; proc++)
{
struct _chnl *ch = chnl[proc];
for (int i = 0; i < NUM_PROC; i++)
{
if (_randint(0, 1) == 0)
{
ch[i].vote = -1;
}
}
// print out
for (int i = 0; i < NUM_PROC; i++)
{
printf("{%d}..", ch[i].vote);
}
printf("\n");
}
// receive
for (int proc = 0; proc < NUM_PROC; proc++)
{
struct _chnl *ch = chnl[proc];
if (ch[coord[proc]].vote != -1)
{
x[proc] = ch[coord[proc]].vote;
ts[proc] = phase;
}
}
round++;
} // end round
// start round % 3 = 0
{
// channels
struct _chnl
{
int ack;
int x;
}
chnl[NUM_PROC][NUM_PROC];
// send
for (int proc = 0; proc < NUM_PROC; proc++)
{
for (int peer = 0; peer < NUM_PROC; peer++)
{
if (ts[proc] == phase)
{
chnl[peer][proc].ack = 1;
chnl[peer][proc].x = x[proc];
}
else
{
chnl[peer][proc].ack = -1;
chnl[peer][proc].x = -1;
}
}
}
// message faults
for (int proc = 0; proc < NUM_PROC; proc++)
{
struct _chnl *ch = chnl[proc];
for (int i = 0; i < NUM_PROC; i++)
{
if (_randint(0, 1) == 0)
{
ch[i].ack = -1;
ch[i].x = -1;
}
}
// print out
for (int i = 0; i < NUM_PROC; i++)
{
printf("{%d,%d}..", ch[i].ack, ch[i].x);
}
printf("\n");
}
// receive
for (int proc = 0; proc < NUM_PROC; proc++)
{
struct _chnl *ch = chnl[proc];
// count messages
int count = 0;
for (int i = 0; i < NUM_PROC; i++)
{
if (ch[i].x >= 0)
{
count++;
}
}
// select an x value received n/2 times
for (int i = 0; i < NUM_PROC; i++)
{
int val = ch[i].x;
int count = 1;
if (val == -1)
{
continue;
}
for (int j = i + 1; j < NUM_PROC; j++)
{
if (ch[j].x == val)
count++;
}
if (count > HALF)
{
decide(proc, val);
printf("Pr%d decides %d\n", proc, val);
break;
}
}
voteToSend[proc] = false;
}
round++;
} // round end
} // phase end
return 0;
}
|
the_stack_data/220456480.c
|
/* This is compiled once into test-PR26684-dwarf4.o and once into
test-PR26684-dwarf5.o:
gcc -c -gdwarf-5 -o test-PR26684-dwarf5.o test-PR26684.c
gcc -c -gdwarf-4 -o test-PR26684-dwarf4.o test-PR26684.c
*/
struct pea
{
int type;
long a:1, b:1, c:1;
};
struct pea p;
|
the_stack_data/50329.c
|
extern const unsigned char BBPortalVersionString[];
extern const double BBPortalVersionNumber;
const unsigned char BBPortalVersionString[] __attribute__ ((used)) = "@(#)PROGRAM:BBPortal PROJECT:Pods-1" "\n";
const double BBPortalVersionNumber __attribute__ ((used)) = (double)1.;
|
the_stack_data/944631.c
|
//preprocessors
#include <stdio.h>
#include <stdlib.h>
#define NUMBERS 50
//main function
main() {
int number[NUMBERS];
int i;
number [0]=50;
//printf(enter number and (-1 = quit )
//use for and if statements 2 each
//1st for then if ....
//2nd for then if....
printf("enter numbers %i\n", number[NUMBERS]);
scanf_s("%i", &number[NUMBERS]);
for (i = 0; i < NUMBERS; i++) {
printf("element %i has %i\n", i, number[i]);
}
//end main function
system("pause");
}
|
the_stack_data/116814.c
|
/* locate_plugins.c -- Find BCFtools plugins relative to binary location
Copyright (c) 2018 Genome Research Ltd.
Author: Rob Davies <[email protected]>
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. */
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <errno.h>
#define SELF_EXE "/proc/self/exe"
/*
Find plugins dir relative to location pointed to by /proc/self/exe
symlink.
Notes:
- Doesn't try to reclaim the memory used to store the location. Valgrind
classifies it as "still reachable".
- If it fails, it advises the use of BCFTOOLS_PLUGINS, which will
bypass this code. It then calls exit, as there's no very good way of
passing back an error condition.
*/
const char *locate_plugins(const char *relative_location) {
static char *result = NULL;
char *s;
size_t rl_len = strlen(relative_location), link_len = 0;
ssize_t r;
if (result) return result;
do {
link_len = link_len ? link_len * 2 : 256;
free(result);
result = malloc(link_len + rl_len + 1);
if (!result) {
fprintf(stderr, "[E::locate_plugins] Out of memory\n");
goto fail;
}
result[0] = '\0';
r = readlink(SELF_EXE, result, link_len);
if (r < 0) {
fprintf(stderr, "[E::locate_plugins] Couldn't read \"%s\" link: %s\n",
SELF_EXE, strerror(errno));
goto fail;
}
} while (r >= link_len);
result[r] = '\0';
s = strrchr(result, '/');
if (!s) {
fprintf(stderr, "[E::locate_plugins] Can't find directory containing bcftools program\n");
goto fail;
}
memcpy(s + 1, relative_location, rl_len + 1);
return result;
fail:
fprintf(stderr,
"[E::locate_plugins] Set BCFTOOLS_PLUGINS to the location of the plugins\n"
"directory to work around this problem.\n");
exit(EXIT_FAILURE);
}
|
the_stack_data/298833.c
|
/* { dg-do compile } */
/* { dg-options "-O2 -fcilkplus" } */
#define vl(n) vectorlength(2*n)
void
foo (int *a, int *b, int *c)
{
int i;
#pragma simd vl(4)
for (i = 0; i < 64; i++)
a[i] = b[i] * c[i];
}
|
the_stack_data/97129.c
|
/*
* Copyright (c) 1980, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#) Copyright (c) 1980, 1993 The Regents of the University of California. All rights reserved.
* @(#)ul.c 8.1 (Berkeley) 6/6/93
* $FreeBSD: src/usr.bin/ul/ul.c,v 1.6.2.1 2000/08/23 08:49:49 kris Exp $
* $DragonFly: src/usr.bin/ul/ul.c,v 1.4 2005/01/05 02:40:23 cpressey Exp $
*/
#include <err.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <termcap.h>
#include <unistd.h>
#define IESC '\033'
#define SO '\016'
#define SI '\017'
#define HFWD '9'
#define HREV '8'
#define FREV '7'
#define MAXBUF 512
#define NORMAL 000
#define ALTSET 001 /* Reverse */
#define SUPERSC 002 /* Dim */
#define SUBSC 004 /* Dim | Ul */
#define UNDERL 010 /* Ul */
#define BOLD 020 /* Bold */
int must_use_uc, must_overstrike;
const char *CURS_UP, *CURS_RIGHT, *CURS_LEFT,
*ENTER_STANDOUT, *EXIT_STANDOUT, *ENTER_UNDERLINE, *EXIT_UNDERLINE,
*ENTER_DIM, *ENTER_BOLD, *ENTER_REVERSE, *UNDER_CHAR, *EXIT_ATTRIBUTES;
struct CHAR {
char c_mode;
char c_char;
} ;
struct CHAR obuf[MAXBUF];
int col, maxcol;
int mode;
int halfpos;
int upln;
int iflag;
static void usage(void);
void setnewmode(int);
void initcap(void);
void reverse(void);
int outchar(int);
void fwd(void);
void initbuf(void);
void iattr(void);
void overstrike(void);
void flushln(void);
void filter(FILE *);
void outc(int);
#define PRINT(s) if (s == NULL) /* void */; else tputs(s, 1, outchar)
int
main(int argc, char **argv)
{
int c;
const char *termtype;
FILE *f;
char termcap[1024];
termtype = getenv("TERM");
if (termtype == NULL || (argv[0][0] == 'c' && !isatty(1)))
termtype = "lpr";
while ((c=getopt(argc, argv, "it:T:")) != -1)
switch(c) {
case 't':
case 'T': /* for nroff compatibility */
termtype = optarg;
break;
case 'i':
iflag = 1;
break;
default:
usage();
}
switch(tgetent(termcap, termtype)) {
case 1:
break;
default:
warnx("trouble reading termcap");
/* fall through to ... */
case 0:
/* No such terminal type - assume dumb */
(void)strcpy(termcap, "dumb:os:col#80:cr=^M:sf=^J:am:");
break;
}
initcap();
if ( (tgetflag("os") && ENTER_BOLD==NULL ) ||
(tgetflag("ul") && ENTER_UNDERLINE==NULL && UNDER_CHAR==NULL))
must_overstrike = 1;
initbuf();
if (optind == argc)
filter(stdin);
else for (; optind<argc; optind++) {
f = fopen(argv[optind],"r");
if (f == NULL)
err(1, "%s", argv[optind]);
else
filter(f);
}
exit(0);
}
static void
usage(void)
{
fprintf(stderr, "usage: ul [-i] [-t terminal] file...\n");
exit(1);
}
void
filter(FILE *f)
{
int c;
while ((c = getc(f)) != EOF && col < MAXBUF) switch(c) {
case '\b':
if (col > 0)
col--;
continue;
case '\t':
col = (col+8) & ~07;
if (col > maxcol)
maxcol = col;
continue;
case '\r':
col = 0;
continue;
case SO:
mode |= ALTSET;
continue;
case SI:
mode &= ~ALTSET;
continue;
case IESC:
switch (c = getc(f)) {
case HREV:
if (halfpos == 0) {
mode |= SUPERSC;
halfpos--;
} else if (halfpos > 0) {
mode &= ~SUBSC;
halfpos--;
} else {
halfpos = 0;
reverse();
}
continue;
case HFWD:
if (halfpos == 0) {
mode |= SUBSC;
halfpos++;
} else if (halfpos < 0) {
mode &= ~SUPERSC;
halfpos++;
} else {
halfpos = 0;
fwd();
}
continue;
case FREV:
reverse();
continue;
default:
errx(1, "unknown escape sequence in input: %o, %o", IESC, c);
}
continue;
case '_':
if (obuf[col].c_char)
obuf[col].c_mode |= UNDERL | mode;
else
obuf[col].c_char = '_';
case ' ':
col++;
if (col > maxcol)
maxcol = col;
continue;
case '\n':
flushln();
continue;
case '\f':
flushln();
putchar('\f');
continue;
default:
if (c < ' ') /* non printing */
continue;
if (obuf[col].c_char == '\0') {
obuf[col].c_char = c;
obuf[col].c_mode = mode;
} else if (obuf[col].c_char == '_') {
obuf[col].c_char = c;
obuf[col].c_mode |= UNDERL|mode;
} else if (obuf[col].c_char == c)
obuf[col].c_mode |= BOLD|mode;
else
obuf[col].c_mode = mode;
col++;
if (col > maxcol)
maxcol = col;
continue;
}
if (maxcol)
flushln();
}
void
flushln(void)
{
int lastmode;
int i;
int hadmodes = 0;
lastmode = NORMAL;
for (i=0; i<maxcol; i++) {
if (obuf[i].c_mode != lastmode) {
hadmodes++;
setnewmode(obuf[i].c_mode);
lastmode = obuf[i].c_mode;
}
if (obuf[i].c_char == '\0') {
if (upln)
PRINT(CURS_RIGHT);
else
outc(' ');
} else
outc(obuf[i].c_char);
}
if (lastmode != NORMAL) {
setnewmode(0);
}
if (must_overstrike && hadmodes)
overstrike();
putchar('\n');
if (iflag && hadmodes)
iattr();
(void)fflush(stdout);
if (upln)
upln--;
initbuf();
}
/*
* For terminals that can overstrike, overstrike underlines and bolds.
* We don't do anything with halfline ups and downs, or Greek.
*/
void
overstrike(void)
{
int i;
char lbuf[256];
char *cp = lbuf;
int hadbold=0;
/* Set up overstrike buffer */
for (i=0; i<maxcol; i++)
switch (obuf[i].c_mode) {
case NORMAL:
default:
*cp++ = ' ';
break;
case UNDERL:
*cp++ = '_';
break;
case BOLD:
*cp++ = obuf[i].c_char;
hadbold=1;
break;
}
putchar('\r');
for (*cp=' '; *cp==' '; cp--)
*cp = 0;
for (cp=lbuf; *cp; cp++)
putchar(*cp);
if (hadbold) {
putchar('\r');
for (cp=lbuf; *cp; cp++)
putchar(*cp=='_' ? ' ' : *cp);
putchar('\r');
for (cp=lbuf; *cp; cp++)
putchar(*cp=='_' ? ' ' : *cp);
}
}
void
iattr(void)
{
int i;
char lbuf[256];
char *cp = lbuf;
for (i=0; i<maxcol; i++)
switch (obuf[i].c_mode) {
case NORMAL: *cp++ = ' '; break;
case ALTSET: *cp++ = 'g'; break;
case SUPERSC: *cp++ = '^'; break;
case SUBSC: *cp++ = 'v'; break;
case UNDERL: *cp++ = '_'; break;
case BOLD: *cp++ = '!'; break;
default: *cp++ = 'X'; break;
}
for (*cp=' '; *cp==' '; cp--)
*cp = 0;
for (cp=lbuf; *cp; cp++)
putchar(*cp);
putchar('\n');
}
void
initbuf(void)
{
bzero((char *)obuf, sizeof (obuf)); /* depends on NORMAL == 0 */
col = 0;
maxcol = 0;
mode &= ALTSET;
}
void
fwd(void)
{
int oldcol, oldmax;
oldcol = col;
oldmax = maxcol;
flushln();
col = oldcol;
maxcol = oldmax;
}
void
reverse(void)
{
upln++;
fwd();
PRINT(CURS_UP);
PRINT(CURS_UP);
upln++;
}
void
initcap(void)
{
static char tcapbuf[512];
char *bp = tcapbuf;
/* This nonsense attempts to work with both old and new termcap */
CURS_UP = tgetstr("up", &bp);
CURS_RIGHT = tgetstr("ri", &bp);
if (CURS_RIGHT == NULL)
CURS_RIGHT = tgetstr("nd", &bp);
CURS_LEFT = tgetstr("le", &bp);
if (CURS_LEFT == NULL)
CURS_LEFT = tgetstr("bc", &bp);
if (CURS_LEFT == NULL && tgetflag("bs"))
CURS_LEFT = "\b";
ENTER_STANDOUT = tgetstr("so", &bp);
EXIT_STANDOUT = tgetstr("se", &bp);
ENTER_UNDERLINE = tgetstr("us", &bp);
EXIT_UNDERLINE = tgetstr("ue", &bp);
ENTER_DIM = tgetstr("mh", &bp);
ENTER_BOLD = tgetstr("md", &bp);
ENTER_REVERSE = tgetstr("mr", &bp);
EXIT_ATTRIBUTES = tgetstr("me", &bp);
if (!ENTER_BOLD && ENTER_REVERSE)
ENTER_BOLD = ENTER_REVERSE;
if (!ENTER_BOLD && ENTER_STANDOUT)
ENTER_BOLD = ENTER_STANDOUT;
if (!ENTER_UNDERLINE && ENTER_STANDOUT) {
ENTER_UNDERLINE = ENTER_STANDOUT;
EXIT_UNDERLINE = EXIT_STANDOUT;
}
if (!ENTER_DIM && ENTER_STANDOUT)
ENTER_DIM = ENTER_STANDOUT;
if (!ENTER_REVERSE && ENTER_STANDOUT)
ENTER_REVERSE = ENTER_STANDOUT;
if (!EXIT_ATTRIBUTES && EXIT_STANDOUT)
EXIT_ATTRIBUTES = EXIT_STANDOUT;
/*
* Note that we use REVERSE for the alternate character set,
* not the as/ae capabilities. This is because we are modelling
* the model 37 teletype (since that's what nroff outputs) and
* the typical as/ae is more of a graphics set, not the greek
* letters the 37 has.
*/
UNDER_CHAR = tgetstr("uc", &bp);
must_use_uc = (UNDER_CHAR && !ENTER_UNDERLINE);
}
int
outchar(int c)
{
return(putchar(c & 0177));
}
static int curmode = 0;
void
outc(int c)
{
putchar(c);
if (must_use_uc && (curmode&UNDERL)) {
PRINT(CURS_LEFT);
PRINT(UNDER_CHAR);
}
}
void
setnewmode(int newmode)
{
if (!iflag) {
if (curmode != NORMAL && newmode != NORMAL)
setnewmode(NORMAL);
switch (newmode) {
case NORMAL:
switch(curmode) {
case NORMAL:
break;
case UNDERL:
PRINT(EXIT_UNDERLINE);
break;
default:
/* This includes standout */
PRINT(EXIT_ATTRIBUTES);
break;
}
break;
case ALTSET:
PRINT(ENTER_REVERSE);
break;
case SUPERSC:
/*
* This only works on a few terminals.
* It should be fixed.
*/
PRINT(ENTER_UNDERLINE);
PRINT(ENTER_DIM);
break;
case SUBSC:
PRINT(ENTER_DIM);
break;
case UNDERL:
PRINT(ENTER_UNDERLINE);
break;
case BOLD:
PRINT(ENTER_BOLD);
break;
default:
/*
* We should have some provision here for multiple modes
* on at once. This will have to come later.
*/
PRINT(ENTER_STANDOUT);
break;
}
}
curmode = newmode;
}
|
the_stack_data/170452744.c
|
#include <stdio.h>
#ifdef _OPENMP
#include <omp.h>
#else
#define omp_get_thread_num() 0
#endif
main()
{
int i, n = 7;
int a[n], suma;
for (i=0; i<n; i++)
a[i] = i;
suma=10;
#pragma omp parallel private(suma)
{
#pragma omp for
for (i=0; i<n; i++)
{
suma = suma + a[i];
printf("thread %d suma a[%d] / ", omp_get_thread_num(), i);
}
printf("\n thread %d suma= %d", omp_get_thread_num(), suma);
}
printf("\n");
}
|
the_stack_data/159510.c
|
/* $NetBSD: getwc.c,v 1.2 2003/01/18 11:29:55 thorpej Exp $ */
/*-
* Copyright (c)2001 Citrus Project,
* 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 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.
*
* $Citrus$
*/
#if defined(LIBC_SCCS) && !defined(lint)
__RCSID("$NetBSD$");
#endif /* LIBC_SCCS and not lint */
#include <stdio.h>
#include <wchar.h>
/*
* A subroutine version of the macro getwc.
*/
#undef getwc
wint_t
getwc(FILE *fp)
{
return fgetwc(fp);
}
|
the_stack_data/22014125.c
|
/**************************************************************************/
/*!
@file test_osal_none.c
@author hathach (tinyusb.org)
@section LICENSE
Software License Agreement (BSD License)
Copyright (c) 2013, hathach (tinyusb.org)
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 copyright holders nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ''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 BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
INCLUDING NEGLIGENCE OR OTHERWISE ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
This file is part of the tinyusb stack.
*/
/**************************************************************************/
#ifdef CFG_TUSB_OS
#undef CFG_TUSB_OS
#endif
void setUp(void)
{
}
void tearDown(void)
{
}
#if 0 // TODO enable
#include "unity.h"
#include "tusb_errors.h"
#include "osal_none.h"
#define QUEUE_DEPTH 10
uint32_t statements[10];
OSAL_SEM_DEF(sem);
osal_semaphore_handle_t sem_hdl;
OSAL_QUEUE_DEF(queue, QUEUE_DEPTH, uint32_t);
osal_queue_handle_t queue_hdl;
OSAL_MUTEX_DEF(mutex);
osal_mutex_handle_t mutex_hdl;
void setUp(void)
{
memset(statements, 0, sizeof(statements));
sem_hdl = osal_semaphore_create (OSAL_SEM_REF(sem));
queue_hdl = osal_queue_create (OSAL_QUEUE_REF(queue));
mutex_hdl = osal_mutex_create (OSAL_MUTEX_REF(mutex));
}
void tearDown(void)
{
}
//--------------------------------------------------------------------+
// Semaphore
//--------------------------------------------------------------------+
void test_semaphore_create(void)
{
TEST_ASSERT_EQUAL_PTR(&sem, sem_hdl);
TEST_ASSERT_EQUAL(0, sem);
}
void test_semaphore_post(void)
{
osal_semaphore_post(sem_hdl);
TEST_ASSERT_EQUAL(1, sem);
}
// blocking service such as semaphore wait need to be invoked within a task's loop
//--------------------------------------------------------------------+
// Mutex
//--------------------------------------------------------------------+
void test_mutex_create(void)
{
TEST_ASSERT_EQUAL_PTR(&mutex, mutex_hdl);
TEST_ASSERT_EQUAL(1, mutex);
}
void test_mutex_release(void)
{
osal_mutex_release(mutex_hdl);
TEST_ASSERT_EQUAL(1, mutex);
}
//--------------------------------------------------------------------+
// Queue
//--------------------------------------------------------------------+
void test_queue_create(void)
{
TEST_ASSERT_EQUAL_PTR(&queue, queue_hdl);
TEST_ASSERT_EQUAL(QUEUE_DEPTH, queue_hdl->depth);
TEST_ASSERT_EQUAL_PTR(queue_buffer, queue_hdl->buffer);
TEST_ASSERT_EQUAL(0, queue_hdl->count);
TEST_ASSERT_EQUAL(0, queue_hdl->wr_idx);
TEST_ASSERT_EQUAL(0, queue_hdl->rd_idx);
}
void test_queue_send(void)
{
uint32_t const item = 0x1234;
osal_queue_send(queue_hdl, &item);
TEST_ASSERT_EQUAL(1, queue_hdl->count);
TEST_ASSERT_EQUAL_MEMORY(&item, queue_hdl->buffer + (queue_hdl->rd_idx * queue_hdl->item_size), 4);
}
// blocking service such as semaphore wait need to be invoked within a task's loop
//--------------------------------------------------------------------+
// TASK SEMAPHORE
//--------------------------------------------------------------------+
tusb_error_t sample_task_semaphore(void)
{
tusb_error_t error = TUSB_ERROR_NONE;
OSAL_TASK_LOOP_BEGIN
statements[0]++;
osal_semaphore_wait(sem_hdl, OSAL_TIMEOUT_WAIT_FOREVER, &error);
statements[1]++;
osal_semaphore_wait(sem_hdl, OSAL_TIMEOUT_WAIT_FOREVER, &error);
statements[2]++;
osal_semaphore_wait(sem_hdl, OSAL_TIMEOUT_WAIT_FOREVER, &error);
statements[3]++;
osal_semaphore_wait(sem_hdl, OSAL_TIMEOUT_NORMAL, &error);
statements[4]++;
TEST_ASSERT_EQUAL(TUSB_ERROR_OSAL_TIMEOUT, error);
OSAL_TASK_LOOP_END
}
void test_task_with_semaphore(void)
{
// several invoke before sempahore is available
for(uint32_t i=0; i<10; i++)
sample_task_semaphore();
TEST_ASSERT_EQUAL(1, statements[0]);
// invoke after posting semaphore
osal_semaphore_post(sem_hdl);
sample_task_semaphore();
TEST_ASSERT_EQUAL(1, statements[1]);
// post 2 consecutive times
osal_semaphore_post(sem_hdl);
osal_semaphore_post(sem_hdl);
sample_task_semaphore();
TEST_ASSERT_EQUAL(1, statements[2]);
TEST_ASSERT_EQUAL(1, statements[3]);
// timeout
for(uint32_t i=0; i<(OSAL_TIMEOUT_NORMAL*CFG_TUSB_OS_TICKS_PER_SECOND)/1000 - 1 ; i++) // not enough time
osal_tick_tock();
sample_task_semaphore();
TEST_ASSERT_EQUAL(0, statements[4]);
osal_tick_tock();
sample_task_semaphore();
// reach end of task loop, back to beginning
sample_task_semaphore();
TEST_ASSERT_EQUAL(2, statements[0]);
}
//--------------------------------------------------------------------+
// TASK MUTEX
//--------------------------------------------------------------------+
tusb_error_t mutex_sample_task1(void) // occupy mutex and not release it
{
tusb_error_t error = TUSB_ERROR_NONE;
OSAL_TASK_LOOP_BEGIN
statements[0]++;
osal_mutex_wait(mutex_hdl, OSAL_TIMEOUT_WAIT_FOREVER, &error);
statements[2]++;
OSAL_TASK_LOOP_END
}
tusb_error_t mutex_sample_task2(void)
{
tusb_error_t error = TUSB_ERROR_NONE;
OSAL_TASK_LOOP_BEGIN
statements[1]++;
osal_mutex_wait(mutex_hdl, OSAL_TIMEOUT_WAIT_FOREVER, &error);
statements[3]++;
osal_mutex_wait(mutex_hdl, OSAL_TIMEOUT_NORMAL, &error);
statements[5]++;
TEST_ASSERT_EQUAL(TUSB_ERROR_OSAL_TIMEOUT, error);
OSAL_TASK_LOOP_END
}
void test_task_with_mutex(void)
{
// several invoke before mutex is available
mutex_sample_task1();
for(uint32_t i=0; i<10; i++) {
mutex_sample_task2();
}
TEST_ASSERT_EQUAL(1, statements[0]);
TEST_ASSERT_EQUAL(1, statements[2]);
TEST_ASSERT_EQUAL(1, statements[1]);
TEST_ASSERT_EQUAL(0, statements[3]);
// invoke after posting mutex
osal_mutex_release(mutex_hdl);
for(uint32_t i=0; i<10; i++) {
mutex_sample_task2();
}
TEST_ASSERT_EQUAL(1, statements[3]);
TEST_ASSERT_EQUAL(0, statements[5]);
// timeout
for(uint32_t i=0; i<(OSAL_TIMEOUT_NORMAL*CFG_TUSB_OS_TICKS_PER_SECOND)/1000 - 1 ; i++){ // one tick less
osal_tick_tock();
}
mutex_sample_task2();
TEST_ASSERT_EQUAL(0, statements[5]);
osal_tick_tock();
mutex_sample_task2();
TEST_ASSERT_EQUAL(1, statements[5]);
}
//--------------------------------------------------------------------+
// TASK QUEUE
//--------------------------------------------------------------------+
tusb_error_t sample_task_with_queue(void)
{
uint32_t data;
tusb_error_t error;
OSAL_TASK_LOOP_BEGIN
statements[0]++;
osal_queue_receive(queue_hdl, &data, OSAL_TIMEOUT_WAIT_FOREVER, &error);
TEST_ASSERT_EQUAL(0x1111, data);
statements[1]++;
osal_queue_receive(queue_hdl, &data, OSAL_TIMEOUT_WAIT_FOREVER, &error);
TEST_ASSERT_EQUAL(0x2222, data);
statements[2]++;
osal_queue_receive(queue_hdl, &data, OSAL_TIMEOUT_WAIT_FOREVER, &error);
TEST_ASSERT_EQUAL(0x3333, data);
statements[3]++;
osal_queue_receive(queue_hdl, &data, OSAL_TIMEOUT_NORMAL, &error);
statements[4]++;
TEST_ASSERT_EQUAL(TUSB_ERROR_OSAL_TIMEOUT, error);
OSAL_TASK_LOOP_END
}
void test_task_with_queue(void)
{
uint32_t i = 0;
uint32_t item;
sample_task_with_queue();
// several invoke before queue is available
for(i=0; i<10; i++)
sample_task_with_queue();
TEST_ASSERT_EQUAL(1, statements[0]);
// invoke after sending to queue
item = 0x1111;
osal_queue_send(queue_hdl, &item);
sample_task_with_queue();
TEST_ASSERT_EQUAL(1, statements[1]);
sample_task_with_queue();
TEST_ASSERT_EQUAL(1, statements[1]);
item = 0x2222;
osal_queue_send(queue_hdl, &item);
item = 0x3333;
osal_queue_send(queue_hdl, &item);
sample_task_with_queue();
TEST_ASSERT_EQUAL(1, statements[2]);
TEST_ASSERT_EQUAL(1, statements[3]);
// timeout
for(uint32_t i=0; i<(OSAL_TIMEOUT_NORMAL*CFG_TUSB_OS_TICKS_PER_SECOND)/1000 - 1 ; i++) // not enough time
osal_tick_tock();
sample_task_with_queue();
TEST_ASSERT_EQUAL(0, statements[4]);
osal_tick_tock();
sample_task_with_queue();
// reach end of task loop, back to beginning
sample_task_with_queue();
TEST_ASSERT_EQUAL(2, statements[0]);
}
//--------------------------------------------------------------------+
// TASK DELAY
//--------------------------------------------------------------------+
tusb_error_t sample_task_with_delay(void)
{
tusb_error_t error;
OSAL_TASK_LOOP_BEGIN
osal_task_delay(1000);
statements[0]++;
OSAL_TASK_LOOP_END
}
void test_task_with_delay(void)
{
sample_task_with_delay();
TEST_ASSERT_EQUAL(0, statements[0]);
for(uint32_t i=0; i<CFG_TUSB_OS_TICKS_PER_SECOND*1000; i++) // not enough time
osal_tick_tock();
sample_task_with_delay();
TEST_ASSERT_EQUAL(1, statements[0]);
}
//--------------------------------------------------------------------+
// TASK FLOW CONTROL
//--------------------------------------------------------------------+
void flow_control_error_handler(void)
{
statements[5]++;
}
tusb_error_t sample_flow_control_subtask2(void)
{
tusb_error_t error;
OSAL_SUBTASK_BEGIN
statements[0]++;
osal_semaphore_wait(sem_hdl, OSAL_TIMEOUT_NORMAL, &error);
SUBTASK_ASSERT(TUSB_ERROR_NONE == error);
statements[1]++;
osal_semaphore_wait(sem_hdl, OSAL_TIMEOUT_NORMAL, &error);
SUBTASK_ASSERT_STATUS(error);
statements[2]++;
osal_semaphore_wait(sem_hdl, OSAL_TIMEOUT_NORMAL, &error);
SUBTASK_ASSERT_STATUS_HDLR(error, flow_control_error_handler());
statements[3]++;
OSAL_SUBTASK_END
}
tusb_error_t sample_flow_control_subtask(void)
{
OSAL_SUBTASK_BEGIN
sample_flow_control_subtask2();
OSAL_SUBTASK_END
}
tusb_error_t sample_task_flow_control(void)
{
OSAL_TASK_LOOP_BEGIN
sample_flow_control_subtask();
OSAL_TASK_LOOP_END
}
void test_task_flow_control_assert(void)
{
sample_task_flow_control();
for(uint32_t i=0; i<(OSAL_TIMEOUT_NORMAL*CFG_TUSB_OS_TICKS_PER_SECOND)/1000 + 1; i++) osal_tick_tock();
sample_task_flow_control();
TEST_ASSERT_EQUAL(0, statements[1]);
}
void test_task_flow_control_assert_status(void)
{
for (uint8_t i=0; i<1; i++) osal_semaphore_post(sem_hdl);
sample_task_flow_control();
for(uint32_t i=0; i<(OSAL_TIMEOUT_NORMAL*CFG_TUSB_OS_TICKS_PER_SECOND)/1000 + 1; i++) osal_tick_tock();
sample_task_flow_control();
TEST_ASSERT_EQUAL(0, statements[2]);
}
void test_task_flow_control_assert_status_hanlder(void)
{
for (uint8_t i=0; i<2; i++) osal_semaphore_post(sem_hdl);
sample_task_flow_control();
for(uint32_t i=0; i<(OSAL_TIMEOUT_NORMAL*CFG_TUSB_OS_TICKS_PER_SECOND)/1000 + 1; i++) osal_tick_tock();
sample_task_flow_control();
TEST_ASSERT_EQUAL(0, statements[3]);
TEST_ASSERT_EQUAL(1, statements[5]);
}
#endif
|
the_stack_data/68523.c
|
// RUN: %clang_cc1 -triple x86_64-unknown-unknown -Wno-unused-value -std=gnu11 -ast-dump=json %s | FileCheck %s
void Comma(void) {
1, 2, 3;
}
void Assignment(int a) {
a = 12;
a += a;
}
void Conditionals(int a) {
a ? 0 : 1;
a ?: 0;
}
void BinaryOperators(int a, int b) {
// Logical operators
a || b;
a && b;
// Bitwise operators
a | b;
a ^ b;
a & b;
// Equality operators
a == b;
a != b;
// Relational operators
a < b;
a > b;
a <= b;
a >= b;
// Bit shifting operators
a << b;
a >> b;
// Additive operators
a + b;
a - b;
// Multiplicative operators
a * b;
a / b;
a % b;
}
void UnaryOperators(int a, int *b) {
// Cast operators
(float)a;
// ++, --, and ~ are covered elsewhere.
-a;
+a;
&a;
*b;
!a;
sizeof a;
sizeof(int);
_Alignof(int);
}
struct S {
int a;
};
void PostfixOperators(int *a, struct S b, struct S *c) {
a[0];
UnaryOperators(*a, a);
b.a;
c->a;
// Postfix ++ and -- are covered elsewhere.
(int [4]){1, 2, 3, 4, };
(struct S){1};
}
enum E { One };
void PrimaryExpressions(int a) {
a;
'a';
L'a';
"a";
L"a";
u8"a";
U"a";
u"a";
1;
1u;
1ll;
1.0;
1.0f;
0xFp100000000000000000000F;
1.0l;
One;
(a);
}
// NOTE: CHECK lines have been autogenerated by gen_ast_dump_json_test.py
// using --filters=FunctionDecl
// CHECK: "kind": "FunctionDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "file": "{{.*}}",
// CHECK-NEXT: "line": 3,
// CHECK-NEXT: "col": 6,
// CHECK-NEXT: "tokLen": 5
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "line": 5,
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "name": "Comma",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "void (void)"
// CHECK-NEXT: },
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "CompoundStmt",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 3,
// CHECK-NEXT: "col": 18,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "line": 5,
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 4,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 9,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": ",",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 6,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": ",",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "1"
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 6,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 6,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "2"
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 9,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 9,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "3"
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK: "kind": "FunctionDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "line": 7,
// CHECK-NEXT: "col": 6,
// CHECK-NEXT: "tokLen": 10
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "line": 10,
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "name": "Assignment",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "void (int)"
// CHECK-NEXT: },
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "line": 7,
// CHECK-NEXT: "col": 21,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 17,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 21,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "isUsed": true,
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "CompoundStmt",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 24,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "line": 10,
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 8,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 2
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "=",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 2
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 2
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "12"
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "CompoundAssignOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 9,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "+=",
// CHECK-NEXT: "computeLHSType": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "computeResultType": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK: "kind": "FunctionDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "line": 12,
// CHECK-NEXT: "col": 6,
// CHECK-NEXT: "tokLen": 12
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "line": 15,
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "name": "Conditionals",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "void (int)"
// CHECK-NEXT: },
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "line": 12,
// CHECK-NEXT: "col": 23,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 19,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 23,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "isUsed": true,
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "CompoundStmt",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 26,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "line": 15,
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ConditionalOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 13,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 11,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "0"
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 11,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 11,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "1"
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryConditionalOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 14,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "OpaqueValueExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "OpaqueValueExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "0"
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK: "kind": "FunctionDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "line": 17,
// CHECK-NEXT: "col": 6,
// CHECK-NEXT: "tokLen": 15
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "line": 49,
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "name": "BinaryOperators",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "void (int, int)"
// CHECK-NEXT: },
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "line": 17,
// CHECK-NEXT: "col": 26,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 22,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 26,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "isUsed": true,
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "col": 33,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 29,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 33,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "isUsed": true,
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "CompoundStmt",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 36,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "line": 49,
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 19,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "||",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 20,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "&&",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 23,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "|",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 24,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "^",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 25,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "&",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 28,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "==",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 29,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "!=",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 32,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "<",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 33,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": ">",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 34,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "<=",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 35,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": ">=",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 38,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "<<",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 39,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": ">>",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 8,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 42,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "+",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 43,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "-",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 46,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "*",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 47,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "/",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "BinaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 48,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "opcode": "%",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 7,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK: "kind": "FunctionDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "line": 51,
// CHECK-NEXT: "col": 6,
// CHECK-NEXT: "tokLen": 14
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "line": 66,
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "isUsed": true,
// CHECK-NEXT: "name": "UnaryOperators",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "void (int, int *)"
// CHECK-NEXT: },
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "line": 51,
// CHECK-NEXT: "col": 25,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 21,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 25,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "isUsed": true,
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "col": 33,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 28,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 33,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "isUsed": true,
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "CompoundStmt",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 36,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "line": 66,
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "CStyleCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 53,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 10,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "float"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "IntegralToFloating",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 10,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 10,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "isPartOfExplicitCast": true,
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 10,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 10,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "UnaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 57,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "isPostfix": false,
// CHECK-NEXT: "opcode": "-",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "UnaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 58,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "isPostfix": false,
// CHECK-NEXT: "opcode": "+",
// CHECK-NEXT: "canOverflow": false,
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "UnaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 59,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "isPostfix": false,
// CHECK-NEXT: "opcode": "&",
// CHECK-NEXT: "canOverflow": false,
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 60,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "UnaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "isPostfix": false,
// CHECK-NEXT: "opcode": "*",
// CHECK-NEXT: "canOverflow": false,
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "UnaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 61,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "isPostfix": false,
// CHECK-NEXT: "opcode": "!",
// CHECK-NEXT: "canOverflow": false,
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "UnaryExprOrTypeTraitExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 63,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 6
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 10,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "unsigned long"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "name": "sizeof",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 10,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 10,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "nonOdrUseReason": "unevaluated"
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "UnaryExprOrTypeTraitExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 64,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 6
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 13,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "unsigned long"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "name": "sizeof",
// CHECK-NEXT: "argType": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "UnaryExprOrTypeTraitExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 65,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 8
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 15,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "unsigned long"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "name": "alignof",
// CHECK-NEXT: "argType": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK: "kind": "FunctionDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "line": 72,
// CHECK-NEXT: "col": 6,
// CHECK-NEXT: "tokLen": 16
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "line": 83,
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "name": "PostfixOperators",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "void (int *, struct S, struct S *)"
// CHECK-NEXT: },
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "line": 72,
// CHECK-NEXT: "col": 28,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 23,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 28,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "isUsed": true,
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "col": 40,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 31,
// CHECK-NEXT: "tokLen": 6
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 40,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "isUsed": true,
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "desugaredQualType": "struct S",
// CHECK-NEXT: "qualType": "struct S"
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "col": 53,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 43,
// CHECK-NEXT: "tokLen": 6
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 53,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "isUsed": true,
// CHECK-NEXT: "name": "c",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "struct S *"
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "CompoundStmt",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 56,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "line": 83,
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 73,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 6,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ArraySubscriptExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 6,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 5,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 5,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "0"
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "CallExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 74,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 14
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 23,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "void"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 14
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 14
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "void (*)(int, int *)"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "FunctionToPointerDecay",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 14
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 14
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "void (int, int *)"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "FunctionDecl",
// CHECK-NEXT: "name": "UnaryOperators",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "void (int, int *)"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 18,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 19,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "UnaryOperator",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 18,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 19,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "isPostfix": false,
// CHECK-NEXT: "opcode": "*",
// CHECK-NEXT: "canOverflow": false,
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 19,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 19,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 19,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 19,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 22,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 22,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 22,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 22,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 76,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 5,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "MemberExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 5,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "isArrow": false,
// CHECK-NEXT: "referencedMemberDecl": "0x{{.*}}",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "desugaredQualType": "struct S",
// CHECK-NEXT: "qualType": "struct S"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "b",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "desugaredQualType": "struct S",
// CHECK-NEXT: "qualType": "struct S"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 77,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 6,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "MemberExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 6,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "isArrow": true,
// CHECK-NEXT: "referencedMemberDecl": "0x{{.*}}",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "struct S *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "struct S *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "c",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "struct S *"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 81,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 25,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "ArrayToPointerDecay",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "CompoundLiteralExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 25,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int [4]"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "InitListExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 12,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 25,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int [4]"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 13,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 13,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "1"
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 16,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 16,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "2"
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 19,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 19,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "3"
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 22,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 22,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "4"
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 82,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 15,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "desugaredQualType": "struct S",
// CHECK-NEXT: "qualType": "struct S"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "CompoundLiteralExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 15,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "desugaredQualType": "struct S",
// CHECK-NEXT: "qualType": "struct S"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "InitListExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 13,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 15,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "desugaredQualType": "struct S",
// CHECK-NEXT: "qualType": "struct S"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 14,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 14,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "1"
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK: "kind": "FunctionDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "line": 87,
// CHECK-NEXT: "col": 6,
// CHECK-NEXT: "tokLen": 18
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "line": 107,
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "name": "PrimaryExpressions",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "void (int)"
// CHECK-NEXT: },
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "loc": {
// CHECK-NEXT: "line": 87,
// CHECK-NEXT: "col": 29,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 25,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 29,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "isUsed": true,
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "CompoundStmt",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 32,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "line": 107,
// CHECK-NEXT: "col": 1,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 88,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "CharacterLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 89,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": 97
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "CharacterLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 90,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": 97
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 91,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "char *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "ArrayToPointerDecay",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "StringLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "char [2]"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "value": "\"a\""
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 92,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "ArrayToPointerDecay",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "StringLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int [2]"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "value": "L\"a\""
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 93,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 5
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 5
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "char *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "ArrayToPointerDecay",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "StringLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 5
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 5
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "char [2]"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "value": "u8\"a\""
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 94,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "unsigned int *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "ArrayToPointerDecay",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "StringLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "unsigned int [2]"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "value": "U\"a\""
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 95,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "unsigned short *"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "ArrayToPointerDecay",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "StringLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "unsigned short [2]"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "value": "u\"a\""
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 97,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "1"
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 98,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 2
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 2
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "unsigned int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "1"
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "IntegerLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 99,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "long long"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "1"
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "FloatingLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 100,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "double"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "1"
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "FloatingLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 101,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "float"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "1"
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "FloatingLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 102,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 26
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 26
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "float"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "+Inf"
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "FloatingLiteral",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 103,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 4
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "long double"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "value": "1"
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 104,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 3
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "EnumConstantDecl",
// CHECK-NEXT: "name": "One",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ImplicitCastExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "line": 106,
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 5,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "rvalue",
// CHECK-NEXT: "castKind": "LValueToRValue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParenExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 3,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 5,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "inner": [
// CHECK-NEXT: {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "DeclRefExpr",
// CHECK-NEXT: "range": {
// CHECK-NEXT: "begin": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: },
// CHECK-NEXT: "end": {
// CHECK-NEXT: "col": 4,
// CHECK-NEXT: "tokLen": 1
// CHECK-NEXT: }
// CHECK-NEXT: },
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: },
// CHECK-NEXT: "valueCategory": "lvalue",
// CHECK-NEXT: "referencedDecl": {
// CHECK-NEXT: "id": "0x{{.*}}",
// CHECK-NEXT: "kind": "ParmVarDecl",
// CHECK-NEXT: "name": "a",
// CHECK-NEXT: "type": {
// CHECK-NEXT: "qualType": "int"
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
// CHECK-NEXT: ]
// CHECK-NEXT: }
|
the_stack_data/109958.c
|
typedef int Int32;
void use_it(int);
void FindAndReadSignature(int processedSize)
{
int numPrevBytes = 1;
for (;;)
{
int numBytesInBuffer = numPrevBytes + processedSize;
Int32 numTests = numBytesInBuffer - 1;
use_it (numTests);
numPrevBytes = numBytesInBuffer - numTests;
}
}
|
the_stack_data/31387955.c
|
/*
Write a program to calculate y raised to power x using pow() function.
*/
// Don't forget to link this program with math library
#include <stdio.h>
#include <math.h>
int main() {
int x, y;
long int result;
printf("Enter a base number: ");
scanf("%d", &y);
printf("\nEnter a power: ");
scanf("%d", &x);
result = pow(y, x);
printf("\n%d raised to power %d is %ld \n", y, x, result);
return 0;
}
|
the_stack_data/175142326.c
|
#include <stdio.h>
int main()
{
}
|
the_stack_data/740322.c
|
#include <assert.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char* readline();
// Complete the primality function below.
// Please either make the string static or allocate on the heap. For example,
// static char str[] = "hello world";
// return str;
//
// OR
//
// char* str = "hello world";
// return str;
//
char* primality(int n) {
if(n%2==0 && n!=2 || n==1){
return "Not prime";
}
for(int i=2; i<(int)sqrt(n)+1; ++i){
if(n%i==0){
return "Not prime";
}
}
return "Prime";
}
int main()
{
FILE* fptr = fopen(getenv("OUTPUT_PATH"), "w");
char* p_endptr;
char* p_str = readline();
int p = strtol(p_str, &p_endptr, 10);
if (p_endptr == p_str || *p_endptr != '\0') { exit(EXIT_FAILURE); }
for (int p_itr = 0; p_itr < p; p_itr++) {
char* n_endptr;
char* n_str = readline();
int n = strtol(n_str, &n_endptr, 10);
if (n_endptr == n_str || *n_endptr != '\0') { exit(EXIT_FAILURE); }
char* result = primality(n);
fprintf(fptr, "%s\n", result);
}
fclose(fptr);
return 0;
}
char* readline() {
size_t alloc_length = 1024;
size_t data_length = 0;
char* data = malloc(alloc_length);
while (true) {
char* cursor = data + data_length;
char* line = fgets(cursor, alloc_length - data_length, stdin);
if (!line) {
break;
}
data_length += strlen(cursor);
if (data_length < alloc_length - 1 || data[data_length - 1] == '\n') {
break;
}
alloc_length <<= 1;
data = realloc(data, alloc_length);
if (!line) {
break;
}
}
if (data[data_length - 1] == '\n') {
data[data_length - 1] = '\0';
data = realloc(data, data_length);
} else {
data = realloc(data, data_length + 1);
data[data_length] = '\0';
}
return data;
}
|
the_stack_data/237642321.c
|
#include <stdio.h>
// C rmsbolt starter file
// Local Variables:
// rmsbolt-command: "/opt/riscv/bin/riscv32-unknown-elf-gcc -O0"
// rmsbolt-disassemble: nil
// End:
int f(int x){
if (x == 0) return 0;
if (x == 1) return 1;
return f(x-1) + f(x-2);
}
int main() {
return f(4);
}
|
the_stack_data/20451459.c
|
#include<ncurses.h>
#include<stdlib.h>
#define ARRAY_SIZE 16
#define SLEEP_TIME 100
//--------------------------------------------------------
// FUNCTION PROTOTYPES
//--------------------------------------------------------
void copy_board(char dst[ARRAY_SIZE][ARRAY_SIZE], char src[ARRAY_SIZE][ARRAY_SIZE]);
void clear_board(char some_board[ARRAY_SIZE][ARRAY_SIZE], char which_char);
void print_board(char some_board[ARRAY_SIZE][ARRAY_SIZE]);
void update(char current_board[ARRAY_SIZE][ARRAY_SIZE], char old_board[ARRAY_SIZE][ARRAY_SIZE]);
void clear_board(char some_board[ARRAY_SIZE][ARRAY_SIZE], char which_char){
for(int row=0; row<ARRAY_SIZE; row++){
for(int col=0; col<ARRAY_SIZE; col++){
some_board[row][col] = which_char;
}
}
}
void print_horz_border(){
addch(' ');
for(int col=0; col<ARRAY_SIZE; col++){
addch('_');
addch('_');
}
addch('\n');
}
void print_board(char some_board[ARRAY_SIZE][ARRAY_SIZE]){
print_horz_border();
for(int row=ARRAY_SIZE-1; row>=0; row--){
addch('|');
for(int col=0; col<ARRAY_SIZE; col++){
addch(some_board[col][row]);
addch(' ');
}
addch('|');
addch('\n');
}
print_horz_border();
}
void copy_board(char dst[ARRAY_SIZE][ARRAY_SIZE], char src[ARRAY_SIZE][ARRAY_SIZE]){
for(int row=0; row<ARRAY_SIZE; row++){
for(int col=0; col<ARRAY_SIZE; col++){
dst[ARRAY_SIZE][ARRAY_SIZE] = src[ARRAY_SIZE][ARRAY_SIZE];
}
}
}
void update(char current_board[ARRAY_SIZE][ARRAY_SIZE], char old_board[ARRAY_SIZE][ARRAY_SIZE]){
clear();
print_board(current_board);
copy_board(old_board, current_board);
refresh();
// napms(SLEEP_TIME);
}
int bound_position(int location){
if (location >= ARRAY_SIZE){
location = ARRAY_SIZE - 1;
}
else if (location < 0){
location = 0;
}
return location;
}
int main(void)
{
char tmp_board[ARRAY_SIZE][ARRAY_SIZE];
// int sleep_time = 1000;
int character_code;
int player_x = 5, player_y = 5, player_big = 0;
char board[ARRAY_SIZE][ARRAY_SIZE];
int done = 0;
int mush_x = 9, mush_y = 4, mush_exists = 1;
initscr();
while(done == 0){
// Setup a turn.
clear_board(board, ' ');
// Turn logic.
if (mush_exists){
board[mush_x][mush_y] = 'o';
}
if (player_big){
board[player_x][player_y] = 'X';
}else{
board[player_x][player_y] = 'x';
}
// Draw the turn to the screen.
update(board, tmp_board);
char letter = getch();
if (letter == 'w') {
player_y++;
}
else if (letter == 's'){
player_y--;
}
else if (letter == 'd'){
player_x++;
}
else if (letter == 'a'){
player_x--;
}
player_x = bound_position(player_x);
player_y = bound_position(player_y);
if (player_x == mush_x && player_y == mush_y){
mush_exists = 0;
player_big = 1;
}
}
addstr("\npress any key to exit...");
refresh();
getch();
endwin();
return EXIT_SUCCESS;
}
|
the_stack_data/27827.c
|
#include <stdio.h>
#include <stdlib.h>
int example(int argc, char* argv[])
{
return 0;
}
#if defined(__arm__)
void example_1()
{
__asm__ __volatile__(
"ADD R0,R0,#1 \n"
"SUB R0,R0,#1"
);
}
/*
__inline void endable_IRQ(void)
{
int tmp;
__asm{
MRS tmp,CPSR
BIC tmp,tmp,#0x80
MSR CPSR_c,tmp
}
}
*/
void example_2()
{
__asm__ __volatile__(
"mov r0,r0\n"
"mov r1,r1\n"
"mov r2,r2"
);
}
/* 使用占位符 */
void example_3()
{
int a = 100;
int b = 200;
int result;
__asm__ __volatile__(
"mov %0, %3\n"
"ldr r0, %1\n"
"ldr r1, %2\n"
"str r0, %2\n"
"str r1, %1\n"
:"=r"(result),"+m"(a),"+m"(b)
:"i"(123)
);
}
/* 引用占位符 */
void example_4()
{
int num = 100;
__asm__ __volatile__(
"add %0,%1,#100\n"
:"=r"(num)
:"0"(num) /* 0 就是%0，引用时不必加% */
);
/* &修饰符 */
__asm__ __volatile__(
"mov %0,%1\n"
:"=r"(num)
:"r"(123)
);
__asm__ __volatile__(
"mov %0,%1\n"
:"=&r"(num)
:"r"(123)
);
/* changed */
__asm__ __volatile__(
"mov r4,#123"
);
__asm__ __volatile__(
"mov r4,#123"
:
:
:"r4"
);
}
#endif
|
the_stack_data/61075023.c
|
int main(void){
int x = 5;
int *p = &x;
(int*)p;
}
|
the_stack_data/88065.c
|
#include <assert.h>
#include <stdint.h>
#include <stdio.h>
#define YEAR_MASK 0x7F
#define MONTH_MASK 0xFF
#define DAY_MASK 0x1F
#define DAY_SHIFT 7
#define MONTH_SHIFT 12
#define MIN_DATE 0x1001
#define YEAR_OFFSET 0x7D0
uint16_t empaquetar_fecha(unsigned int dia, unsigned int mes, unsigned int anio) {
//! IMPORTANT: No se valida la coherencia de las fechas (E.g.: Año bisiesto, Meses con 30 o 31 dias)
if (anio < 2000 || anio > 2127)
return 0;
if (mes < 1 || mes > 12)
return 0;
if (dia < 1 || dia > 31)
return 0;
return (mes & MONTH_MASK) << MONTH_SHIFT | (dia & DAY_MASK) << DAY_SHIFT | ((anio & ~YEAR_OFFSET) & YEAR_MASK);
}
void desempaquetar_fecha(uint16_t reg, unsigned int *dia, unsigned int *mes, unsigned int *anio) {
if (reg < MIN_DATE)
return;
*dia = (reg >> DAY_SHIFT) & DAY_MASK;
*mes = (reg >> MONTH_SHIFT) & MONTH_MASK;
*anio = (reg & YEAR_MASK) | YEAR_OFFSET;
}
int main(void) {
// 0 1 0 0|0 0 0 1 0|0 0 0 0 0 0 1
// 4 | 2 | 2001
assert(empaquetar_fecha(2, 4, 2001) == 0x4101);
unsigned int dia, mes, anio;
desempaquetar_fecha(0x4101, &dia, &mes, &anio);
assert(dia == 2);
assert(mes == 4);
assert(anio == 2001);
// OPCIONAL: Pruebas adicionales
printf("%s: OK\n", __FILE__);
return 0;
}
|
the_stack_data/1139405.c
|
#ifdef FLA_ENABLE_XBLAS
/* ../netlib/dgesvxx.f -- translated by f2c (version 20100827). You must link the resulting object file with libf2c: on Microsoft Windows system, link with libf2c.lib;
on Linux or Unix systems, link with .../path/to/libf2c.a -lm or, if you install libf2c.a in a standard place, with -lf2c -lm -- in that order, at the end of the command line, as in cc *.o -lf2c -lm Source for libf2c is in /netlib/f2c/libf2c.zip, e.g., http://www.netlib.org/f2c/libf2c.zip */
#include "FLA_f2c.h" /* > \brief <b> DGESVXX computes the solution to system of linear equations A * X = B for GE matrices</b> */
/* =========== DOCUMENTATION =========== */
/* Online html documentation available at */
/* http://www.netlib.org/lapack/explore-html/ */
/* > \htmlonly */
/* > Download DGESVXX + dependencies */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/dgesvxx .f"> */
/* > [TGZ]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/dgesvxx .f"> */
/* > [ZIP]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/dgesvxx .f"> */
/* > [TXT]</a> */
/* > \endhtmlonly */
/* Definition: */
/* =========== */
/* SUBROUTINE DGESVXX( FACT, TRANS, N, NRHS, A, LDA, AF, LDAF, IPIV, */
/* EQUED, R, C, B, LDB, X, LDX, RCOND, RPVGRW, */
/* BERR, N_ERR_BNDS, ERR_BNDS_NORM, */
/* ERR_BNDS_COMP, NPARAMS, PARAMS, WORK, IWORK, */
/* INFO ) */
/* .. Scalar Arguments .. */
/* CHARACTER EQUED, FACT, TRANS */
/* INTEGER INFO, LDA, LDAF, LDB, LDX, N, NRHS, NPARAMS, */
/* $ N_ERR_BNDS */
/* DOUBLE PRECISION RCOND, RPVGRW */
/* .. */
/* .. Array Arguments .. */
/* INTEGER IPIV( * ), IWORK( * ) */
/* DOUBLE PRECISION A( LDA, * ), AF( LDAF, * ), B( LDB, * ), */
/* $ X( LDX , * ),WORK( * ) */
/* DOUBLE PRECISION R( * ), C( * ), PARAMS( * ), BERR( * ), */
/* $ ERR_BNDS_NORM( NRHS, * ), */
/* $ ERR_BNDS_COMP( NRHS, * ) */
/* .. */
/* > \par Purpose: */
/* ============= */
/* > */
/* > \verbatim */
/* > */
/* > DGESVXX uses the LU factorization to compute the solution to a */
/* > double precision system of linear equations A * X = B, where A is an */
/* > N-by-N matrix and X and B are N-by-NRHS matrices. */
/* > */
/* > If requested, both normwise and maximum componentwise error bounds */
/* > are returned. DGESVXX will return a solution with a tiny */
/* > guaranteed error (O(eps) where eps is the working machine */
/* > precision) unless the matrix is very ill-conditioned, in which */
/* > case a warning is returned. Relevant condition numbers also are */
/* > calculated and returned. */
/* > */
/* > DGESVXX accepts user-provided factorizations and equilibration */
/* > factors;
see the definitions of the FACT and EQUED options. */
/* > Solving with refinement and using a factorization from a previous */
/* > DGESVXX call will also produce a solution with either O(eps) */
/* > errors or warnings, but we cannot make that claim for general */
/* > user-provided factorizations and equilibration factors if they */
/* > differ from what DGESVXX would itself produce. */
/* > \endverbatim */
/* > \par Description: */
/* ================= */
/* > */
/* > \verbatim */
/* > */
/* > The following steps are performed: */
/* > */
/* > 1. If FACT = 'E', double precision scaling factors are computed to equilibrate */
/* > the system: */
/* > */
/* > TRANS = 'N': diag(R)*A*diag(C) *inv(diag(C))*X = diag(R)*B */
/* > TRANS = 'T': (diag(R)*A*diag(C))**T *inv(diag(R))*X = diag(C)*B */
/* > TRANS = 'C': (diag(R)*A*diag(C))**H *inv(diag(R))*X = diag(C)*B */
/* > */
/* > Whether or not the system will be equilibrated depends on the */
/* > scaling of the matrix A, but if equilibration is used, A is */
/* > overwritten by diag(R)*A*diag(C) and B by diag(R)*B (if TRANS='N') */
/* > or diag(C)*B (if TRANS = 'T' or 'C'). */
/* > */
/* > 2. If FACT = 'N' or 'E', the LU decomposition is used to factor */
/* > the matrix A (after equilibration if FACT = 'E') as */
/* > */
/* > A = P * L * U, */
/* > */
/* > where P is a permutation matrix, L is a unit lower triangular */
/* > matrix, and U is upper triangular. */
/* > */
/* > 3. If some U(i,i)=0, so that U is exactly singular, then the */
/* > routine returns with INFO = i. Otherwise, the factored form of A */
/* > is used to estimate the condition number of the matrix A (see */
/* > argument RCOND). If the reciprocal of the condition number is less */
/* > than machine precision, the routine still goes on to solve for X */
/* > and compute error bounds as described below. */
/* > */
/* > 4. The system of equations is solved for X using the factored form */
/* > of A. */
/* > */
/* > 5. By default (unless PARAMS(LA_LINRX_ITREF_I) is set to zero), */
/* > the routine will use iterative refinement to try to get a small */
/* > error and error bounds. Refinement calculates the residual to at */
/* > least twice the working precision. */
/* > */
/* > 6. If equilibration was used, the matrix X is premultiplied by */
/* > diag(C) (if TRANS = 'N') or diag(R) (if TRANS = 'T' or 'C') so */
/* > that it solves the original system before equilibration. */
/* > \endverbatim */
/* Arguments: */
/* ========== */
/* > \verbatim */
/* > Some optional parameters are bundled in the PARAMS array. These */
/* > settings determine how refinement is performed, but often the */
/* > defaults are acceptable. If the defaults are acceptable, users */
/* > can pass NPARAMS = 0 which prevents the source code from accessing */
/* > the PARAMS argument. */
/* > \endverbatim */
/* > */
/* > \param[in] FACT */
/* > \verbatim */
/* > FACT is CHARACTER*1 */
/* > Specifies whether or not the factored form of the matrix A is */
/* > supplied on entry, and if not, whether the matrix A should be */
/* > equilibrated before it is factored. */
/* > = 'F': On entry, AF and IPIV contain the factored form of A. */
/* > If EQUED is not 'N', the matrix A has been */
/* > equilibrated with scaling factors given by R and C. */
/* > A, AF, and IPIV are not modified. */
/* > = 'N': The matrix A will be copied to AF and factored. */
/* > = 'E': The matrix A will be equilibrated if necessary, then */
/* > copied to AF and factored. */
/* > \endverbatim */
/* > */
/* > \param[in] TRANS */
/* > \verbatim */
/* > TRANS is CHARACTER*1 */
/* > Specifies the form of the system of equations: */
/* > = 'N': A * X = B (No transpose) */
/* > = 'T': A**T * X = B (Transpose) */
/* > = 'C': A**H * X = B (Conjugate Transpose = Transpose) */
/* > \endverbatim */
/* > */
/* > \param[in] N */
/* > \verbatim */
/* > N is INTEGER */
/* > The number of linear equations, i.e., the order of the */
/* > matrix A. N >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in] NRHS */
/* > \verbatim */
/* > NRHS is INTEGER */
/* > The number of right hand sides, i.e., the number of columns */
/* > of the matrices B and X. NRHS >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in,out] A */
/* > \verbatim */
/* > A is DOUBLE PRECISION array, dimension (LDA,N) */
/* > On entry, the N-by-N matrix A. If FACT = 'F' and EQUED is */
/* > not 'N', then A must have been equilibrated by the scaling */
/* > factors in R and/or C. A is not modified if FACT = 'F' or */
/* > 'N', or if FACT = 'E' and EQUED = 'N' on exit. */
/* > */
/* > On exit, if EQUED .ne. 'N', A is scaled as follows: */
/* > EQUED = 'R': A := diag(R) * A */
/* > EQUED = 'C': A := A * diag(C) */
/* > EQUED = 'B': A := diag(R) * A * diag(C). */
/* > \endverbatim */
/* > */
/* > \param[in] LDA */
/* > \verbatim */
/* > LDA is INTEGER */
/* > The leading dimension of the array A. LDA >= max(1,N). */
/* > \endverbatim */
/* > */
/* > \param[in,out] AF */
/* > \verbatim */
/* > AF is DOUBLE PRECISION array, dimension (LDAF,N) */
/* > If FACT = 'F', then AF is an input argument and on entry */
/* > contains the factors L and U from the factorization */
/* > A = P*L*U as computed by DGETRF. If EQUED .ne. 'N', then */
/* > AF is the factored form of the equilibrated matrix A. */
/* > */
/* > If FACT = 'N', then AF is an output argument and on exit */
/* > returns the factors L and U from the factorization A = P*L*U */
/* > of the original matrix A. */
/* > */
/* > If FACT = 'E', then AF is an output argument and on exit */
/* > returns the factors L and U from the factorization A = P*L*U */
/* > of the equilibrated matrix A (see the description of A for */
/* > the form of the equilibrated matrix). */
/* > \endverbatim */
/* > */
/* > \param[in] LDAF */
/* > \verbatim */
/* > LDAF is INTEGER */
/* > The leading dimension of the array AF. LDAF >= max(1,N). */
/* > \endverbatim */
/* > */
/* > \param[in,out] IPIV */
/* > \verbatim */
/* > IPIV is INTEGER array, dimension (N) */
/* > If FACT = 'F', then IPIV is an input argument and on entry */
/* > contains the pivot indices from the factorization A = P*L*U */
/* > as computed by DGETRF;
row i of the matrix was interchanged */
/* > with row IPIV(i). */
/* > */
/* > If FACT = 'N', then IPIV is an output argument and on exit */
/* > contains the pivot indices from the factorization A = P*L*U */
/* > of the original matrix A. */
/* > */
/* > If FACT = 'E', then IPIV is an output argument and on exit */
/* > contains the pivot indices from the factorization A = P*L*U */
/* > of the equilibrated matrix A. */
/* > \endverbatim */
/* > */
/* > \param[in,out] EQUED */
/* > \verbatim */
/* > EQUED is CHARACTER*1 */
/* > Specifies the form of equilibration that was done. */
/* > = 'N': No equilibration (always true if FACT = 'N'). */
/* > = 'R': Row equilibration, i.e., A has been premultiplied by */
/* > diag(R). */
/* > = 'C': Column equilibration, i.e., A has been postmultiplied */
/* > by diag(C). */
/* > = 'B': Both row and column equilibration, i.e., A has been */
/* > replaced by diag(R) * A * diag(C). */
/* > EQUED is an input argument if FACT = 'F';
otherwise, it is an */
/* > output argument. */
/* > \endverbatim */
/* > */
/* > \param[in,out] R */
/* > \verbatim */
/* > R is DOUBLE PRECISION array, dimension (N) */
/* > The row scale factors for A. If EQUED = 'R' or 'B', A is */
/* > multiplied on the left by diag(R);
if EQUED = 'N' or 'C', R */
/* > is not accessed. R is an input argument if FACT = 'F';
*/
/* > otherwise, R is an output argument. If FACT = 'F' and */
/* > EQUED = 'R' or 'B', each element of R must be positive. */
/* > If R is output, each element of R is a power of the radix. */
/* > If R is input, each element of R should be a power of the radix */
/* > to ensure a reliable solution and error estimates. Scaling by */
/* > powers of the radix does not cause rounding errors unless the */
/* > result underflows or overflows. Rounding errors during scaling */
/* > lead to refining with a matrix that is not equivalent to the */
/* > input matrix, producing error estimates that may not be */
/* > reliable. */
/* > \endverbatim */
/* > */
/* > \param[in,out] C */
/* > \verbatim */
/* > C is DOUBLE PRECISION array, dimension (N) */
/* > The column scale factors for A. If EQUED = 'C' or 'B', A is */
/* > multiplied on the right by diag(C);
if EQUED = 'N' or 'R', C */
/* > is not accessed. C is an input argument if FACT = 'F';
*/
/* > otherwise, C is an output argument. If FACT = 'F' and */
/* > EQUED = 'C' or 'B', each element of C must be positive. */
/* > If C is output, each element of C is a power of the radix. */
/* > If C is input, each element of C should be a power of the radix */
/* > to ensure a reliable solution and error estimates. Scaling by */
/* > powers of the radix does not cause rounding errors unless the */
/* > result underflows or overflows. Rounding errors during scaling */
/* > lead to refining with a matrix that is not equivalent to the */
/* > input matrix, producing error estimates that may not be */
/* > reliable. */
/* > \endverbatim */
/* > */
/* > \param[in,out] B */
/* > \verbatim */
/* > B is DOUBLE PRECISION array, dimension (LDB,NRHS) */
/* > On entry, the N-by-NRHS right hand side matrix B. */
/* > On exit, */
/* > if EQUED = 'N', B is not modified;
*/
/* > if TRANS = 'N' and EQUED = 'R' or 'B', B is overwritten by */
/* > diag(R)*B;
*/
/* > if TRANS = 'T' or 'C' and EQUED = 'C' or 'B', B is */
/* > overwritten by diag(C)*B. */
/* > \endverbatim */
/* > */
/* > \param[in] LDB */
/* > \verbatim */
/* > LDB is INTEGER */
/* > The leading dimension of the array B. LDB >= max(1,N). */
/* > \endverbatim */
/* > */
/* > \param[out] X */
/* > \verbatim */
/* > X is DOUBLE PRECISION array, dimension (LDX,NRHS) */
/* > If INFO = 0, the N-by-NRHS solution matrix X to the original */
/* > system of equations. Note that A and B are modified on exit */
/* > if EQUED .ne. 'N', and the solution to the equilibrated system is */
/* > inv(diag(C))*X if TRANS = 'N' and EQUED = 'C' or 'B', or */
/* > inv(diag(R))*X if TRANS = 'T' or 'C' and EQUED = 'R' or 'B'. */
/* > \endverbatim */
/* > */
/* > \param[in] LDX */
/* > \verbatim */
/* > LDX is INTEGER */
/* > The leading dimension of the array X. LDX >= max(1,N). */
/* > \endverbatim */
/* > */
/* > \param[out] RCOND */
/* > \verbatim */
/* > RCOND is DOUBLE PRECISION */
/* > Reciprocal scaled condition number. This is an estimate of the */
/* > reciprocal Skeel condition number of the matrix A after */
/* > equilibration (if done). If this is less than the machine */
/* > precision (in particular, if it is zero), the matrix is singular */
/* > to working precision. Note that the error may still be small even */
/* > if this number is very small and the matrix appears ill- */
/* > conditioned. */
/* > \endverbatim */
/* > */
/* > \param[out] RPVGRW */
/* > \verbatim */
/* > RPVGRW is DOUBLE PRECISION */
/* > Reciprocal pivot growth. On exit, this contains the reciprocal */
/* > pivot growth factor norm(A)/norm(U). The "max absolute element" */
/* > norm is used. If this is much less than 1, then the stability of */
/* > the LU factorization of the (equilibrated) matrix A could be poor. */
/* > This also means that the solution X, estimated condition numbers, */
/* > and error bounds could be unreliable. If factorization fails with */
/* > 0<INFO<=N, then this contains the reciprocal pivot growth factor */
/* > for the leading INFO columns of A. In DGESVX, this quantity is */
/* > returned in WORK(1). */
/* > \endverbatim */
/* > */
/* > \param[out] BERR */
/* > \verbatim */
/* > BERR is DOUBLE PRECISION array, dimension (NRHS) */
/* > Componentwise relative backward error. This is the */
/* > componentwise relative backward error of each solution vector X(j) */
/* > (i.e., the smallest relative change in any element of A or B that */
/* > makes X(j) an exact solution). */
/* > \endverbatim */
/* > */
/* > \param[in] N_ERR_BNDS */
/* > \verbatim */
/* > N_ERR_BNDS is INTEGER */
/* > Number of error bounds to return for each right hand side */
/* > and each type (normwise or componentwise). See ERR_BNDS_NORM and */
/* > ERR_BNDS_COMP below. */
/* > \endverbatim */
/* > */
/* > \param[out] ERR_BNDS_NORM */
/* > \verbatim */
/* > ERR_BNDS_NORM is DOUBLE PRECISION array, dimension (NRHS, N_ERR_BNDS) */
/* > For each right-hand side, this array contains information about */
/* > various error bounds and condition numbers corresponding to the */
/* > normwise relative error, which is defined as follows: */
/* > */
/* > Normwise relative error in the ith solution vector: */
/* > max_j (f2c_dabs(XTRUE(j,i) - X(j,i))) */
/* > ------------------------------ */
/* > max_j f2c_dabs(X(j,i)) */
/* > */
/* > The array is indexed by the type of error information as described */
/* > below. There currently are up to three pieces of information */
/* > returned. */
/* > */
/* > The first index in ERR_BNDS_NORM(i,:) corresponds to the ith */
/* > right-hand side. */
/* > */
/* > The second index in ERR_BNDS_NORM(:,err) contains the following */
/* > three fields: */
/* > err = 1 "Trust/don't trust" boolean. Trust the answer if the */
/* > reciprocal condition number is less than the threshold */
/* > sqrt(n) * dlamch('Epsilon'). */
/* > */
/* > err = 2 "Guaranteed" error bound: The estimated forward error, */
/* > almost certainly within a factor of 10 of the true error */
/* > so long as the next entry is greater than the threshold */
/* > sqrt(n) * dlamch('Epsilon'). This error bound should only */
/* > be trusted if the previous boolean is true. */
/* > */
/* > err = 3 Reciprocal condition number: Estimated normwise */
/* > reciprocal condition number. Compared with the threshold */
/* > sqrt(n) * dlamch('Epsilon') to determine if the error */
/* > estimate is "guaranteed". These reciprocal condition */
/* > numbers are 1 / (norm(Z^{
-1}
,inf) * norm(Z,inf)) for some */
/* > appropriately scaled matrix Z. */
/* > Let Z = S*A, where S scales each row by a power of the */
/* > radix so all absolute row sums of Z are approximately 1. */
/* > */
/* > See Lapack Working Note 165 for further details and extra */
/* > cautions. */
/* > \endverbatim */
/* > */
/* > \param[out] ERR_BNDS_COMP */
/* > \verbatim */
/* > ERR_BNDS_COMP is DOUBLE PRECISION array, dimension (NRHS, N_ERR_BNDS) */
/* > For each right-hand side, this array contains information about */
/* > various error bounds and condition numbers corresponding to the */
/* > componentwise relative error, which is defined as follows: */
/* > */
/* > Componentwise relative error in the ith solution vector: */
/* > f2c_dabs(XTRUE(j,i) - X(j,i)) */
/* > max_j ---------------------- */
/* > f2c_dabs(X(j,i)) */
/* > */
/* > The array is indexed by the right-hand side i (on which the */
/* > componentwise relative error depends), and the type of error */
/* > information as described below. There currently are up to three */
/* > pieces of information returned for each right-hand side. If */
/* > componentwise accuracy is not requested (PARAMS(3) = 0.0), then */
/* > ERR_BNDS_COMP is not accessed. If N_ERR_BNDS .LT. 3, then at most */
/* > the first (:,N_ERR_BNDS) entries are returned. */
/* > */
/* > The first index in ERR_BNDS_COMP(i,:) corresponds to the ith */
/* > right-hand side. */
/* > */
/* > The second index in ERR_BNDS_COMP(:,err) contains the following */
/* > three fields: */
/* > err = 1 "Trust/don't trust" boolean. Trust the answer if the */
/* > reciprocal condition number is less than the threshold */
/* > sqrt(n) * dlamch('Epsilon'). */
/* > */
/* > err = 2 "Guaranteed" error bound: The estimated forward error, */
/* > almost certainly within a factor of 10 of the true error */
/* > so long as the next entry is greater than the threshold */
/* > sqrt(n) * dlamch('Epsilon'). This error bound should only */
/* > be trusted if the previous boolean is true. */
/* > */
/* > err = 3 Reciprocal condition number: Estimated componentwise */
/* > reciprocal condition number. Compared with the threshold */
/* > sqrt(n) * dlamch('Epsilon') to determine if the error */
/* > estimate is "guaranteed". These reciprocal condition */
/* > numbers are 1 / (norm(Z^{
-1}
,inf) * norm(Z,inf)) for some */
/* > appropriately scaled matrix Z. */
/* > Let Z = S*(A*diag(x)), where x is the solution for the */
/* > current right-hand side and S scales each row of */
/* > A*diag(x) by a power of the radix so all absolute row */
/* > sums of Z are approximately 1. */
/* > */
/* > See Lapack Working Note 165 for further details and extra */
/* > cautions. */
/* > \endverbatim */
/* > */
/* > \param[in] NPARAMS */
/* > \verbatim */
/* > NPARAMS is INTEGER */
/* > Specifies the number of parameters set in PARAMS. If .LE. 0, the */
/* > PARAMS array is never referenced and default values are used. */
/* > \endverbatim */
/* > */
/* > \param[in,out] PARAMS */
/* > \verbatim */
/* > PARAMS is DOUBLE PRECISION array, dimension (NPARAMS) */
/* > Specifies algorithm parameters. If an entry is .LT. 0.0, then */
/* > that entry will be filled with default value used for that */
/* > parameter. Only positions up to NPARAMS are accessed;
defaults */
/* > are used for higher-numbered parameters. */
/* > */
/* > PARAMS(LA_LINRX_ITREF_I = 1) : Whether to perform iterative */
/* > refinement or not. */
/* > Default: 1.0D+0 */
/* > = 0.0 : No refinement is performed, and no error bounds are */
/* > computed. */
/* > = 1.0 : Use the extra-precise refinement algorithm. */
/* > (other values are reserved for future use) */
/* > */
/* > PARAMS(LA_LINRX_ITHRESH_I = 2) : Maximum number of residual */
/* > computations allowed for refinement. */
/* > Default: 10 */
/* > Aggressive: Set to 100 to permit convergence using approximate */
/* > factorizations or factorizations other than LU. If */
/* > the factorization uses a technique other than */
/* > Gaussian elimination, the guarantees in */
/* > err_bnds_norm and err_bnds_comp may no longer be */
/* > trustworthy. */
/* > */
/* > PARAMS(LA_LINRX_CWISE_I = 3) : Flag determining if the code */
/* > will attempt to find a solution with small componentwise */
/* > relative error in the double-precision algorithm. Positive */
/* > is true, 0.0 is false. */
/* > Default: 1.0 (attempt componentwise convergence) */
/* > \endverbatim */
/* > */
/* > \param[out] WORK */
/* > \verbatim */
/* > WORK is DOUBLE PRECISION array, dimension (4*N) */
/* > \endverbatim */
/* > */
/* > \param[out] IWORK */
/* > \verbatim */
/* > IWORK is INTEGER array, dimension (N) */
/* > \endverbatim */
/* > */
/* > \param[out] INFO */
/* > \verbatim */
/* > INFO is INTEGER */
/* > = 0: Successful exit. The solution to every right-hand side is */
/* > guaranteed. */
/* > < 0: If INFO = -i, the i-th argument had an illegal value */
/* > > 0 and <= N: U(INFO,INFO) is exactly zero. The factorization */
/* > has been completed, but the factor U is exactly singular, so */
/* > the solution and error bounds could not be computed. RCOND = 0 */
/* > is returned. */
/* > = N+J: The solution corresponding to the Jth right-hand side is */
/* > not guaranteed. The solutions corresponding to other right- */
/* > hand sides K with K > J may not be guaranteed as well, but */
/* > only the first such right-hand side is reported. If a small */
/* > componentwise error is not requested (PARAMS(3) = 0.0) then */
/* > the Jth right-hand side is the first with a normwise error */
/* > bound that is not guaranteed (the smallest J such */
/* > that ERR_BNDS_NORM(J,1) = 0.0). By default (PARAMS(3) = 1.0) */
/* > the Jth right-hand side is the first with either a normwise or */
/* > componentwise error bound that is not guaranteed (the smallest */
/* > J such that either ERR_BNDS_NORM(J,1) = 0.0 or */
/* > ERR_BNDS_COMP(J,1) = 0.0). See the definition of */
/* > ERR_BNDS_NORM(:,1) and ERR_BNDS_COMP(:,1). To get information */
/* > about all of the right-hand sides check ERR_BNDS_NORM or */
/* > ERR_BNDS_COMP. */
/* > \endverbatim */
/* Authors: */
/* ======== */
/* > \author Univ. of Tennessee */
/* > \author Univ. of California Berkeley */
/* > \author Univ. of Colorado Denver */
/* > \author NAG Ltd. */
/* > \date April 2012 */
/* > \ingroup doubleGEsolve */
/* ===================================================================== */
/* Subroutine */
int dgesvxx_(char *fact, char *trans, integer *n, integer * nrhs, doublereal *a, integer *lda, doublereal *af, integer *ldaf, integer *ipiv, char *equed, doublereal *r__, doublereal *c__, doublereal *b, integer *ldb, doublereal *x, integer *ldx, doublereal * rcond, doublereal *rpvgrw, doublereal *berr, integer *n_err_bnds__, doublereal *err_bnds_norm__, doublereal *err_bnds_comp__, integer * nparams, doublereal *params, doublereal *work, integer *iwork, integer *info)
{
/* System generated locals */
integer a_dim1, a_offset, af_dim1, af_offset, b_dim1, b_offset, x_dim1, x_offset, err_bnds_norm_dim1, err_bnds_norm_offset, err_bnds_comp_dim1, err_bnds_comp_offset, i__1;
doublereal d__1, d__2;
/* Local variables */
integer j;
doublereal amax;
extern doublereal dla_gerpvgrw_(integer *, integer *, doublereal *, integer *, doublereal *, integer *);
extern logical lsame_(char *, char *);
doublereal rcmin, rcmax;
logical equil;
extern doublereal dlamch_(char *);
extern /* Subroutine */
int dlaqge_(integer *, integer *, doublereal *, integer *, doublereal *, doublereal *, doublereal *, doublereal *, doublereal *, char *);
doublereal colcnd;
logical nofact;
extern /* Subroutine */
int dgetrf_(integer *, integer *, doublereal *, integer *, integer *, integer *), dlacpy_(char *, integer *, integer *, doublereal *, integer *, doublereal *, integer *), xerbla_(char *, integer *);
doublereal bignum;
integer infequ;
logical colequ;
extern /* Subroutine */
int dgetrs_(char *, integer *, integer *, doublereal *, integer *, integer *, doublereal *, integer *, integer *);
doublereal rowcnd;
logical notran;
doublereal smlnum;
logical rowequ;
extern /* Subroutine */
int dlascl2_(integer *, integer *, doublereal *, doublereal *, integer *), dgeequb_(integer *, integer *, doublereal *, integer *, doublereal *, doublereal *, doublereal *, doublereal *, doublereal *, integer *), dgerfsx_(char *, char *, integer *, integer *, doublereal *, integer *, doublereal *, integer *, integer *, doublereal *, doublereal *, doublereal *, integer *, doublereal *, integer *, doublereal *, doublereal *, integer *, doublereal *, doublereal *, integer *, doublereal *, doublereal *, integer *, integer *);
/* -- LAPACK driver routine (version 3.4.1) -- */
/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
/* April 2012 */
/* .. Scalar Arguments .. */
/* .. */
/* .. Array Arguments .. */
/* .. */
/* ===================================================================== */
/* .. Parameters .. */
/* .. */
/* .. Local Scalars .. */
/* .. */
/* .. External Functions .. */
/* .. */
/* .. External Subroutines .. */
/* .. */
/* .. Intrinsic Functions .. */
/* .. */
/* .. Executable Statements .. */
/* Parameter adjustments */
err_bnds_comp_dim1 = *nrhs;
err_bnds_comp_offset = 1 + err_bnds_comp_dim1;
err_bnds_comp__ -= err_bnds_comp_offset;
err_bnds_norm_dim1 = *nrhs;
err_bnds_norm_offset = 1 + err_bnds_norm_dim1;
err_bnds_norm__ -= err_bnds_norm_offset;
a_dim1 = *lda;
a_offset = 1 + a_dim1;
a -= a_offset;
af_dim1 = *ldaf;
af_offset = 1 + af_dim1;
af -= af_offset;
--ipiv;
--r__;
--c__;
b_dim1 = *ldb;
b_offset = 1 + b_dim1;
b -= b_offset;
x_dim1 = *ldx;
x_offset = 1 + x_dim1;
x -= x_offset;
--berr;
--params;
--work;
--iwork;
/* Function Body */
*info = 0;
nofact = lsame_(fact, "N");
equil = lsame_(fact, "E");
notran = lsame_(trans, "N");
smlnum = dlamch_("Safe minimum");
bignum = 1. / smlnum;
if (nofact || equil)
{
*(unsigned char *)equed = 'N';
rowequ = FALSE_;
colequ = FALSE_;
}
else
{
rowequ = lsame_(equed, "R") || lsame_(equed, "B");
colequ = lsame_(equed, "C") || lsame_(equed, "B");
}
/* Default is failure. If an input parameter is wrong or */
/* factorization fails, make everything look horrible. Only the */
/* pivot growth is set here, the rest is initialized in DGERFSX. */
*rpvgrw = 0.;
/* Test the input parameters. PARAMS is not tested until DGERFSX. */
if (! nofact && ! equil && ! lsame_(fact, "F"))
{
*info = -1;
}
else if (! notran && ! lsame_(trans, "T") && ! lsame_(trans, "C"))
{
*info = -2;
}
else if (*n < 0)
{
*info = -3;
}
else if (*nrhs < 0)
{
*info = -4;
}
else if (*lda < max(1,*n))
{
*info = -6;
}
else if (*ldaf < max(1,*n))
{
*info = -8;
}
else if (lsame_(fact, "F") && ! (rowequ || colequ || lsame_(equed, "N")))
{
*info = -10;
}
else
{
if (rowequ)
{
rcmin = bignum;
rcmax = 0.;
i__1 = *n;
for (j = 1;
j <= i__1;
++j)
{
/* Computing MIN */
d__1 = rcmin;
d__2 = r__[j]; // , expr subst
rcmin = min(d__1,d__2);
/* Computing MAX */
d__1 = rcmax;
d__2 = r__[j]; // , expr subst
rcmax = max(d__1,d__2);
/* L10: */
}
if (rcmin <= 0.)
{
*info = -11;
}
else if (*n > 0)
{
rowcnd = max(rcmin,smlnum) / min(rcmax,bignum);
}
else
{
rowcnd = 1.;
}
}
if (colequ && *info == 0)
{
rcmin = bignum;
rcmax = 0.;
i__1 = *n;
for (j = 1;
j <= i__1;
++j)
{
/* Computing MIN */
d__1 = rcmin;
d__2 = c__[j]; // , expr subst
rcmin = min(d__1,d__2);
/* Computing MAX */
d__1 = rcmax;
d__2 = c__[j]; // , expr subst
rcmax = max(d__1,d__2);
/* L20: */
}
if (rcmin <= 0.)
{
*info = -12;
}
else if (*n > 0)
{
colcnd = max(rcmin,smlnum) / min(rcmax,bignum);
}
else
{
colcnd = 1.;
}
}
if (*info == 0)
{
if (*ldb < max(1,*n))
{
*info = -14;
}
else if (*ldx < max(1,*n))
{
*info = -16;
}
}
}
if (*info != 0)
{
i__1 = -(*info);
xerbla_("DGESVXX", &i__1);
return 0;
}
if (equil)
{
/* Compute row and column scalings to equilibrate the matrix A. */
dgeequb_(n, n, &a[a_offset], lda, &r__[1], &c__[1], &rowcnd, &colcnd, &amax, &infequ);
if (infequ == 0)
{
/* Equilibrate the matrix. */
dlaqge_(n, n, &a[a_offset], lda, &r__[1], &c__[1], &rowcnd, & colcnd, &amax, equed);
rowequ = lsame_(equed, "R") || lsame_(equed, "B");
colequ = lsame_(equed, "C") || lsame_(equed, "B");
}
/* If the scaling factors are not applied, set them to 1.0. */
if (! rowequ)
{
i__1 = *n;
for (j = 1;
j <= i__1;
++j)
{
r__[j] = 1.;
}
}
if (! colequ)
{
i__1 = *n;
for (j = 1;
j <= i__1;
++j)
{
c__[j] = 1.;
}
}
}
/* Scale the right-hand side. */
if (notran)
{
if (rowequ)
{
dlascl2_(n, nrhs, &r__[1], &b[b_offset], ldb);
}
}
else
{
if (colequ)
{
dlascl2_(n, nrhs, &c__[1], &b[b_offset], ldb);
}
}
if (nofact || equil)
{
/* Compute the LU factorization of A. */
dlacpy_("Full", n, n, &a[a_offset], lda, &af[af_offset], ldaf);
dgetrf_(n, n, &af[af_offset], ldaf, &ipiv[1], info);
/* Return if INFO is non-zero. */
if (*info > 0)
{
/* Pivot in column INFO is exactly 0 */
/* Compute the reciprocal pivot growth factor of the */
/* leading rank-deficient INFO columns of A. */
*rpvgrw = dla_gerpvgrw_(n, info, &a[a_offset], lda, &af[ af_offset], ldaf);
return 0;
}
}
/* Compute the reciprocal pivot growth factor RPVGRW. */
*rpvgrw = dla_gerpvgrw_(n, n, &a[a_offset], lda, &af[af_offset], ldaf);
/* Compute the solution matrix X. */
dlacpy_("Full", n, nrhs, &b[b_offset], ldb, &x[x_offset], ldx);
dgetrs_(trans, n, nrhs, &af[af_offset], ldaf, &ipiv[1], &x[x_offset], ldx, info);
/* Use iterative refinement to improve the computed solution and */
/* compute error bounds and backward error estimates for it. */
dgerfsx_(trans, equed, n, nrhs, &a[a_offset], lda, &af[af_offset], ldaf, & ipiv[1], &r__[1], &c__[1], &b[b_offset], ldb, &x[x_offset], ldx, rcond, &berr[1], n_err_bnds__, &err_bnds_norm__[ err_bnds_norm_offset], &err_bnds_comp__[err_bnds_comp_offset], nparams, ¶ms[1], &work[1], &iwork[1], info);
/* Scale solutions. */
if (colequ && notran)
{
dlascl2_(n, nrhs, &c__[1], &x[x_offset], ldx);
}
else if (rowequ && ! notran)
{
dlascl2_(n, nrhs, &r__[1], &x[x_offset], ldx);
}
return 0;
/* End of DGESVXX */
}
/* dgesvxx_ */
#endif
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.