file
stringlengths 18
26
| data
stringlengths 2
1.05M
|
|---|---|
the_stack_data/51699339.c | #include <stdio.h>
int main() {
// basic hello world program for testing
printf("Hello World!");
return 0;
} |
the_stack_data/5608.c | char* DaciaStatusToString (int Status, int ReturnNullIfUnknown)
{
switch(Status)
{
case 0x22210001: return "STATUS_EMU_DONT_ADVANCE_RIP";
case 0x22210002: return "STATUS_EXECUTE_ORIGINAL_HANDLER";
case 0x22210003: return "STATUS_SET_POST_HOOK";
case 0x62210007: return "STATUS_LAPIC_ENABLED_NMI_WINDOW_EXIT";
case 0x62210008: return "STATUS_LAPIC_ENABLED_INTR_WINDOW_EXIT";
case 0x6221000D: return "STATUS_UPDATE_RIP";
case 0x6221000F: return "STATUS_DBG_COMMAND_PROCESSING_IN_PROGRESS";
case 0x62220001: return "STATUS_CONFIGURATION_REQUIRES_RESTART";
case 0x62220002: return "STATUS_INTROSPECTION_ENGINE_RESTARTED";
case 0xA2210001: return "STATUS_CANT_FREE_A_STATIC_MDL";
case 0xA2210003: return "STATUS_INCOMPLETE_ALLOC_MDL_OVERFLOW";
case 0xA2220001: return "STATUS_DEVICE_INSTALL_REQUIRES_RESTART";
case 0xA2220002: return "STATUS_DEVICE_UNINSTALL_REQUIRES_RESTART";
case 0xE2210005: return "STATUS_STATIC_MDL_TOO_SMALL";
case 0xE2210006: return "STATUS_PP_INCONSISTENCY";
case 0xE2210007: return "STATUS_INVALID_MDL";
case 0xE2210008: return "STATUS_INVALID_MDL_HINT";
case 0xE2210009: return "STATUS_ADDRESS_NOT_FOUND_IN_PFN";
case 0xE221000F: return "STATUS_NOT_A_VALID_DYNAMIC_VA";
case 0xE2210013: return "STATUS_NO_MAPPING_STRUCTURES";
case 0xE2210014: return "STATUS_INVALID_MMAP";
case 0xE2210015: return "STATUS_OVERLAP_VIOLATION";
case 0xE2210016: return "STATUS_PAGE_NOT_PRESENT";
case 0xE2210020: return "STATUS_NOT_A_VALID_POINTER";
case 0xE2210021: return "STATUS_HV_UNLOAD_REQUESTED_INTERNALLY";
case 0xE2210026: return "STATUS_INVALID_PHYSICAL_ADDRESS";
case 0xE2210028: return "STATUS_INVALID_MEMORY_TYPE";
case 0xE221002A: return "STATUS_OPTION_OR_FLAG_NOT_SUPPORTED";
case 0xE221002C: return "STATUS_TOO_MANY_ACQUIRES";
case 0xE221002D: return "STATUS_TOO_MANY_WAITERS";
case 0xE221002E: return "STATUS_NOT_ACQUIRED";
case 0xE221002F: return "STATUS_TOO_MANY_RELEASES";
case 0xE2210031: return "STATUS_HEAP_NO_FREE_CHUNK_FOUND";
case 0xE2210032: return "STATUS_HEAP_LAST_FIT_INDEX_NOT_SET";
case 0xE2210040: return "STATUS_TOO_MANY_HOOKS";
case 0xE2210041: return "STATUS_HOOK_ALREADY_SET";
case 0xE2210042: return "STATUS_HOOK_ALREADY_SET_GLOBAL";
case 0xE2210043: return "STATUS_NO_HOOK_MATCHED";
case 0xE2210044: return "STATUS_NEEDS_EMULATION";
case 0xE2210045: return "STATUS_EXECUTE_ON_BARE_METAL";
case 0xE2210046: return "STATUS_INVALID_INSTRUX";
case 0xE2210047: return "STATUS_NO_EMHV_INITIALIZED";
case 0xE2210048: return "STATUS_INJECT_GP";
case 0xE2210049: return "STATUS_INJECT_UD";
case 0xE22100D1: return "STATUS_TOO_MANY_DEVICES";
case 0xE22100E0: return "STATUS_SHMEM_LIMIT_REACHED";
case 0xE22100F0: return "STATUS_EMU_EXCEPTION_INJECTED";
case 0xE22100F1: return "STATUS_EMU_PAGE_FAULT";
case 0xE22100F2: return "STATUS_CANNOT_ACTIVATE_VMX_CONTROL";
case 0xE22100F3: return "STATUS_TESTCASE_FAILED";
case 0xE2210280: return "STATUS_GS_COOKIE_BITTEN";
case 0xE2210281: return "STATUS_GS_INEQUAL_STACK_OFFSETS";
case 0xE2210282: return "STATUS_GS_INVALID_OLD_STACK";
case 0xE2210283: return "STATUS_GS_INVALID_NEW_STACK";
case 0xE2210284: return "STATUS_GS_RANGE_CHECK_FAILURE";
case 0xE2210285: return "STATUS_GS_HANDLER_CHECK_FAILURE";
case 0xE2210288: return "STATUS_ACCESS_REQUIREMENTS_NOT_MET";
case 0xE2210289: return "STATUS_RTC_SHUTDOWN";
case 0xE221028A: return "STATUS_RTC_INIT_BASE";
case 0xE221028B: return "STATUS_RTC_STACK_CORRUPT";
case 0xE2210501: return "STATUS_ACPI_FATAL";
case 0xE2210600: return "STATUS_EMPTY_MAPPING";
case 0xE2210700: return "STATUS_DUPLICATE_KEY";
case 0xE2220001: return "STATUS_VERSION_INCOMPATIBLE";
case 0xE2220002: return "STATUS_HYPERVISOR_ALREADY_STARTED";
case 0xE2220003: return "STATUS_HYPERVISOR_NOT_STARTED";
case 0xE2220004: return "STATUS_USERMODE_DRIVER_NOT_CONNECTED";
case 0xE2220005: return "STATUS_DRIVER_HYPERVISOR_NOT_CONNECTED";
case 0xE2220006: return "STATUS_DRIVER_CONNECTION_ACTIVE";
case 0xE2220007: return "STATUS_HV_CONFIGURATION_NOT_SUPPORTED";
case 0xE2220008: return "STATUS_HYPERVISOR_NOT_CONFIGURED";
case 0xE2220009: return "STATUS_NOT_PROPERLY_CONFIGURED";
case 0xE222000A: return "STATUS_INTROSPECTION_OPERATION_NOT_SUPPORTED";
case 0xE222000B: return "STATUS_INVALID_SDK_FOLDER";
case 0xE222000C: return "STATUS_COMPONENT_NOT_KNOWN";
case 0xE222000D: return "STATUS_UNKNOWN_HW_ID";
case 0xE222000E: return "STATUS_INVALID_WG_CALLBACK_ID";
case 0xE222000F: return "STATUS_WG_NOT_INITIALIZED";
case 0xE2220010: return "STATUS_WG_ALREADY_INITIALIZED";
case 0xE2220011: return "STATUS_WINGUEST_EXCEPTION_ENCOUNTERED";
case 0xE2220012: return "STATUS_JSON_EXCEPTION_ENCOUNTERED";
case 0xE2221000: return "STATUS_UPDATE_RECOMMENDS_REBOOT";
case 0xE2221001: return "STATUS_UPDATE_REQUEST_REBOOT_FOR_UPDATE";
case 0xE2221002: return "STATUS_UPDATE_REQUIRES_REBOOT";
case 0xE2221003: return "STATUS_UPDATE_FILE_ERROR";
case 0xE2228000: return "STATUS_UNSUPPORTED_PLATFORM";
case 0xE2228001: return "STATUS_UNSUPPORTED_CPU";
case 0xE2228002: return "STATUS_VMX_FEATURES_LOCKED_DISABLED";
case 0xE2228003: return "STATUS_VIRTUALIZATION_FEATURES_NOT_AVAILABLE";
case 0xE2228004: return "STATUS_GRUB_FILES_MISSING";
case 0xE2228005: return "STATUS_MBR_CONFIGURATION_NOT_SUPPORTED";
case 0xE2228006: return "STATUS_NOT_SUPPORTED_WHILE_IN_VM";
case 0xE2228007: return "STATUS_SDK_FILES_MISSING";
case 0xE2228008: return "STATUS_OS_VERSION_NOT_SUPPORTED";
case 0xE2228009: return "STATUS_CANNOT_GET_SYSTEM_CONFIGURATION";
case 0xE222800A: return "STATUS_PREVIOUS_GRUB_FILES_DETECTED";
case 0xE222800B: return "STATUS_BOOT_ORDER_OVERRIDEN";
case 0xE222800C: return "STATUS_INSUFFICIENT_PHYSICAL_MEMORY";
case 0xE8F00000: return "STATUS_FROM_WIN32_ERROR";
default: return ReturnNullIfUnknown ? ((char *)0) : "_UNKNOWN_STATUS_";
}
}
|
the_stack_data/13983.c | #include<stdio.h>
int main()
{
int num, rev = 0, var, temp;
printf("Enter a 5-Digit No:-\n");
scanf("%d",&num);
temp = num;
while(num != 0)
{
var = num % 10;
num = num / 10;
rev = (rev * 10) + var;
}
printf("Reversed No :-\t %d",rev);
//Checking Palindrome
if(temp == rev)
{
printf("\nPALINDROME");
}
else
{
printf("\nNOT PALINDROME");
}
return 0;
}
|
the_stack_data/87638928.c | #include <stdio.h>
#include <string.h>
int main() {
int distance;
char car_type[20];
register int Acperkm,Nonacperkm,servicetax;
float carRent, totalrent;
printf("How many kilometers? ");
scanf("%d", &distance);
printf("AC car or non AC ac/non? ");
scanf("%s", car_type);
Acperkm=3;
Nonacperkm=2;
servicetax=1;
if(strcmp(car_type, "ac")==0)
carRent=distance*Acperkm;
else
carRent=distance*Nonacperkm;
totalrent=carRent + (carRent*servicetax/100);
printf("The total rent for the car will be $ %.2f\n",totalrent);
return 0;
} |
the_stack_data/43888026.c | //此函数演示整数的循环位移
#include <stdio.h>
int main(void)
{
unsigned int w1 = 0xabcdef00u, w2 = 0xffff1122u;
unsigned int rotate(unsigned int value, int n);
printf("%x\n", rotate(w1, 8));
printf("%x\n", rotate(w1, -16));
printf("%x\n", rotate(w2, 4));
printf("%x\n", rotate(w2, -2));
printf("%x\n", rotate(w1, 0));
printf("%x\n", rotate(w1,44));
return 0;
}
unsigned int rotate(unsigned int value, int n)
{
unsigned result, bits;
//将位移量缩小到指定范围
if(n > 0)
n = n % 32;
else
n = -(-n % 32);
if(n == 0)
result = value;
else if(n > 0){ //左循环位移
bits = value >> (32 - n);
result = value << n | bits;
}
else{ //右循环位移
n = -n;
bits = value << (32 - n);
result = value >> n | bits;
}
return result;
} |
the_stack_data/513792.c | /*
* tsh - A tiny shell program with job control
*
* <Put your name and login ID here>
*----------------- <Name : liang rongtang> ------------------
*----------------- <ID :0472528 > ------------------
*/
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <ctype.h>
#include <signal.h>
#include <sys/types.h>
#include <fcntl.h>
#include <sys/wait.h>
#include <errno.h>
#include <sys/dir.h>
/* Misc manifest constants */
#define MAXLINE 1024 /* max line size */
#define MAXARGS 128 /* max args on a command line */
#define MAXJOBS 16 /* max jobs at any point in time */
#define MAXJID 1<<16 /* max job ID */
#define MAX_CMD_BUF 50
#define MAX_CMD_LEN 30
#define MAX_ARG_LEN 30
/* Job states */
#define UNDEF 0 /* undefined */
#define FG 1 /* running in foreground */
#define BG 2 /* running in background */
#define ST 3 /* stopped */
/*Cmd struct*/
struct cmd_struct
{
char *name;
char *cmd_manner;/*The instruction will execute following the cmd_manner*/
};
/*
* Jobs states: FG (foreground), BG (background), ST (stopped)
* Job state transitions and enabling actions:
* FG -> ST : ctrl-z
* ST -> FG : fg command
* ST -> BG : bg command
* BG -> FG : fg command
* At most 1 job can be in the FG state.
*/
/* Global variables */
extern char **environ; /* defined in libc */
char prompt[128]; /* command line prompt */
int verbose = 0; /* if true, print additional output */
int nextjid = 1; /* next job ID to allocate */
char sbuf[MAXLINE]; /* for composing sprintf messages */
struct job_t { /* The job struct */
pid_t pid; /* job PID */
int jid; /* job ID [1, 2, ...] */
int state; /* UNDEF, BG, FG, or ST */
char cmdline[MAXLINE]; /* command line */
};
struct job_t jobs[MAXJOBS]; /* The job list */
/* End global variables */
/* Function prototypes */
/* Here are the functions that you will implement */
void eval(char *cmdline);
int builtin_cmd(char **argv, int *input_fd, int *output_fd);
void do_bgfg(char **argv, int output_fd);
void waitfg(pid_t pid, int output_fd);
void execute_cd(char **argv);
void makedir(char **argv);
void removedir(char **argv);
void sigchld_handler(int sig);
void sigtstp_handler(int sig);
void sigint_handler(int sig);
/* Here are helper routines that we've provided for you */
int parseline(const char *cmdline, char **argv);
char *firstTok(const char *space, const char *input,
const char *output, const char *pipe);
void sigquit_handler(int sig);
void clearjob(struct job_t *job);
void initjobs(struct job_t *jobs);
int maxjid(struct job_t *jobs);
int addjob(struct job_t *jobs, pid_t pid, int state, char *cmdline);
int deletejob(struct job_t *jobs, pid_t pid);
pid_t fgpid(struct job_t *jobs);
struct job_t *getjobpid(struct job_t *jobs, pid_t pid);
struct job_t *getjobjid(struct job_t *jobs, int jid);
int pid2jid(pid_t pid);
void listjobs(struct job_t *jobs, int output_fd);
void usage(void);
void unix_error(char *msg);
void app_error(char *msg);
typedef void handler_t(int);
handler_t *Signal(int signum, handler_t *handler);
/*
* main - The shell's main routine
*/
int main(int argc, char **argv)
{
char c;
char cmdline[MAXLINE];
int emit_prompt = 1; /* emit prompt (default) */
/* Redirect stderr to stdout (so that driver will get all output
* on the pipe connected to stdout) */
dup2(1, 2);
/* Parse the command line */
while ((c = getopt(argc, argv, "hvp")) != EOF) {
switch (c) {
case 'h': /* print help message */
usage();
break;
case 'v': /* emit additional diagnostic info */
verbose = 1;
break;
case 'p': /* don't print a prompt */
emit_prompt = 0; /* handy for automatic testing */
break;
default:
usage();
}
}
/* Install the signal handlers */
Signal(SIGINT, sigint_handler); /* ctrl-c */
Signal(SIGTSTP, sigtstp_handler); /* ctrl-z */
Signal(SIGCHLD, sigchld_handler); /* terminated or stopped child */
Signal(SIGQUIT, sigquit_handler); /* so parent can cleanly terminate child*/
/* Initialize the job list */
initjobs(jobs);
/* Execute the shell's read/eval loop */
while (1) {
/* Read command line */
if (emit_prompt) {
getcwd(prompt,128);
printf("%s>", prompt);
fflush(stdout);
}
if ((fgets(cmdline, MAXLINE, stdin) == NULL) && ferror(stdin))
app_error("fgets error");
if (feof(stdin)) { /* End of file (ctrl-d) */
fflush(stdout);
exit(0);
}
/* Evaluate the command line */
eval(cmdline);
fflush(stdout);
fflush(stderr);
}
exit(0); /* control never reaches here */
}
/*
* eval - Evaluate the command line that the user has just typed in
*
* If the user has requested a built-in command (quit, jobs, bg or fg)
* then execute it immediately. Otherwise, fork a child process and
* run the job in the context of the child. If the job is running in
* the foreground, wait for it to terminate and then return. Note:
* each child process must have a unique process group ID so that our
* background children don't receive SIGINT (SIGTSTP) from the kernel
* when we type ctrl-c (ctrl-z) at the keyboard.
*/
void eval(char *cmdline)
{
char *argv[MAXARGS];
int bg; /*should the job run in bg or fg*/
pid_t pid;
sigset_t mask;
int in = STDIN_FILENO;
int out = STDOUT_FILENO;
int *input_fd ;
int *output_fd=&out;
int input=0;
int output=0;
int argc=0;
bg=parseline(cmdline,argv) ;
if (argv[0]==NULL)
return; /*ignore empty line*/
while(argv[argc] !=NULL&&*argv[argc] !='\0')
{
if(*argv[argc]=='<') /*is there input I\O redirection*/
{
if(in!=STDIN_FILENO) /*illegal to use multiple redirection*/
{
printf("Error: Ambiguous I/O redirection\n");
return;
}
else
{
in=open(argv[argc+1],O_RDONLY); /*open the specific file*/
if(in==-1)
{
printf("Error: %s No such file or directory\n",argv[argc+1]);
return;
}
else
input=1;
}
}
if(*argv[argc]=='>') /*is there output I\O redirection*/
{
if(out!=STDOUT_FILENO) /*illegal to use multiple redirection*/
{
printf("Error: Ambiguous I/O redirection\n");
return;
}
else
{
out=open(argv[argc+1],O_WRONLY|O_CREAT); /*open the specific file*/
output=1;
}
argv[argc]=NULL;
}
argc++;
}
if(!builtin_cmd(argv,input_fd,output_fd)) /*if the command a built-in command*/
{
sigemptyset(&mask);
sigaddset(&mask,SIGCHLD);
sigprocmask(SIG_BLOCK,&mask,NULL); /*block signal SIGCHLD*/
if((pid=fork())==0)
{
sigprocmask(SIG_UNBLOCK,&mask,NULL); /*unblock signal SIGCHLD*/
setpgid(0,0); /*pid is set for the job id*/
if(input==1)
{
dup2(in,STDIN_FILENO); /*job should read file from in instead of STDIN*/
}
if(output==1)
{
dup2(out,STDOUT_FILENO); /*job should write to out in instead of STDOUT*/
}
if(execve(argv[0],argv,environ)<0 )
{
printf("%s:Command not found.\n",argv[0]);
exit(0);
}
}
addjob(jobs,pid,bg+1,cmdline); /*add job to joblist*/
sigprocmask(SIG_UNBLOCK,&mask,NULL); /*unblock signal SIGCHLD*/
if(!bg) /*run in foreground*/
{
waitfg(pid ,*output_fd); /*wait for foreground job to terminate*/
}
else /*run in background*/
{
printf("[%d] (%d) %s",pid2jid(pid),pid,cmdline);
}
}
return;
}
/*
* parseline - Parse the command line and build the argv array.
* Return true (1) if the user has requested a BG job, false
* if the user has requested a FG job.
*/
int parseline(const char *cmdline, char **argv)
{
static char array[MAXLINE]; /* holds local copy of command line */
char *buf = array; /* ptr that traverses command line */
char *delim_space; /* points to first space delimiter */
char *delim_in; /* points to the first < delimiter */
char *delim_out; /* points to the first > delimiter */
char *delim_pipe; /* points to the first | delimiter */
char *delim; /* points to the first delimiter */
int argc; /* number of args */
int bg; /* background job? */
char *last_space = NULL; /* The address of the last space */
strcpy(buf, cmdline);
buf[strlen(buf)-1] = ' '; /* replace trailing '\n' with space */
while (*buf && (*buf == ' ')) /* ignore leading spaces */
buf++;
/* Build the argv list */
argc = 0;
delim_space = strchr(buf, ' ');
delim_in = strchr(buf, '<');
delim_out = strchr(buf, '>');
delim_pipe = strchr(buf, '|');
while ((delim = firstTok(delim_space, delim_in, delim_out, delim_pipe))) {
if(delim == delim_space) {
argv[argc++] = buf;
*delim = '\0';
last_space = delim;
} else if(delim == delim_in) {
if((last_space && last_space != (delim - 1)) || (!last_space)) {
argv[argc++] = buf;
*delim = '\0';
}
argv[argc++] = "<";
last_space = 0;
} else if(delim == delim_out) {
if((last_space && last_space != (delim - 1)) || (!last_space)) {
argv[argc++] = buf;
*delim = '\0';
}
argv[argc++] = ">";
last_space = 0;
} else if(delim == delim_pipe) {
if((last_space && last_space != (delim - 1)) || (!last_space)) {
argv[argc++] = buf;
*delim = '\0';
}
argv[argc++] = "|";
last_space = 0;
}
buf = delim + 1;
while (*buf && (*buf == ' ')) /* ignore spaces */
buf++;
delim_space = strchr(buf, ' ');
delim_in = strchr(buf, '<');
delim_out = strchr(buf, '>');
delim_pipe = strchr(buf, '|');
}
argv[argc] = NULL;
if (argc == 0) /* ignore blank line */
return 1;
/* should the job run in the background? */
if ((bg = (*argv[argc-1] == '&')) != 0)
argv[--argc] = NULL;
return bg;
}
/*
* firstTok - Returns a pointer to the first (lowest addy) of the four pointers
* that isn't NULL.
*/
char *firstTok(const char *space, const char *input,
const char *output, const char *pipe) {
const char *possible[4];
unsigned int min;
int i = 1, n = 0;
if(space == NULL && input == NULL && output == NULL && pipe == NULL)
return NULL;
if(space != NULL) {
possible[n++] = space;
}
if(input != NULL) {
possible[n++] = input;
}
if(output != NULL) {
possible[n++] = output;
}
if(pipe != NULL) {
possible[n++] = pipe;
}
min = (unsigned)possible[0];
for(;i<n;i++) {
if(((unsigned)possible[i]) < min)
min = (unsigned)possible[i];
}
return (char *)min;
}
/*
* builtin_cmd - If the user has typed a built-in command then execute
* it immediately.
*/
int builtin_cmd(char **argv, int *input_fd, int *output_fd)
{
if(!strcmp(argv[0],"exit")) /*exit command, exit directly*/
exit(0);
if(!strcmp(argv[0],"cd")){
execute_cd(argv);
return 1;
}
if(!strcmp(argv[0],"mkdir")){
makedir(argv);
return 1;
}
if(!strcmp(argv[0],"rmdir")){
removedir(argv);
return 1;
}
if(!strcmp(argv[0],"&"))
return 1;
if(!strcmp(argv[0],"jobs")) /*jobs command ,list all jobs*/
{
listjobs(jobs,*output_fd);
return 1;
}
if((!strcmp(argv[0],"bg"))||(!strcmp(argv[0],"fg"))) /*bg\fg command */
{
do_bgfg(argv,*output_fd);
return 1;
}
return 0; /* not a builtin command */
}
/*
*execute_cd - Execute the cd command
*/
void execute_cd(char **argv){
int index = strlen(argv[1]);
int i = 0;
char swap[128];
if(argv[1] == NULL){
chdir("/");
getcwd(prompt,128);
}else if(argv[1][0] == '/'){
chdir(argv[1]);
getcwd(prompt,128);
}else if(!strcmp(argv[1],"../")){
getcwd(prompt,128);
index = strlen(prompt) - 1;
while(prompt[index]!='/')
index--;
strncpy(swap, prompt, index);
chdir(swap);
return;
}else{
getcwd(prompt,128);
strcat(prompt,"/");
strcat(prompt,argv[1]);
chdir(prompt);
}
return;
}
/*
*makedir - build the dictory you wanted
*/
void makedir(char **argv){
int status;
status = mkdir(argv[1]);
if(status == 0)
perror("Directory created!\n");
else perror("Unable to create the directory\n");
}
/*
*removedir - remove the dictory you have choosed
*/
void removedir(char **argv){
int status;
status = rmdir(argv[1]);
if(status == 0)
perror("Directory removed!\n");
else
perror("Unable to remove the directory!\n");
}
/*
* do_bgfg - Execute the builtin bg and fg commands
*/
void do_bgfg(char **argv, int output_fd)
{
struct job_t *job=NULL;
if(argv[1]==NULL) /*bg\fg command without pid\jid*/
{
printf("%s command requires PID or %%jobid argument\n",argv[0]);
return;
}
if(argv[1][0]=='%') /*%jid is a jid*/
{
int jid;
jid=atoi(argv[1]+1);
if((job=getjobjid(jobs, jid))==NULL) /*is the job found*/
{
printf("%s NO such job\n",argv[1]);
return;
}
}
else{
if(!isdigit(*argv[1])) /*is the pid a digit*/
{
printf("%s argument must be a PID or %%jobid\n",argv[0]);
return;
}
pid_t pid=(pid_t)atoi(argv[1]);
if((job=getjobpid(jobs, pid))==NULL)
{
printf("%s NO such process\n",argv[1]);
return;
}
}
kill(-(job->pid),SIGCONT); /*send a signal to the process and its child*/
if(!strcmp(argv[0],"bg"))
{
job->state=BG; /*change state*/
printf("[%d] (%d) %s",job->jid,job->pid,job->cmdline);
}
else
{
job->state=FG; /*change state*/
waitfg(job->pid,output_fd); /*wait the foreground process to terminate*/
}
return;
}
/*
* waitfg - Block until process pid is no longer the foreground process
*/
void waitfg(pid_t pid, int output_fd)
{
struct job_t *job;
job=getjobpid(jobs,pid);
while((job!=NULL)&&job->state==FG) /*if process pid foreground*/
{
sleep(1);
}
return;
}
/*****************
* Signal handlers
*****************/
/*
* sigchld_handler - The kernel sends a SIGCHLD to the shell whenever
* a child job terminates (becomes a zombie), or stops because it
* received a SIGSTOP or SIGTSTP signal. The handler reaps all
* available zombie children, but doesn't wait for any other
* currently running children to terminate.
*/
void sigchld_handler(int sig)
{
struct job_t *job;
int status;
int jid;
pid_t pid;
while((pid=waitpid(-1,&status,WNOHANG|WUNTRACED))>0)
{
job=getjobpid(jobs,pid);
if(WIFSTOPPED(status)) /*if the job stopped by signal*/
{
printf("Job [%d] (%d) stopped by signal %d\n",pid2jid(pid),pid,WSTOPSIG(status));
job->state=ST; /*change job state to stopped*/
}
else if(WIFEXITED(status)) /*if the job terminated normally*/
{
deletejob(jobs,pid); /*delete the job from job list*/
}
else if(WIFSIGNALED(status)) /*if the job terminated by signal*/
{
if((jid=job->jid)>0)
printf("Job [%d] (%d) terminated by signal %d\n",jid,pid,WTERMSIG(status));
deletejob(jobs,pid);
}
}
if(errno!=ECHILD&&errno!=EINTR)
unix_error("waitpid error");
return;
}
/*
* sigint_handler - The kernel sends a SIGINT to the shell whenver the
* user types ctrl-c at the keyboard. Catch it and send it along
* to the foreground job.
*/
void sigint_handler(int sig)
{
pid_t pid;
pid=fgpid(jobs); /*get the foreground job*/
if(!pid) /*if the foreground job exist*/
return;
kill(-pid,SIGINT); /*send signal SIGINT to the foreground process and its cild*/
return ;
}
/*
* sigtstp_handler - The kernel sends a SIGTSTP to the shell whenever
* the user types ctrl-z at the keyboard. Catch it and suspend the
* foreground job by sending it a SIGTSTP.
*/
void sigtstp_handler(int sig)
{
pid_t pid;
pid=fgpid(jobs); /*get the foreground job*/
if(!pid)
return;
kill(-pid,SIGTSTP); /*send signal SIGTSTP to the foreground process and its cild*/
return;
}
/*********************
* End signal handlers
*********************/
/***********************************************
* Helper routines that manipulate the job list
**********************************************/
/* clearjob - Clear the entries in a job struct */
void clearjob(struct job_t *job) {
job->pid = 0;
job->jid = 0;
job->state = UNDEF;
job->cmdline[0] = '\0';
}
/* initjobs - Initialize the job list */
void initjobs(struct job_t *jobs) {
int i;
for (i = 0; i < MAXJOBS; i++)
clearjob(&jobs[i]);
}
/* maxjid - Returns largest allocated job ID */
int maxjid(struct job_t *jobs)
{
int i, max=0;
for (i = 0; i < MAXJOBS; i++)
if (jobs[i].jid > max)
max = jobs[i].jid;
return max;
}
/* addjob - Add a job to the job list */
int addjob(struct job_t *jobs, pid_t pid, int state, char *cmdline)
{
int i;
if (pid < 1)
return 0;
for (i = 0; i < MAXJOBS; i++) {
if (jobs[i].pid == 0) {
jobs[i].pid = pid;
jobs[i].state = state;
jobs[i].jid = nextjid++;
if (nextjid > MAXJOBS)
nextjid = 1;
strcpy(jobs[i].cmdline, cmdline);
if(verbose){
printf("Added job [%d] %d %s\n", jobs[i].jid, jobs[i].pid, jobs[i].cmdline);
}
return 1;
}
}
printf("Tried to create too many jobs\n");
return 0;
}
/* deletejob - Delete a job whose PID=pid from the job list */
int deletejob(struct job_t *jobs, pid_t pid)
{
int i;
if (pid < 1)
return 0;
for (i = 0; i < MAXJOBS; i++) {
if (jobs[i].pid == pid) {
clearjob(&jobs[i]);
nextjid = maxjid(jobs)+1;
return 1;
}
}
return 0;
}
/* fgpid - Return PID of current foreground job, 0 if no such job */
pid_t fgpid(struct job_t *jobs) {
int i;
for (i = 0; i < MAXJOBS; i++)
if (jobs[i].state == FG)
return jobs[i].pid;
return 0;
}
/* getjobpid - Find a job (by PID) on the job list */
struct job_t *getjobpid(struct job_t *jobs, pid_t pid) {
int i;
if (pid < 1)
return NULL;
for (i = 0; i < MAXJOBS; i++)
if (jobs[i].pid == pid)
return &jobs[i];
return NULL;
}
/* getjobjid - Find a job (by JID) on the job list */
struct job_t *getjobjid(struct job_t *jobs, int jid)
{
int i;
if (jid < 1)
return NULL;
for (i = 0; i < MAXJOBS; i++)
if (jobs[i].jid == jid)
return &jobs[i];
return NULL;
}
/* pid2jid - Map process ID to job ID */
int pid2jid(pid_t pid)
{
int i;
if (pid < 1)
return 0;
for (i = 0; i < MAXJOBS; i++)
if (jobs[i].pid == pid) {
return jobs[i].jid;
}
return 0;
}
/* listjobs - Print the job list */
void listjobs(struct job_t *jobs, int output_fd)
{
int i;
char buf[MAXLINE];
for (i = 0; i < MAXJOBS; i++) {
memset(buf, '\0', MAXLINE);
if (jobs[i].pid != 0) {
sprintf(buf, "[%d] (%d) ", jobs[i].jid, jobs[i].pid);
if(write(output_fd, buf, strlen(buf)) < 0) {
fprintf(stderr, "Error writing to output file\n");
exit(1);
}
memset(buf, '\0', MAXLINE);
switch (jobs[i].state) {
case BG:
sprintf(buf, "Running ");
break;
case FG:
sprintf(buf, "Foreground ");
break;
case ST:
sprintf(buf, "Stopped ");
break;
default:
sprintf(buf, "listjobs: Internal error: job[%d].state=%d ",
i, jobs[i].state);
}
if(write(output_fd, buf, strlen(buf)) < 0) {
fprintf(stderr, "Error writing to output file\n");
exit(1);
}
memset(buf, '\0', MAXLINE);
sprintf(buf, "%s", jobs[i].cmdline);
if(write(output_fd, buf, strlen(buf)) < 0) {
fprintf(stderr, "Error writing to output file\n");
exit(1);
}
}
}
if(output_fd != STDOUT_FILENO)
close(output_fd);
}
/******************************
* end job list helper routines
******************************/
/***********************
* Other helper routines
***********************/
/*
* usage - print a help message
*/
void usage(void)
{
printf("Usage: shell [-hvp]\n");
printf(" -h print this message\n");
printf(" -v print additional diagnostic information\n");
printf(" -p do not emit a command prompt\n");
exit(1);
}
/*
* unix_error - unix-style error routine
*/
void unix_error(char *msg)
{
fprintf(stderr, "%s: %s\n", msg, strerror(errno));
exit(1);
}
/*
* app_error - application-style error routine
*/
void app_error(char *msg)
{
fprintf(stderr, "%s\n", msg);
exit(1);
}
/*
* Signal - wrapper for the sigaction function
*/
handler_t *Signal(int signum, handler_t *handler)
{
struct sigaction action, old_action;
action.sa_handler = handler;
sigemptyset(&action.sa_mask); /* block sigs of type being handled */
action.sa_flags = SA_RESTART; /* restart syscalls if possible */
if (sigaction(signum, &action, &old_action) < 0)
unix_error("Signal error");
return (old_action.sa_handler);
}
/*
* sigquit_handler - The driver program can gracefully terminate the
* child shell by sending it a SIGQUIT signal.
*/
void sigquit_handler(int sig)
{
if (verbose)
printf("siquit_handler: terminating after receipt of SIGQUIT signal\n");
exit(1);
}
|
the_stack_data/85443.c | // general protection fault in p9_client_prepare_req
// https://syzkaller.appspot.com/bug?id=993a3caa9e6efc13b53cd9531eeb9dc50d59a4e4
// status:open
// autogenerated by syzkaller (http://github.com/google/syzkaller)
#define _GNU_SOURCE
#include <endian.h>
#include <errno.h>
#include <errno.h>
#include <fcntl.h>
#include <fcntl.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stdio.h>
#include <sys/stat.h>
#include <sys/stat.h>
#include <sys/syscall.h>
#include <sys/types.h>
#include <unistd.h>
__attribute__((noreturn)) static void doexit(int status)
{
volatile unsigned i;
syscall(__NR_exit_group, status);
for (i = 0;; i++) {
}
}
#include <errno.h>
#include <stdarg.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
const int kFailStatus = 67;
const int kRetryStatus = 69;
static void exitf(const char* msg, ...)
{
int e = errno;
va_list args;
va_start(args, msg);
vfprintf(stderr, msg, args);
va_end(args);
fprintf(stderr, " (errno %d)\n", e);
doexit(kRetryStatus);
}
#define BITMASK_LEN(type, bf_len) (type)((1ull << (bf_len)) - 1)
#define BITMASK_LEN_OFF(type, bf_off, bf_len) \
(type)(BITMASK_LEN(type, (bf_len)) << (bf_off))
#define STORE_BY_BITMASK(type, addr, val, bf_off, bf_len) \
if ((bf_off) == 0 && (bf_len) == 0) { \
*(type*)(addr) = (type)(val); \
} else { \
type new_val = *(type*)(addr); \
new_val &= ~BITMASK_LEN_OFF(type, (bf_off), (bf_len)); \
new_val |= ((type)(val)&BITMASK_LEN(type, (bf_len))) << (bf_off); \
*(type*)(addr) = new_val; \
}
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;
}
static int inject_fault(int nth)
{
int fd;
char buf[16];
fd = open("/proc/thread-self/fail-nth", O_RDWR);
if (fd == -1)
exitf("failed to open /proc/thread-self/fail-nth");
sprintf(buf, "%d", nth + 1);
if (write(fd, buf, strlen(buf)) != (ssize_t)strlen(buf))
exitf("failed to write /proc/thread-self/fail-nth");
return fd;
}
static void execute_one();
extern unsigned long long procid;
void loop()
{
while (1) {
execute_one();
}
}
uint64_t r[2] = {0xffffffffffffffff, 0xffffffffffffffff};
void execute_one()
{
long res = 0;
*(uint32_t*)0x20000200 = 2;
*(uint32_t*)0x20000204 = 0x70;
*(uint8_t*)0x20000208 = 0xe6;
*(uint8_t*)0x20000209 = 0;
*(uint8_t*)0x2000020a = 0;
*(uint8_t*)0x2000020b = 0;
*(uint32_t*)0x2000020c = 0;
*(uint64_t*)0x20000210 = 0;
*(uint64_t*)0x20000218 = 0;
*(uint64_t*)0x20000220 = 0;
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 0, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 1, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 2, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 3, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 4, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 5, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 6, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 7, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 8, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 9, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 10, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 11, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 12, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 13, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 14, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 15, 2);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 17, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 18, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 19, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 20, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 21, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 22, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 23, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 24, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 25, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 26, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 27, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 28, 1);
STORE_BY_BITMASK(uint64_t, 0x20000228, 0, 29, 35);
*(uint32_t*)0x20000230 = 0;
*(uint32_t*)0x20000234 = 0;
*(uint64_t*)0x20000238 = 0;
*(uint64_t*)0x20000240 = 0;
*(uint64_t*)0x20000248 = 0;
*(uint64_t*)0x20000250 = 0;
*(uint32_t*)0x20000258 = 0;
*(uint32_t*)0x2000025c = 0;
*(uint64_t*)0x20000260 = 0;
*(uint32_t*)0x20000268 = 0;
*(uint16_t*)0x2000026c = 0;
*(uint16_t*)0x2000026e = 0;
syscall(__NR_perf_event_open, 0x20000200, 0, 0, -1, 0);
res = syscall(__NR_pipe2, 0x20000100, 0);
if (res != -1) {
r[0] = *(uint32_t*)0x20000100;
r[1] = *(uint32_t*)0x20000104;
}
memcpy((void*)0x20000300, "./file0", 8);
syscall(__NR_mkdir, 0x20000300, 0);
memcpy((void*)0x200000c0, "./file0", 8);
memcpy((void*)0x20000340, "9p", 3);
memcpy((void*)0x200001c0, "trans=fd,", 9);
memcpy((void*)0x200001c9, "rfdno", 5);
*(uint8_t*)0x200001ce = 0x3d;
sprintf((char*)0x200001cf, "0x%016llx", (long long)-1);
*(uint8_t*)0x200001e1 = 0x2c;
memcpy((void*)0x200001e2, "wfdno", 5);
*(uint8_t*)0x200001e7 = 0x3d;
sprintf((char*)0x200001e8, "0x%016llx", (long long)-1);
*(uint8_t*)0x200001fa = 0x2c;
*(uint8_t*)0x200001fb = 0;
syscall(__NR_mount, 0, 0x200000c0, 0x20000340, 0, 0x200001c0);
memcpy((void*)0x20000000, "./file0", 8);
memcpy((void*)0x20000900, "9p", 3);
memcpy((void*)0x20000840, "trans=fd,", 9);
memcpy((void*)0x20000849, "rfdno", 5);
*(uint8_t*)0x2000084e = 0x3d;
sprintf((char*)0x2000084f, "0x%016llx", (long long)r[0]);
*(uint8_t*)0x20000861 = 0x2c;
memcpy((void*)0x20000862, "wfdno", 5);
*(uint8_t*)0x20000867 = 0x3d;
sprintf((char*)0x20000868, "0x%016llx", (long long)r[1]);
*(uint8_t*)0x2000087a = 0x2c;
memcpy((void*)0x2000087b, "access", 6);
*(uint8_t*)0x20000881 = 0x3d;
sprintf((char*)0x20000882, "%020llu", (long long)0);
*(uint8_t*)0x20000896 = 0x2c;
*(uint8_t*)0x20000897 = 0;
write_file("/sys/kernel/debug/failslab/ignore-gfp-wait", "N");
write_file("/sys/kernel/debug/fail_futex/ignore-private", "N");
inject_fault(17);
syscall(__NR_mount, 0, 0x20000000, 0x20000900, 0, 0x20000840);
}
int main()
{
syscall(__NR_mmap, 0x20000000, 0x1000000, 3, 0x32, -1, 0);
for (;;) {
loop();
}
}
|
the_stack_data/150139369.c | /* Generated by CIL v. 1.7.0 */
/* print_CIL_Input is false */
struct _IO_FILE;
struct timeval;
extern void signal(int sig , void *func ) ;
extern float strtof(char const *str , char const *endptr ) ;
typedef struct _IO_FILE FILE;
extern int atoi(char const *s ) ;
extern double strtod(char const *str , char const *endptr ) ;
extern int fclose(void *stream ) ;
extern void *fopen(char const *filename , char const *mode ) ;
extern void abort() ;
extern void exit(int status ) ;
extern int raise(int sig ) ;
extern int fprintf(struct _IO_FILE *stream , char const *format , ...) ;
extern int strcmp(char const *a , char const *b ) ;
extern int rand() ;
extern unsigned long strtoul(char const *str , char const *endptr , int base ) ;
void RandomFunc(unsigned char input[1] , unsigned char output[1] ) ;
extern int strncmp(char const *s1 , char const *s2 , unsigned long maxlen ) ;
extern int gettimeofday(struct timeval *tv , void *tz , ...) ;
extern int printf(char const *format , ...) ;
int main(int argc , char *argv[] ) ;
void megaInit(void) ;
extern unsigned long strlen(char const *s ) ;
extern long strtol(char const *str , char const *endptr , int base ) ;
extern unsigned long strnlen(char const *s , unsigned long maxlen ) ;
extern void *memcpy(void *s1 , void const *s2 , unsigned long size ) ;
struct timeval {
long tv_sec ;
long tv_usec ;
};
extern void *malloc(unsigned long size ) ;
extern int scanf(char const *format , ...) ;
void RandomFunc(unsigned char input[1] , unsigned char output[1] )
{
unsigned char state[1] ;
unsigned char local1 ;
{
state[0UL] = (input[0UL] & 914778474UL) << (unsigned char)7;
local1 = 0UL;
while (local1 < input[1UL]) {
if (state[0UL] > local1) {
state[local1] = state[0UL] << (((state[local1] >> (unsigned char)1) & (unsigned char)7) | 1UL);
} else {
state[local1] = state[0UL] << (((state[local1] >> (unsigned char)4) & (unsigned char)7) | 1UL);
}
if (state[0UL] != local1) {
state[local1] >>= ((state[local1] >> (unsigned char)3) & (unsigned char)7) | 1UL;
} else {
state[local1] = state[0UL] >> (((state[0UL] >> (unsigned char)3) & (unsigned char)7) | 1UL);
}
local1 ++;
}
output[0UL] = (state[0UL] << (unsigned char)3) | (unsigned char)250;
}
}
int main(int argc , char *argv[] )
{
unsigned char input[1] ;
unsigned char output[1] ;
int randomFuns_i5 ;
unsigned char randomFuns_value6 ;
int randomFuns_main_i7 ;
{
megaInit();
if (argc != 2) {
printf("Call this program with %i arguments\n", 1);
exit(-1);
} else {
}
randomFuns_i5 = 0;
while (randomFuns_i5 < 1) {
randomFuns_value6 = (unsigned char )strtoul(argv[randomFuns_i5 + 1], 0, 10);
input[randomFuns_i5] = randomFuns_value6;
randomFuns_i5 ++;
}
RandomFunc(input, output);
if (output[0] == 250) {
printf("You win!\n");
} else {
}
randomFuns_main_i7 = 0;
while (randomFuns_main_i7 < 1) {
printf("%u\n", output[randomFuns_main_i7]);
randomFuns_main_i7 ++;
}
}
}
void megaInit(void)
{
{
}
}
|
the_stack_data/117326697.c | #include <stdio.h>
#include <ctype.h>
#include <assert.h>
#include <string.h>
#define STACK_SIZE 32
/*
* Step 1 − scan the expression from left to right
* Step 2 − if it is an operand push it to stack
* Step 3 − if it is an operator pull operand from stack and perform operation
* Step 4 − store the output of step 3, back to stack
* Step 5 − scan the expression until all operands are consumed
* Step 6 − pop the stack and perform operation
*/
char cstack[STACK_SIZE];
int ctop = -1;
float fstack[STACK_SIZE];
int ftop = -1;
void cpush(char item)
{
if(ctop < STACK_SIZE) {
cstack[++ctop] = item;
}
else {
puts("stack overflow");
}
}
char cpop()
{
char ret = 0;
if(ctop >= 0) {
ret = cstack[ctop--];
}
else {
puts("stack is empty");
}
return ret;
}
void fpush(float item)
{
if(ftop < STACK_SIZE) {
fstack[++ftop] = item;
}
else {
puts("stack overflow");
}
}
float fpop()
{
float ret = 0;
if(ftop >= 0) {
ret = fstack[ftop--];
}
else {
puts("stack is empty");
}
return ret;
}
/* returns precedence of operators */
int precedence(char symbol)
{
int retval = 0;
switch(symbol) {
case '+':
case '-':
retval = 2;
break;
case '*':
case '/':
retval = 3;
break;
case '^':
retval = 4;
break;
case '(':
case ')':
retval = 1;
break;
default:
retval = 0;
}
return retval;
}
/* check whether the symbol is operator? */
int isOperator(char symbol)
{
switch(symbol) {
case '+':
case '-':
case '*':
case '/':
case '^':
case '(':
case ')':
return 1;
break;
default:
return 0;
}
}
/* converts infix expression to postfix */
void convert(char infix[],char postfix[])
{
int i,j = 0;
for( i=0; infix[i]!='\0'; i++ ) {
if(isdigit(infix[i])) {
postfix[j++] = infix[i];
}
else {
if( i!=0 && isdigit(infix[i-1])) {
postfix[j++] = ' ';
}
if(infix[i] == '(') {
cpush(infix[i]);
}
else {
if(infix[i] == ')') {
while(cstack[ctop] != '(') {
postfix[j++] = cpop();
}
cpop(); /* pop out (. */
}
else {
if(ctop == -1 || precedence(infix[i]) > precedence(cstack[ctop])) {
cpush(infix[i]);
}
else {
while( precedence(infix[i]) <= precedence(cstack[ctop]) ) {
postfix[j++] = cpop();
}
cpush(infix[i]);
}
}
}
}
}
if(isdigit(postfix[j-1])) {
postfix[j++] = ' ';
}
while(ctop != -1) {
postfix[j++] = cpop();
}
postfix[j]='\0';
}
/*
* evaluates postfix expression
*/
float evaluate(char *postfix)
{
int i = 0;
float operand1, operand2, value = 0;
for( i=0; postfix[i] != '\0'; i++) {
if(isdigit(postfix[i])) {
value = value*10 + postfix[i] - '0';
}
else if( postfix[i] == ' ' && isdigit(postfix[i-1])) {
fpush(value);
value = 0;
}
else {
operand2 = fpop();
operand1 = fpop();
switch( postfix[i] ) {
case '+':
fpush(operand1+operand2);
break;
case '-':
fpush(operand1-operand2);
break;
case '*':
fpush(operand1*operand2);
break;
case '/':
fpush(operand1/operand2);
break;
default:
printf("unkonw operand %c\n", postfix[i]);
}
}
}
return fstack[ftop];
}
void test(char* infix, char* postfix)
{
strcpy(infix, "2+2-1-1*2/2");
convert(infix, postfix);
assert(2 == evaluate(postfix));
strcpy(infix, "(2+2)/2*2-1");
convert(infix, postfix);
assert(3 == evaluate(postfix));
strcpy(infix, "2+2/2*2");
convert(infix, postfix);
assert(4 == evaluate(postfix));
strcpy(infix, "2+2+2*(2-1)");
convert(infix, postfix);
assert(6 == evaluate(postfix));
}
int main(int argc, char** argv)
{
char infix[128];
char postfix[256];
test(infix, postfix);
if(argc > 1) {
strcpy(infix, argv[1]);
}
convert(infix, postfix);
printf("Infix expression is :[%s]\n" , infix);
printf("Postfix expression is :[%s]\n" , postfix);
printf("Evaluation is :[%.2f]\n" , evaluate(postfix));
}
|
the_stack_data/42643.c | #include <stdio.h>
int main(int argc, char** argv) {
for (int a = 1; a < 1000 / 3; a++) {
for (int b = a + 1; b < 1000 / 2; b++) {
const int c = 1000 - a - b;
if (a * a + b * b == c * c) {
printf("%d\n", (a * b * c));
}
}
}
}
|
the_stack_data/65105.c | #include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#define BUFFER_SIZE 20
int front = 0; rear = 0;
int buffer [BUFFER_SIZE];
pthread_t tid;
pthread_mutex_t mutex;
void insert(int item) {
while((rear - front + BUFFER_SIZE) % BUFFER_SIZE == BUFFER_SIZE); //If buffer is full, wait until it's not full
pthread_mutex_lock(&mutex); //Lock critial code
buffer[front] = item;
front = (front + 1) % BUFFER_SIZE;
printf("front: %d, inserted: %d\n", front, item);
pthread_mutex_unlock(&mutex);
sleep(1);
}
int remove_item() {
int item;
while((rear - front + BUFFER_SIZE) % BUFFER_SIZE == 0); //If buffer is empty, wait until its not empty
pthread_mutex_lock(&mutex);
item = buffer[rear];
rear = (rear + 1) % BUFFER_SIZE;
printf("rear: %d, removed: %d\n", rear, item);
pthread_mutex_unlock(&mutex);
sleep(1);
return item;
}
void * producer(void * param) {
int item;
while(1){
item = rand() % BUFFER_SIZE;
insert(item);
}
}
void * consumer(void * param) {
int item;
while(1){
item = remove_item();
}
}
int main(int argc, char * argv[]) {
printf("Executing Producer/Consumer using Mutex Locks\n");
int producers = atoi(argv[1]);
int consumers = atoi(argv[2]);
int i;
for (i = 0; i < producers; i++)
pthread_create(&tid, NULL, producer, NULL);
for (i = 0; i < consumers; i++)
pthread_create(&tid, NULL, consumer, NULL);
pthread_join(tid,NULL);
} |
the_stack_data/165767028.c | #include <stdio.h>
#include <stdlib.h>
typedef struct node {
int data;
struct node*next;
} node;
typedef node*stack;
typedef enum {false, true} bool;
stack head=NULL;
int init(stack*top){
*top=NULL;
return 1;
}
bool isEmpty(stack top) {
if(top==NULL)
{
return true;
}
else
{
return false;
}
}
int add(stack*s, int value){
if(*s==NULL){
stack tmp=(stack)malloc(sizeof(node));
tmp->data=value;
tmp->next=NULL;
head=tmp;
}
else{
stack tmp=malloc(sizeof(node));
tmp->data=value;
tmp->next=(*s);
head=tmp;
}
}
int pop(stack *head){
stack tmp=(*head)->next;
int value=(*head)->data;
free(*head);
(*head)=tmp;
return value;
}
int top(stack head){
if(head!=NULL) {return(head->data);}
}
int print(stack*s){
while((*s)!=NULL)
{
printf("%d", ((*s)->data));
printf(" ");
s=&((*s)->next);
}
printf("\n");
return 1;
}
int destroy(stack *top) {
stack x,y;
x=*top;
y=*top;
while (x!=NULL)
{
y=x->next;
free(x);
x=y;
}
free(*top);
return 1;
}
int main() {
init(&head);
int value, n, i;
scanf("%d", &n);
for (i=0; i<n; i++)
{
scanf("%d", &value);
add(&head, value);
}
print (&head);
printf("%d\n", pop(&head));
printf("\n");
print(&head);
destroy(&head);
return 0;
}
|
the_stack_data/32949110.c | /**
* @file
* Dynamic Host Configuration Protocol client
*
* @defgroup dhcp4 DHCPv4
* @ingroup ip4
* DHCP (IPv4) related functions
* This is a DHCP client for the lwIP TCP/IP stack. It aims to conform
* with RFC 2131 and RFC 2132.
*
* @todo:
* - Support for interfaces other than Ethernet (SLIP, PPP, ...)
*
* Options:
* @ref DHCP_COARSE_TIMER_SECS (recommended 60 which is a minute)
* @ref DHCP_FINE_TIMER_MSECS (recommended 500 which equals TCP coarse timer)
*
* dhcp_start() starts a DHCP client instance which
* configures the interface by obtaining an IP address lease and maintaining it.
*
* Use dhcp_release() to end the lease and use dhcp_stop()
* to remove the DHCP client.
*
* @see netifapi_dhcp4
*/
/*
* Copyright (c) 2001-2004 Leon Woestenberg <[email protected]>
* Copyright (c) 2001-2004 Axon Digital Design B.V., The Netherlands.
* 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. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 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 lwIP TCP/IP stack.
* The Swedish Institute of Computer Science and Adam Dunkels
* are specifically granted permission to redistribute this
* source code.
*
* Author: Leon Woestenberg <[email protected]>
*
*/
#ifdef LIBOHIBOARD_ETHERNET_LWIP_2_0_3
#include "lwip/opt.h"
#if LWIP_IPV4 && LWIP_DHCP /* don't build if not configured for use in lwipopts.h */
#include "lwip/stats.h"
#include "lwip/mem.h"
#include "lwip/udp.h"
#include "lwip/ip_addr.h"
#include "lwip/netif.h"
#include "lwip/def.h"
#include "lwip/dhcp.h"
#include "lwip/autoip.h"
#include "lwip/dns.h"
#include "lwip/etharp.h"
#include "lwip/prot/dhcp.h"
#include <string.h>
/** DHCP_CREATE_RAND_XID: if this is set to 1, the xid is created using
* LWIP_RAND() (this overrides DHCP_GLOBAL_XID)
*/
#ifndef DHCP_CREATE_RAND_XID
#define DHCP_CREATE_RAND_XID 1
#endif
/** Default for DHCP_GLOBAL_XID is 0xABCD0000
* This can be changed by defining DHCP_GLOBAL_XID and DHCP_GLOBAL_XID_HEADER, e.g.
* \#define DHCP_GLOBAL_XID_HEADER "stdlib.h"
* \#define DHCP_GLOBAL_XID rand()
*/
#ifdef DHCP_GLOBAL_XID_HEADER
#include DHCP_GLOBAL_XID_HEADER /* include optional starting XID generation prototypes */
#endif
/** DHCP_OPTION_MAX_MSG_SIZE is set to the MTU
* MTU is checked to be big enough in dhcp_start */
#define DHCP_MAX_MSG_LEN(netif) (netif->mtu)
#define DHCP_MAX_MSG_LEN_MIN_REQUIRED 576
/** Minimum length for reply before packet is parsed */
#define DHCP_MIN_REPLY_LEN 44
#define REBOOT_TRIES 2
#if LWIP_DNS && LWIP_DHCP_MAX_DNS_SERVERS
#if DNS_MAX_SERVERS > LWIP_DHCP_MAX_DNS_SERVERS
#define LWIP_DHCP_PROVIDE_DNS_SERVERS LWIP_DHCP_MAX_DNS_SERVERS
#else
#define LWIP_DHCP_PROVIDE_DNS_SERVERS DNS_MAX_SERVERS
#endif
#else
#define LWIP_DHCP_PROVIDE_DNS_SERVERS 0
#endif
/** Option handling: options are parsed in dhcp_parse_reply
* and saved in an array where other functions can load them from.
* This might be moved into the struct dhcp (not necessarily since
* lwIP is single-threaded and the array is only used while in recv
* callback). */
enum dhcp_option_idx {
DHCP_OPTION_IDX_OVERLOAD = 0,
DHCP_OPTION_IDX_MSG_TYPE,
DHCP_OPTION_IDX_SERVER_ID,
DHCP_OPTION_IDX_LEASE_TIME,
DHCP_OPTION_IDX_T1,
DHCP_OPTION_IDX_T2,
DHCP_OPTION_IDX_SUBNET_MASK,
DHCP_OPTION_IDX_ROUTER,
#if LWIP_DHCP_PROVIDE_DNS_SERVERS
DHCP_OPTION_IDX_DNS_SERVER,
DHCP_OPTION_IDX_DNS_SERVER_LAST = DHCP_OPTION_IDX_DNS_SERVER + LWIP_DHCP_PROVIDE_DNS_SERVERS - 1,
#endif /* LWIP_DHCP_PROVIDE_DNS_SERVERS */
#if LWIP_DHCP_GET_NTP_SRV
DHCP_OPTION_IDX_NTP_SERVER,
DHCP_OPTION_IDX_NTP_SERVER_LAST = DHCP_OPTION_IDX_NTP_SERVER + LWIP_DHCP_MAX_NTP_SERVERS - 1,
#endif /* LWIP_DHCP_GET_NTP_SRV */
DHCP_OPTION_IDX_MAX
};
/** Holds the decoded option values, only valid while in dhcp_recv.
@todo: move this into struct dhcp? */
u32_t dhcp_rx_options_val[DHCP_OPTION_IDX_MAX];
/** Holds a flag which option was received and is contained in dhcp_rx_options_val,
only valid while in dhcp_recv.
@todo: move this into struct dhcp? */
u8_t dhcp_rx_options_given[DHCP_OPTION_IDX_MAX];
static u8_t dhcp_discover_request_options[] = {
DHCP_OPTION_SUBNET_MASK,
DHCP_OPTION_ROUTER,
DHCP_OPTION_BROADCAST
#if LWIP_DHCP_PROVIDE_DNS_SERVERS
, DHCP_OPTION_DNS_SERVER
#endif /* LWIP_DHCP_PROVIDE_DNS_SERVERS */
#if LWIP_DHCP_GET_NTP_SRV
, DHCP_OPTION_NTP
#endif /* LWIP_DHCP_GET_NTP_SRV */
};
#ifdef DHCP_GLOBAL_XID
static u32_t xid;
static u8_t xid_initialised;
#endif /* DHCP_GLOBAL_XID */
#define dhcp_option_given(dhcp, idx) (dhcp_rx_options_given[idx] != 0)
#define dhcp_got_option(dhcp, idx) (dhcp_rx_options_given[idx] = 1)
#define dhcp_clear_option(dhcp, idx) (dhcp_rx_options_given[idx] = 0)
#define dhcp_clear_all_options(dhcp) (memset(dhcp_rx_options_given, 0, sizeof(dhcp_rx_options_given)))
#define dhcp_get_option_value(dhcp, idx) (dhcp_rx_options_val[idx])
#define dhcp_set_option_value(dhcp, idx, val) (dhcp_rx_options_val[idx] = (val))
static struct udp_pcb *dhcp_pcb;
static u8_t dhcp_pcb_refcount;
/* DHCP client state machine functions */
static err_t dhcp_discover(struct netif *netif);
static err_t dhcp_select(struct netif *netif);
static void dhcp_bind(struct netif *netif);
#if DHCP_DOES_ARP_CHECK
static err_t dhcp_decline(struct netif *netif);
#endif /* DHCP_DOES_ARP_CHECK */
static err_t dhcp_rebind(struct netif *netif);
static err_t dhcp_reboot(struct netif *netif);
static void dhcp_set_state(struct dhcp *dhcp, u8_t new_state);
/* receive, unfold, parse and free incoming messages */
static void dhcp_recv(void *arg, struct udp_pcb *pcb, struct pbuf *p, const ip_addr_t *addr, u16_t port);
/* set the DHCP timers */
static void dhcp_timeout(struct netif *netif);
static void dhcp_t1_timeout(struct netif *netif);
static void dhcp_t2_timeout(struct netif *netif);
/* build outgoing messages */
/* create a DHCP message, fill in common headers */
static err_t dhcp_create_msg(struct netif *netif, struct dhcp *dhcp, u8_t message_type);
/* free a DHCP request */
static void dhcp_delete_msg(struct dhcp *dhcp);
/* add a DHCP option (type, then length in bytes) */
static void dhcp_option(struct dhcp *dhcp, u8_t option_type, u8_t option_len);
/* add option values */
static void dhcp_option_byte(struct dhcp *dhcp, u8_t value);
static void dhcp_option_short(struct dhcp *dhcp, u16_t value);
static void dhcp_option_long(struct dhcp *dhcp, u32_t value);
#if LWIP_NETIF_HOSTNAME
static void dhcp_option_hostname(struct dhcp *dhcp, struct netif *netif);
#endif /* LWIP_NETIF_HOSTNAME */
/* always add the DHCP options trailer to end and pad */
static void dhcp_option_trailer(struct dhcp *dhcp);
/** Ensure DHCP PCB is allocated and bound */
static err_t
dhcp_inc_pcb_refcount(void)
{
if (dhcp_pcb_refcount == 0) {
LWIP_ASSERT("dhcp_inc_pcb_refcount(): memory leak", dhcp_pcb == NULL);
/* allocate UDP PCB */
dhcp_pcb = udp_new();
if (dhcp_pcb == NULL) {
return ERR_MEM;
}
ip_set_option(dhcp_pcb, SOF_BROADCAST);
/* set up local and remote port for the pcb -> listen on all interfaces on all src/dest IPs */
udp_bind(dhcp_pcb, IP4_ADDR_ANY, DHCP_CLIENT_PORT);
udp_connect(dhcp_pcb, IP4_ADDR_ANY, DHCP_SERVER_PORT);
udp_recv(dhcp_pcb, dhcp_recv, NULL);
}
dhcp_pcb_refcount++;
return ERR_OK;
}
/** Free DHCP PCB if the last netif stops using it */
static void
dhcp_dec_pcb_refcount(void)
{
LWIP_ASSERT("dhcp_pcb_refcount(): refcount error", (dhcp_pcb_refcount > 0));
dhcp_pcb_refcount--;
if (dhcp_pcb_refcount == 0) {
udp_remove(dhcp_pcb);
dhcp_pcb = NULL;
}
}
/**
* Back-off the DHCP client (because of a received NAK response).
*
* Back-off the DHCP client because of a received NAK. Receiving a
* NAK means the client asked for something non-sensible, for
* example when it tries to renew a lease obtained on another network.
*
* We clear any existing set IP address and restart DHCP negotiation
* afresh (as per RFC2131 3.2.3).
*
* @param netif the netif under DHCP control
*/
static void
dhcp_handle_nak(struct netif *netif)
{
struct dhcp *dhcp = netif_dhcp_data(netif);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_handle_nak(netif=%p) %c%c%"U16_F"\n",
(void*)netif, netif->name[0], netif->name[1], (u16_t)netif->num));
/* Change to a defined state - set this before assigning the address
to ensure the callback can use dhcp_supplied_address() */
dhcp_set_state(dhcp, DHCP_STATE_BACKING_OFF);
/* remove IP address from interface (must no longer be used, as per RFC2131) */
netif_set_addr(netif, IP4_ADDR_ANY4, IP4_ADDR_ANY4, IP4_ADDR_ANY4);
/* We can immediately restart discovery */
dhcp_discover(netif);
}
#if DHCP_DOES_ARP_CHECK
/**
* Checks if the offered IP address is already in use.
*
* It does so by sending an ARP request for the offered address and
* entering CHECKING state. If no ARP reply is received within a small
* interval, the address is assumed to be free for use by us.
*
* @param netif the netif under DHCP control
*/
static void
dhcp_check(struct netif *netif)
{
struct dhcp *dhcp = netif_dhcp_data(netif);
err_t result;
u16_t msecs;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_check(netif=%p) %c%c\n", (void *)netif, (s16_t)netif->name[0],
(s16_t)netif->name[1]));
dhcp_set_state(dhcp, DHCP_STATE_CHECKING);
/* create an ARP query for the offered IP address, expecting that no host
responds, as the IP address should not be in use. */
result = etharp_query(netif, &dhcp->offered_ip_addr, NULL);
if (result != ERR_OK) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_WARNING, ("dhcp_check: could not perform ARP query\n"));
}
if (dhcp->tries < 255) {
dhcp->tries++;
}
msecs = 500;
dhcp->request_timeout = (msecs + DHCP_FINE_TIMER_MSECS - 1) / DHCP_FINE_TIMER_MSECS;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_check(): set request timeout %"U16_F" msecs\n", msecs));
}
#endif /* DHCP_DOES_ARP_CHECK */
/**
* Remember the configuration offered by a DHCP server.
*
* @param netif the netif under DHCP control
*/
static void
dhcp_handle_offer(struct netif *netif)
{
struct dhcp *dhcp = netif_dhcp_data(netif);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_handle_offer(netif=%p) %c%c%"U16_F"\n",
(void*)netif, netif->name[0], netif->name[1], (u16_t)netif->num));
/* obtain the server address */
if (dhcp_option_given(dhcp, DHCP_OPTION_IDX_SERVER_ID)) {
ip_addr_set_ip4_u32(&dhcp->server_ip_addr, lwip_htonl(dhcp_get_option_value(dhcp, DHCP_OPTION_IDX_SERVER_ID)));
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_STATE, ("dhcp_handle_offer(): server 0x%08"X32_F"\n",
ip4_addr_get_u32(ip_2_ip4(&dhcp->server_ip_addr))));
/* remember offered address */
ip4_addr_copy(dhcp->offered_ip_addr, dhcp->msg_in->yiaddr);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_STATE, ("dhcp_handle_offer(): offer for 0x%08"X32_F"\n",
ip4_addr_get_u32(&dhcp->offered_ip_addr)));
dhcp_select(netif);
} else {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_SERIOUS,
("dhcp_handle_offer(netif=%p) did not get server ID!\n", (void*)netif));
}
}
/**
* Select a DHCP server offer out of all offers.
*
* Simply select the first offer received.
*
* @param netif the netif under DHCP control
* @return lwIP specific error (see error.h)
*/
static err_t
dhcp_select(struct netif *netif)
{
struct dhcp *dhcp = netif_dhcp_data(netif);
err_t result;
u16_t msecs;
u8_t i;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_select(netif=%p) %c%c%"U16_F"\n", (void*)netif, netif->name[0], netif->name[1], (u16_t)netif->num));
dhcp_set_state(dhcp, DHCP_STATE_REQUESTING);
/* create and initialize the DHCP message header */
result = dhcp_create_msg(netif, dhcp, DHCP_REQUEST);
if (result == ERR_OK) {
dhcp_option(dhcp, DHCP_OPTION_MAX_MSG_SIZE, DHCP_OPTION_MAX_MSG_SIZE_LEN);
dhcp_option_short(dhcp, DHCP_MAX_MSG_LEN(netif));
/* MUST request the offered IP address */
dhcp_option(dhcp, DHCP_OPTION_REQUESTED_IP, 4);
dhcp_option_long(dhcp, lwip_ntohl(ip4_addr_get_u32(&dhcp->offered_ip_addr)));
dhcp_option(dhcp, DHCP_OPTION_SERVER_ID, 4);
dhcp_option_long(dhcp, lwip_ntohl(ip4_addr_get_u32(ip_2_ip4(&dhcp->server_ip_addr))));
dhcp_option(dhcp, DHCP_OPTION_PARAMETER_REQUEST_LIST, LWIP_ARRAYSIZE(dhcp_discover_request_options));
for (i = 0; i < LWIP_ARRAYSIZE(dhcp_discover_request_options); i++) {
dhcp_option_byte(dhcp, dhcp_discover_request_options[i]);
}
#if LWIP_NETIF_HOSTNAME
dhcp_option_hostname(dhcp, netif);
#endif /* LWIP_NETIF_HOSTNAME */
dhcp_option_trailer(dhcp);
/* shrink the pbuf to the actual content length */
pbuf_realloc(dhcp->p_out, sizeof(struct dhcp_msg) - DHCP_OPTIONS_LEN + dhcp->options_out_len);
/* send broadcast to any DHCP server */
udp_sendto_if_src(dhcp_pcb, dhcp->p_out, IP_ADDR_BROADCAST, DHCP_SERVER_PORT, netif, IP4_ADDR_ANY);
dhcp_delete_msg(dhcp);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_select: REQUESTING\n"));
} else {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_WARNING, ("dhcp_select: could not allocate DHCP request\n"));
}
if (dhcp->tries < 255) {
dhcp->tries++;
}
msecs = (dhcp->tries < 6 ? 1 << dhcp->tries : 60) * 1000;
dhcp->request_timeout = (msecs + DHCP_FINE_TIMER_MSECS - 1) / DHCP_FINE_TIMER_MSECS;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_STATE, ("dhcp_select(): set request timeout %"U16_F" msecs\n", msecs));
return result;
}
/**
* The DHCP timer that checks for lease renewal/rebind timeouts.
* Must be called once a minute (see @ref DHCP_COARSE_TIMER_SECS).
*/
void
dhcp_coarse_tmr(void)
{
struct netif *netif = netif_list;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_coarse_tmr()\n"));
/* iterate through all network interfaces */
while (netif != NULL) {
/* only act on DHCP configured interfaces */
struct dhcp *dhcp = netif_dhcp_data(netif);
if ((dhcp != NULL) && (dhcp->state != DHCP_STATE_OFF)) {
/* compare lease time to expire timeout */
if (dhcp->t0_timeout && (++dhcp->lease_used == dhcp->t0_timeout)) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_coarse_tmr(): t0 timeout\n"));
/* this clients' lease time has expired */
dhcp_release(netif);
dhcp_discover(netif);
/* timer is active (non zero), and triggers (zeroes) now? */
} else if (dhcp->t2_rebind_time && (dhcp->t2_rebind_time-- == 1)) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_coarse_tmr(): t2 timeout\n"));
/* this clients' rebind timeout triggered */
dhcp_t2_timeout(netif);
/* timer is active (non zero), and triggers (zeroes) now */
} else if (dhcp->t1_renew_time && (dhcp->t1_renew_time-- == 1)) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_coarse_tmr(): t1 timeout\n"));
/* this clients' renewal timeout triggered */
dhcp_t1_timeout(netif);
}
}
/* proceed to next netif */
netif = netif->next;
}
}
/**
* DHCP transaction timeout handling (this function must be called every 500ms,
* see @ref DHCP_FINE_TIMER_MSECS).
*
* A DHCP server is expected to respond within a short period of time.
* This timer checks whether an outstanding DHCP request is timed out.
*/
void
dhcp_fine_tmr(void)
{
struct netif *netif = netif_list;
/* loop through netif's */
while (netif != NULL) {
struct dhcp *dhcp = netif_dhcp_data(netif);
/* only act on DHCP configured interfaces */
if (dhcp != NULL) {
/* timer is active (non zero), and is about to trigger now */
if (dhcp->request_timeout > 1) {
dhcp->request_timeout--;
}
else if (dhcp->request_timeout == 1) {
dhcp->request_timeout--;
/* { netif->dhcp->request_timeout == 0 } */
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_fine_tmr(): request timeout\n"));
/* this client's request timeout triggered */
dhcp_timeout(netif);
}
}
/* proceed to next network interface */
netif = netif->next;
}
}
/**
* A DHCP negotiation transaction, or ARP request, has timed out.
*
* The timer that was started with the DHCP or ARP request has
* timed out, indicating no response was received in time.
*
* @param netif the netif under DHCP control
*/
static void
dhcp_timeout(struct netif *netif)
{
struct dhcp *dhcp = netif_dhcp_data(netif);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_timeout()\n"));
/* back-off period has passed, or server selection timed out */
if ((dhcp->state == DHCP_STATE_BACKING_OFF) || (dhcp->state == DHCP_STATE_SELECTING)) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_timeout(): restarting discovery\n"));
dhcp_discover(netif);
/* receiving the requested lease timed out */
} else if (dhcp->state == DHCP_STATE_REQUESTING) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_timeout(): REQUESTING, DHCP request timed out\n"));
if (dhcp->tries <= 5) {
dhcp_select(netif);
} else {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_timeout(): REQUESTING, releasing, restarting\n"));
dhcp_release(netif);
dhcp_discover(netif);
}
#if DHCP_DOES_ARP_CHECK
/* received no ARP reply for the offered address (which is good) */
} else if (dhcp->state == DHCP_STATE_CHECKING) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_timeout(): CHECKING, ARP request timed out\n"));
if (dhcp->tries <= 1) {
dhcp_check(netif);
/* no ARP replies on the offered address,
looks like the IP address is indeed free */
} else {
/* bind the interface to the offered address */
dhcp_bind(netif);
}
#endif /* DHCP_DOES_ARP_CHECK */
} else if (dhcp->state == DHCP_STATE_REBOOTING) {
if (dhcp->tries < REBOOT_TRIES) {
dhcp_reboot(netif);
} else {
dhcp_discover(netif);
}
}
}
/**
* The renewal period has timed out.
*
* @param netif the netif under DHCP control
*/
static void
dhcp_t1_timeout(struct netif *netif)
{
struct dhcp *dhcp = netif_dhcp_data(netif);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_STATE, ("dhcp_t1_timeout()\n"));
if ((dhcp->state == DHCP_STATE_REQUESTING) || (dhcp->state == DHCP_STATE_BOUND) ||
(dhcp->state == DHCP_STATE_RENEWING)) {
/* just retry to renew - note that the rebind timer (t2) will
* eventually time-out if renew tries fail. */
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE,
("dhcp_t1_timeout(): must renew\n"));
/* This slightly different to RFC2131: DHCPREQUEST will be sent from state
DHCP_STATE_RENEWING, not DHCP_STATE_BOUND */
dhcp_renew(netif);
/* Calculate next timeout */
if (((dhcp->t2_timeout - dhcp->lease_used) / 2) >= ((60 + DHCP_COARSE_TIMER_SECS / 2) / DHCP_COARSE_TIMER_SECS))
{
dhcp->t1_renew_time = ((dhcp->t2_timeout - dhcp->lease_used) / 2);
}
}
}
/**
* The rebind period has timed out.
*
* @param netif the netif under DHCP control
*/
static void
dhcp_t2_timeout(struct netif *netif)
{
struct dhcp *dhcp = netif_dhcp_data(netif);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_t2_timeout()\n"));
if ((dhcp->state == DHCP_STATE_REQUESTING) || (dhcp->state == DHCP_STATE_BOUND) ||
(dhcp->state == DHCP_STATE_RENEWING) || (dhcp->state == DHCP_STATE_REBINDING)) {
/* just retry to rebind */
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE,
("dhcp_t2_timeout(): must rebind\n"));
/* This slightly different to RFC2131: DHCPREQUEST will be sent from state
DHCP_STATE_REBINDING, not DHCP_STATE_BOUND */
dhcp_rebind(netif);
/* Calculate next timeout */
if (((dhcp->t0_timeout - dhcp->lease_used) / 2) >= ((60 + DHCP_COARSE_TIMER_SECS / 2) / DHCP_COARSE_TIMER_SECS))
{
dhcp->t2_rebind_time = ((dhcp->t0_timeout - dhcp->lease_used) / 2);
}
}
}
/**
* Handle a DHCP ACK packet
*
* @param netif the netif under DHCP control
*/
static void
dhcp_handle_ack(struct netif *netif)
{
struct dhcp *dhcp = netif_dhcp_data(netif);
#if LWIP_DHCP_PROVIDE_DNS_SERVERS || LWIP_DHCP_GET_NTP_SRV
u8_t n;
#endif /* LWIP_DHCP_PROVIDE_DNS_SERVERS || LWIP_DHCP_GET_NTP_SRV */
#if LWIP_DHCP_GET_NTP_SRV
ip4_addr_t ntp_server_addrs[LWIP_DHCP_MAX_NTP_SERVERS];
#endif
/* clear options we might not get from the ACK */
ip4_addr_set_zero(&dhcp->offered_sn_mask);
ip4_addr_set_zero(&dhcp->offered_gw_addr);
#if LWIP_DHCP_BOOTP_FILE
ip4_addr_set_zero(&dhcp->offered_si_addr);
#endif /* LWIP_DHCP_BOOTP_FILE */
/* lease time given? */
if (dhcp_option_given(dhcp, DHCP_OPTION_IDX_LEASE_TIME)) {
/* remember offered lease time */
dhcp->offered_t0_lease = dhcp_get_option_value(dhcp, DHCP_OPTION_IDX_LEASE_TIME);
}
/* renewal period given? */
if (dhcp_option_given(dhcp, DHCP_OPTION_IDX_T1)) {
/* remember given renewal period */
dhcp->offered_t1_renew = dhcp_get_option_value(dhcp, DHCP_OPTION_IDX_T1);
} else {
/* calculate safe periods for renewal */
dhcp->offered_t1_renew = dhcp->offered_t0_lease / 2;
}
/* renewal period given? */
if (dhcp_option_given(dhcp, DHCP_OPTION_IDX_T2)) {
/* remember given rebind period */
dhcp->offered_t2_rebind = dhcp_get_option_value(dhcp, DHCP_OPTION_IDX_T2);
} else {
/* calculate safe periods for rebinding (offered_t0_lease * 0.875 -> 87.5%)*/
dhcp->offered_t2_rebind = (dhcp->offered_t0_lease * 7U) / 8U;
}
/* (y)our internet address */
ip4_addr_copy(dhcp->offered_ip_addr, dhcp->msg_in->yiaddr);
#if LWIP_DHCP_BOOTP_FILE
/* copy boot server address,
boot file name copied in dhcp_parse_reply if not overloaded */
ip4_addr_copy(dhcp->offered_si_addr, dhcp->msg_in->siaddr);
#endif /* LWIP_DHCP_BOOTP_FILE */
/* subnet mask given? */
if (dhcp_option_given(dhcp, DHCP_OPTION_IDX_SUBNET_MASK)) {
/* remember given subnet mask */
ip4_addr_set_u32(&dhcp->offered_sn_mask, lwip_htonl(dhcp_get_option_value(dhcp, DHCP_OPTION_IDX_SUBNET_MASK)));
dhcp->subnet_mask_given = 1;
} else {
dhcp->subnet_mask_given = 0;
}
/* gateway router */
if (dhcp_option_given(dhcp, DHCP_OPTION_IDX_ROUTER)) {
ip4_addr_set_u32(&dhcp->offered_gw_addr, lwip_htonl(dhcp_get_option_value(dhcp, DHCP_OPTION_IDX_ROUTER)));
}
#if LWIP_DHCP_GET_NTP_SRV
/* NTP servers */
for (n = 0; (n < LWIP_DHCP_MAX_NTP_SERVERS) && dhcp_option_given(dhcp, DHCP_OPTION_IDX_NTP_SERVER + n); n++) {
ip4_addr_set_u32(&ntp_server_addrs[n], lwip_htonl(dhcp_get_option_value(dhcp, DHCP_OPTION_IDX_NTP_SERVER + n)));
}
dhcp_set_ntp_servers(n, ntp_server_addrs);
#endif /* LWIP_DHCP_GET_NTP_SRV */
#if LWIP_DHCP_PROVIDE_DNS_SERVERS
/* DNS servers */
for (n = 0; (n < LWIP_DHCP_PROVIDE_DNS_SERVERS) && dhcp_option_given(dhcp, DHCP_OPTION_IDX_DNS_SERVER + n); n++) {
ip_addr_t dns_addr;
ip_addr_set_ip4_u32(&dns_addr, lwip_htonl(dhcp_get_option_value(dhcp, DHCP_OPTION_IDX_DNS_SERVER + n)));
dns_setserver(n, &dns_addr);
}
#endif /* LWIP_DHCP_PROVIDE_DNS_SERVERS */
}
/**
* @ingroup dhcp4
* Set a statically allocated struct dhcp to work with.
* Using this prevents dhcp_start to allocate it using mem_malloc.
*
* @param netif the netif for which to set the struct dhcp
* @param dhcp (uninitialised) dhcp struct allocated by the application
*/
void
dhcp_set_struct(struct netif *netif, struct dhcp *dhcp)
{
LWIP_ASSERT("netif != NULL", netif != NULL);
LWIP_ASSERT("dhcp != NULL", dhcp != NULL);
LWIP_ASSERT("netif already has a struct dhcp set", netif_dhcp_data(netif) == NULL);
/* clear data structure */
memset(dhcp, 0, sizeof(struct dhcp));
/* dhcp_set_state(&dhcp, DHCP_STATE_OFF); */
netif_set_client_data(netif, LWIP_NETIF_CLIENT_DATA_INDEX_DHCP, dhcp);
}
/**
* @ingroup dhcp4
* Removes a struct dhcp from a netif.
*
* ATTENTION: Only use this when not using dhcp_set_struct() to allocate the
* struct dhcp since the memory is passed back to the heap.
*
* @param netif the netif from which to remove the struct dhcp
*/
void dhcp_cleanup(struct netif *netif)
{
LWIP_ASSERT("netif != NULL", netif != NULL);
if (netif_dhcp_data(netif) != NULL) {
mem_free(netif_dhcp_data(netif));
netif_set_client_data(netif, LWIP_NETIF_CLIENT_DATA_INDEX_DHCP, NULL);
}
}
/**
* @ingroup dhcp4
* Start DHCP negotiation for a network interface.
*
* If no DHCP client instance was attached to this interface,
* a new client is created first. If a DHCP client instance
* was already present, it restarts negotiation.
*
* @param netif The lwIP network interface
* @return lwIP error code
* - ERR_OK - No error
* - ERR_MEM - Out of memory
*/
err_t
dhcp_start(struct netif *netif)
{
struct dhcp *dhcp;
err_t result;
LWIP_ERROR("netif != NULL", (netif != NULL), return ERR_ARG;);
LWIP_ERROR("netif is not up, old style port?", netif_is_up(netif), return ERR_ARG;);
dhcp = netif_dhcp_data(netif);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_start(netif=%p) %c%c%"U16_F"\n", (void*)netif, netif->name[0], netif->name[1], (u16_t)netif->num));
/* check MTU of the netif */
if (netif->mtu < DHCP_MAX_MSG_LEN_MIN_REQUIRED) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_start(): Cannot use this netif with DHCP: MTU is too small\n"));
return ERR_MEM;
}
/* no DHCP client attached yet? */
if (dhcp == NULL) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_start(): mallocing new DHCP client\n"));
dhcp = (struct dhcp *)mem_malloc(sizeof(struct dhcp));
if (dhcp == NULL) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_start(): could not allocate dhcp\n"));
return ERR_MEM;
}
/* store this dhcp client in the netif */
netif_set_client_data(netif, LWIP_NETIF_CLIENT_DATA_INDEX_DHCP, dhcp);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_start(): allocated dhcp"));
/* already has DHCP client attached */
} else {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_start(): restarting DHCP configuration\n"));
LWIP_ASSERT("pbuf p_out wasn't freed", dhcp->p_out == NULL);
LWIP_ASSERT("reply wasn't freed", dhcp->msg_in == NULL );
if (dhcp->pcb_allocated != 0) {
dhcp_dec_pcb_refcount(); /* free DHCP PCB if not needed any more */
}
/* dhcp is cleared below, no need to reset flag*/
}
/* clear data structure */
memset(dhcp, 0, sizeof(struct dhcp));
/* dhcp_set_state(&dhcp, DHCP_STATE_OFF); */
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_start(): starting DHCP configuration\n"));
if (dhcp_inc_pcb_refcount() != ERR_OK) { /* ensure DHCP PCB is allocated */
return ERR_MEM;
}
dhcp->pcb_allocated = 1;
#if LWIP_DHCP_CHECK_LINK_UP
if (!netif_is_link_up(netif)) {
/* set state INIT and wait for dhcp_network_changed() to call dhcp_discover() */
dhcp_set_state(dhcp, DHCP_STATE_INIT);
return ERR_OK;
}
#endif /* LWIP_DHCP_CHECK_LINK_UP */
/* (re)start the DHCP negotiation */
result = dhcp_discover(netif);
if (result != ERR_OK) {
/* free resources allocated above */
dhcp_stop(netif);
return ERR_MEM;
}
return result;
}
/**
* @ingroup dhcp4
* Inform a DHCP server of our manual configuration.
*
* This informs DHCP servers of our fixed IP address configuration
* by sending an INFORM message. It does not involve DHCP address
* configuration, it is just here to be nice to the network.
*
* @param netif The lwIP network interface
*/
void
dhcp_inform(struct netif *netif)
{
struct dhcp dhcp;
err_t result = ERR_OK;
LWIP_ERROR("netif != NULL", (netif != NULL), return;);
if (dhcp_inc_pcb_refcount() != ERR_OK) { /* ensure DHCP PCB is allocated */
return;
}
memset(&dhcp, 0, sizeof(struct dhcp));
dhcp_set_state(&dhcp, DHCP_STATE_INFORMING);
/* create and initialize the DHCP message header */
result = dhcp_create_msg(netif, &dhcp, DHCP_INFORM);
if (result == ERR_OK) {
dhcp_option(&dhcp, DHCP_OPTION_MAX_MSG_SIZE, DHCP_OPTION_MAX_MSG_SIZE_LEN);
dhcp_option_short(&dhcp, DHCP_MAX_MSG_LEN(netif));
dhcp_option_trailer(&dhcp);
pbuf_realloc(dhcp.p_out, sizeof(struct dhcp_msg) - DHCP_OPTIONS_LEN + dhcp.options_out_len);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_inform: INFORMING\n"));
udp_sendto_if(dhcp_pcb, dhcp.p_out, IP_ADDR_BROADCAST, DHCP_SERVER_PORT, netif);
dhcp_delete_msg(&dhcp);
} else {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_SERIOUS, ("dhcp_inform: could not allocate DHCP request\n"));
}
dhcp_dec_pcb_refcount(); /* delete DHCP PCB if not needed any more */
}
/** Handle a possible change in the network configuration.
*
* This enters the REBOOTING state to verify that the currently bound
* address is still valid.
*/
void
dhcp_network_changed(struct netif *netif)
{
struct dhcp *dhcp = netif_dhcp_data(netif);
if (!dhcp)
return;
switch (dhcp->state) {
case DHCP_STATE_REBINDING:
case DHCP_STATE_RENEWING:
case DHCP_STATE_BOUND:
case DHCP_STATE_REBOOTING:
dhcp->tries = 0;
dhcp_reboot(netif);
break;
case DHCP_STATE_OFF:
/* stay off */
break;
default:
/* INIT/REQUESTING/CHECKING/BACKING_OFF restart with new 'rid' because the
state changes, SELECTING: continue with current 'rid' as we stay in the
same state */
#if LWIP_DHCP_AUTOIP_COOP
if (dhcp->autoip_coop_state == DHCP_AUTOIP_COOP_STATE_ON) {
autoip_stop(netif);
dhcp->autoip_coop_state = DHCP_AUTOIP_COOP_STATE_OFF;
}
#endif /* LWIP_DHCP_AUTOIP_COOP */
/* ensure we start with short timeouts, even if already discovering */
dhcp->tries = 0;
dhcp_discover(netif);
break;
}
}
#if DHCP_DOES_ARP_CHECK
/**
* Match an ARP reply with the offered IP address:
* check whether the offered IP address is not in use using ARP
*
* @param netif the network interface on which the reply was received
* @param addr The IP address we received a reply from
*/
void
dhcp_arp_reply(struct netif *netif, const ip4_addr_t *addr)
{
struct dhcp *dhcp;
LWIP_ERROR("netif != NULL", (netif != NULL), return;);
dhcp = netif_dhcp_data(netif);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_arp_reply()\n"));
/* is a DHCP client doing an ARP check? */
if ((dhcp != NULL) && (dhcp->state == DHCP_STATE_CHECKING)) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_arp_reply(): CHECKING, arp reply for 0x%08"X32_F"\n",
ip4_addr_get_u32(addr)));
/* did a host respond with the address we
were offered by the DHCP server? */
if (ip4_addr_cmp(addr, &dhcp->offered_ip_addr)) {
/* we will not accept the offered address */
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE | LWIP_DBG_LEVEL_WARNING,
("dhcp_arp_reply(): arp reply matched with offered address, declining\n"));
dhcp_decline(netif);
}
}
}
/**
* Decline an offered lease.
*
* Tell the DHCP server we do not accept the offered address.
* One reason to decline the lease is when we find out the address
* is already in use by another host (through ARP).
*
* @param netif the netif under DHCP control
*/
static err_t
dhcp_decline(struct netif *netif)
{
struct dhcp *dhcp = netif_dhcp_data(netif);
err_t result = ERR_OK;
u16_t msecs;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_decline()\n"));
dhcp_set_state(dhcp, DHCP_STATE_BACKING_OFF);
/* create and initialize the DHCP message header */
result = dhcp_create_msg(netif, dhcp, DHCP_DECLINE);
if (result == ERR_OK) {
dhcp_option(dhcp, DHCP_OPTION_REQUESTED_IP, 4);
dhcp_option_long(dhcp, lwip_ntohl(ip4_addr_get_u32(&dhcp->offered_ip_addr)));
dhcp_option_trailer(dhcp);
/* resize pbuf to reflect true size of options */
pbuf_realloc(dhcp->p_out, sizeof(struct dhcp_msg) - DHCP_OPTIONS_LEN + dhcp->options_out_len);
/* per section 4.4.4, broadcast DECLINE messages */
udp_sendto_if_src(dhcp_pcb, dhcp->p_out, IP_ADDR_BROADCAST, DHCP_SERVER_PORT, netif, IP4_ADDR_ANY);
dhcp_delete_msg(dhcp);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_decline: BACKING OFF\n"));
} else {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_SERIOUS,
("dhcp_decline: could not allocate DHCP request\n"));
}
if (dhcp->tries < 255) {
dhcp->tries++;
}
msecs = 10*1000;
dhcp->request_timeout = (msecs + DHCP_FINE_TIMER_MSECS - 1) / DHCP_FINE_TIMER_MSECS;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_decline(): set request timeout %"U16_F" msecs\n", msecs));
return result;
}
#endif /* DHCP_DOES_ARP_CHECK */
/**
* Start the DHCP process, discover a DHCP server.
*
* @param netif the netif under DHCP control
*/
static err_t
dhcp_discover(struct netif *netif)
{
struct dhcp *dhcp = netif_dhcp_data(netif);
err_t result = ERR_OK;
u16_t msecs;
u8_t i;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_discover()\n"));
ip4_addr_set_any(&dhcp->offered_ip_addr);
dhcp_set_state(dhcp, DHCP_STATE_SELECTING);
/* create and initialize the DHCP message header */
result = dhcp_create_msg(netif, dhcp, DHCP_DISCOVER);
if (result == ERR_OK) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_discover: making request\n"));
dhcp_option(dhcp, DHCP_OPTION_MAX_MSG_SIZE, DHCP_OPTION_MAX_MSG_SIZE_LEN);
dhcp_option_short(dhcp, DHCP_MAX_MSG_LEN(netif));
dhcp_option(dhcp, DHCP_OPTION_PARAMETER_REQUEST_LIST, LWIP_ARRAYSIZE(dhcp_discover_request_options));
for (i = 0; i < LWIP_ARRAYSIZE(dhcp_discover_request_options); i++) {
dhcp_option_byte(dhcp, dhcp_discover_request_options[i]);
}
dhcp_option_trailer(dhcp);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_discover: realloc()ing\n"));
pbuf_realloc(dhcp->p_out, sizeof(struct dhcp_msg) - DHCP_OPTIONS_LEN + dhcp->options_out_len);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_discover: sendto(DISCOVER, IP_ADDR_BROADCAST, DHCP_SERVER_PORT)\n"));
udp_sendto_if_src(dhcp_pcb, dhcp->p_out, IP_ADDR_BROADCAST, DHCP_SERVER_PORT, netif, IP4_ADDR_ANY);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_discover: deleting()ing\n"));
dhcp_delete_msg(dhcp);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_discover: SELECTING\n"));
} else {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_SERIOUS, ("dhcp_discover: could not allocate DHCP request\n"));
}
if (dhcp->tries < 255) {
dhcp->tries++;
}
#if LWIP_DHCP_AUTOIP_COOP
if (dhcp->tries >= LWIP_DHCP_AUTOIP_COOP_TRIES && dhcp->autoip_coop_state == DHCP_AUTOIP_COOP_STATE_OFF) {
dhcp->autoip_coop_state = DHCP_AUTOIP_COOP_STATE_ON;
autoip_start(netif);
}
#endif /* LWIP_DHCP_AUTOIP_COOP */
msecs = (dhcp->tries < 6 ? 1 << dhcp->tries : 60) * 1000;
dhcp->request_timeout = (msecs + DHCP_FINE_TIMER_MSECS - 1) / DHCP_FINE_TIMER_MSECS;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_discover(): set request timeout %"U16_F" msecs\n", msecs));
return result;
}
/**
* Bind the interface to the offered IP address.
*
* @param netif network interface to bind to the offered address
*/
static void
dhcp_bind(struct netif *netif)
{
u32_t timeout;
struct dhcp *dhcp;
ip4_addr_t sn_mask, gw_addr;
LWIP_ERROR("dhcp_bind: netif != NULL", (netif != NULL), return;);
dhcp = netif_dhcp_data(netif);
LWIP_ERROR("dhcp_bind: dhcp != NULL", (dhcp != NULL), return;);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_bind(netif=%p) %c%c%"U16_F"\n", (void*)netif, netif->name[0], netif->name[1], (u16_t)netif->num));
/* reset time used of lease */
dhcp->lease_used = 0;
if (dhcp->offered_t0_lease != 0xffffffffUL) {
/* set renewal period timer */
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_bind(): t0 renewal timer %"U32_F" secs\n", dhcp->offered_t0_lease));
timeout = (dhcp->offered_t0_lease + DHCP_COARSE_TIMER_SECS / 2) / DHCP_COARSE_TIMER_SECS;
if (timeout > 0xffff) {
timeout = 0xffff;
}
dhcp->t0_timeout = (u16_t)timeout;
if (dhcp->t0_timeout == 0) {
dhcp->t0_timeout = 1;
}
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_bind(): set request timeout %"U32_F" msecs\n", dhcp->offered_t0_lease*1000));
}
/* temporary DHCP lease? */
if (dhcp->offered_t1_renew != 0xffffffffUL) {
/* set renewal period timer */
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_bind(): t1 renewal timer %"U32_F" secs\n", dhcp->offered_t1_renew));
timeout = (dhcp->offered_t1_renew + DHCP_COARSE_TIMER_SECS / 2) / DHCP_COARSE_TIMER_SECS;
if (timeout > 0xffff) {
timeout = 0xffff;
}
dhcp->t1_timeout = (u16_t)timeout;
if (dhcp->t1_timeout == 0) {
dhcp->t1_timeout = 1;
}
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_bind(): set request timeout %"U32_F" msecs\n", dhcp->offered_t1_renew*1000));
dhcp->t1_renew_time = dhcp->t1_timeout;
}
/* set renewal period timer */
if (dhcp->offered_t2_rebind != 0xffffffffUL) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_bind(): t2 rebind timer %"U32_F" secs\n", dhcp->offered_t2_rebind));
timeout = (dhcp->offered_t2_rebind + DHCP_COARSE_TIMER_SECS / 2) / DHCP_COARSE_TIMER_SECS;
if (timeout > 0xffff) {
timeout = 0xffff;
}
dhcp->t2_timeout = (u16_t)timeout;
if (dhcp->t2_timeout == 0) {
dhcp->t2_timeout = 1;
}
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_bind(): set request timeout %"U32_F" msecs\n", dhcp->offered_t2_rebind*1000));
dhcp->t2_rebind_time = dhcp->t2_timeout;
}
/* If we have sub 1 minute lease, t2 and t1 will kick in at the same time. */
if ((dhcp->t1_timeout >= dhcp->t2_timeout) && (dhcp->t2_timeout > 0)) {
dhcp->t1_timeout = 0;
}
if (dhcp->subnet_mask_given) {
/* copy offered network mask */
ip4_addr_copy(sn_mask, dhcp->offered_sn_mask);
} else {
/* subnet mask not given, choose a safe subnet mask given the network class */
u8_t first_octet = ip4_addr1(&dhcp->offered_ip_addr);
if (first_octet <= 127) {
ip4_addr_set_u32(&sn_mask, PP_HTONL(0xff000000UL));
} else if (first_octet >= 192) {
ip4_addr_set_u32(&sn_mask, PP_HTONL(0xffffff00UL));
} else {
ip4_addr_set_u32(&sn_mask, PP_HTONL(0xffff0000UL));
}
}
ip4_addr_copy(gw_addr, dhcp->offered_gw_addr);
/* gateway address not given? */
if (ip4_addr_isany_val(gw_addr)) {
/* copy network address */
ip4_addr_get_network(&gw_addr, &dhcp->offered_ip_addr, &sn_mask);
/* use first host address on network as gateway */
ip4_addr_set_u32(&gw_addr, ip4_addr_get_u32(&gw_addr) | PP_HTONL(0x00000001UL));
}
#if LWIP_DHCP_AUTOIP_COOP
if (dhcp->autoip_coop_state == DHCP_AUTOIP_COOP_STATE_ON) {
autoip_stop(netif);
dhcp->autoip_coop_state = DHCP_AUTOIP_COOP_STATE_OFF;
}
#endif /* LWIP_DHCP_AUTOIP_COOP */
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_STATE, ("dhcp_bind(): IP: 0x%08"X32_F" SN: 0x%08"X32_F" GW: 0x%08"X32_F"\n",
ip4_addr_get_u32(&dhcp->offered_ip_addr), ip4_addr_get_u32(&sn_mask), ip4_addr_get_u32(&gw_addr)));
/* netif is now bound to DHCP leased address - set this before assigning the address
to ensure the callback can use dhcp_supplied_address() */
dhcp_set_state(dhcp, DHCP_STATE_BOUND);
netif_set_addr(netif, &dhcp->offered_ip_addr, &sn_mask, &gw_addr);
/* interface is used by routing now that an address is set */
}
/**
* @ingroup dhcp4
* Renew an existing DHCP lease at the involved DHCP server.
*
* @param netif network interface which must renew its lease
*/
err_t
dhcp_renew(struct netif *netif)
{
struct dhcp *dhcp = netif_dhcp_data(netif);
err_t result;
u16_t msecs;
u8_t i;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_renew()\n"));
dhcp_set_state(dhcp, DHCP_STATE_RENEWING);
/* create and initialize the DHCP message header */
result = dhcp_create_msg(netif, dhcp, DHCP_REQUEST);
if (result == ERR_OK) {
dhcp_option(dhcp, DHCP_OPTION_MAX_MSG_SIZE, DHCP_OPTION_MAX_MSG_SIZE_LEN);
dhcp_option_short(dhcp, DHCP_MAX_MSG_LEN(netif));
dhcp_option(dhcp, DHCP_OPTION_PARAMETER_REQUEST_LIST, LWIP_ARRAYSIZE(dhcp_discover_request_options));
for (i = 0; i < LWIP_ARRAYSIZE(dhcp_discover_request_options); i++) {
dhcp_option_byte(dhcp, dhcp_discover_request_options[i]);
}
#if LWIP_NETIF_HOSTNAME
dhcp_option_hostname(dhcp, netif);
#endif /* LWIP_NETIF_HOSTNAME */
/* append DHCP message trailer */
dhcp_option_trailer(dhcp);
pbuf_realloc(dhcp->p_out, sizeof(struct dhcp_msg) - DHCP_OPTIONS_LEN + dhcp->options_out_len);
udp_sendto_if(dhcp_pcb, dhcp->p_out, &dhcp->server_ip_addr, DHCP_SERVER_PORT, netif);
dhcp_delete_msg(dhcp);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_renew: RENEWING\n"));
} else {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_SERIOUS, ("dhcp_renew: could not allocate DHCP request\n"));
}
if (dhcp->tries < 255) {
dhcp->tries++;
}
/* back-off on retries, but to a maximum of 20 seconds */
msecs = dhcp->tries < 10 ? dhcp->tries * 2000 : 20 * 1000;
dhcp->request_timeout = (msecs + DHCP_FINE_TIMER_MSECS - 1) / DHCP_FINE_TIMER_MSECS;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_renew(): set request timeout %"U16_F" msecs\n", msecs));
return result;
}
/**
* Rebind with a DHCP server for an existing DHCP lease.
*
* @param netif network interface which must rebind with a DHCP server
*/
static err_t
dhcp_rebind(struct netif *netif)
{
struct dhcp *dhcp = netif_dhcp_data(netif);
err_t result;
u16_t msecs;
u8_t i;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_rebind()\n"));
dhcp_set_state(dhcp, DHCP_STATE_REBINDING);
/* create and initialize the DHCP message header */
result = dhcp_create_msg(netif, dhcp, DHCP_REQUEST);
if (result == ERR_OK) {
dhcp_option(dhcp, DHCP_OPTION_MAX_MSG_SIZE, DHCP_OPTION_MAX_MSG_SIZE_LEN);
dhcp_option_short(dhcp, DHCP_MAX_MSG_LEN(netif));
dhcp_option(dhcp, DHCP_OPTION_PARAMETER_REQUEST_LIST, LWIP_ARRAYSIZE(dhcp_discover_request_options));
for (i = 0; i < LWIP_ARRAYSIZE(dhcp_discover_request_options); i++) {
dhcp_option_byte(dhcp, dhcp_discover_request_options[i]);
}
#if LWIP_NETIF_HOSTNAME
dhcp_option_hostname(dhcp, netif);
#endif /* LWIP_NETIF_HOSTNAME */
dhcp_option_trailer(dhcp);
pbuf_realloc(dhcp->p_out, sizeof(struct dhcp_msg) - DHCP_OPTIONS_LEN + dhcp->options_out_len);
/* broadcast to server */
udp_sendto_if(dhcp_pcb, dhcp->p_out, IP_ADDR_BROADCAST, DHCP_SERVER_PORT, netif);
dhcp_delete_msg(dhcp);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_rebind: REBINDING\n"));
} else {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_SERIOUS, ("dhcp_rebind: could not allocate DHCP request\n"));
}
if (dhcp->tries < 255) {
dhcp->tries++;
}
msecs = dhcp->tries < 10 ? dhcp->tries * 1000 : 10 * 1000;
dhcp->request_timeout = (msecs + DHCP_FINE_TIMER_MSECS - 1) / DHCP_FINE_TIMER_MSECS;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_rebind(): set request timeout %"U16_F" msecs\n", msecs));
return result;
}
/**
* Enter REBOOTING state to verify an existing lease
*
* @param netif network interface which must reboot
*/
static err_t
dhcp_reboot(struct netif *netif)
{
struct dhcp *dhcp = netif_dhcp_data(netif);
err_t result;
u16_t msecs;
u8_t i;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_reboot()\n"));
dhcp_set_state(dhcp, DHCP_STATE_REBOOTING);
/* create and initialize the DHCP message header */
result = dhcp_create_msg(netif, dhcp, DHCP_REQUEST);
if (result == ERR_OK) {
dhcp_option(dhcp, DHCP_OPTION_MAX_MSG_SIZE, DHCP_OPTION_MAX_MSG_SIZE_LEN);
dhcp_option_short(dhcp, DHCP_MAX_MSG_LEN_MIN_REQUIRED);
dhcp_option(dhcp, DHCP_OPTION_REQUESTED_IP, 4);
dhcp_option_long(dhcp, lwip_ntohl(ip4_addr_get_u32(&dhcp->offered_ip_addr)));
dhcp_option(dhcp, DHCP_OPTION_PARAMETER_REQUEST_LIST, LWIP_ARRAYSIZE(dhcp_discover_request_options));
for (i = 0; i < LWIP_ARRAYSIZE(dhcp_discover_request_options); i++) {
dhcp_option_byte(dhcp, dhcp_discover_request_options[i]);
}
dhcp_option_trailer(dhcp);
pbuf_realloc(dhcp->p_out, sizeof(struct dhcp_msg) - DHCP_OPTIONS_LEN + dhcp->options_out_len);
/* broadcast to server */
udp_sendto_if(dhcp_pcb, dhcp->p_out, IP_ADDR_BROADCAST, DHCP_SERVER_PORT, netif);
dhcp_delete_msg(dhcp);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_reboot: REBOOTING\n"));
} else {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_SERIOUS, ("dhcp_reboot: could not allocate DHCP request\n"));
}
if (dhcp->tries < 255) {
dhcp->tries++;
}
msecs = dhcp->tries < 10 ? dhcp->tries * 1000 : 10 * 1000;
dhcp->request_timeout = (msecs + DHCP_FINE_TIMER_MSECS - 1) / DHCP_FINE_TIMER_MSECS;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_reboot(): set request timeout %"U16_F" msecs\n", msecs));
return result;
}
/**
* @ingroup dhcp4
* Release a DHCP lease (usually called before @ref dhcp_stop).
*
* @param netif network interface which must release its lease
*/
err_t
dhcp_release(struct netif *netif)
{
struct dhcp *dhcp = netif_dhcp_data(netif);
err_t result;
ip_addr_t server_ip_addr;
u8_t is_dhcp_supplied_address;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_release()\n"));
if (dhcp == NULL) {
return ERR_ARG;
}
ip_addr_copy(server_ip_addr, dhcp->server_ip_addr);
is_dhcp_supplied_address = dhcp_supplied_address(netif);
/* idle DHCP client */
dhcp_set_state(dhcp, DHCP_STATE_OFF);
/* clean old DHCP offer */
ip_addr_set_zero_ip4(&dhcp->server_ip_addr);
ip4_addr_set_zero(&dhcp->offered_ip_addr);
ip4_addr_set_zero(&dhcp->offered_sn_mask);
ip4_addr_set_zero(&dhcp->offered_gw_addr);
#if LWIP_DHCP_BOOTP_FILE
ip4_addr_set_zero(&dhcp->offered_si_addr);
#endif /* LWIP_DHCP_BOOTP_FILE */
dhcp->offered_t0_lease = dhcp->offered_t1_renew = dhcp->offered_t2_rebind = 0;
dhcp->t1_renew_time = dhcp->t2_rebind_time = dhcp->lease_used = dhcp->t0_timeout = 0;
if (!is_dhcp_supplied_address) {
/* don't issue release message when address is not dhcp-assigned */
return ERR_OK;
}
/* create and initialize the DHCP message header */
result = dhcp_create_msg(netif, dhcp, DHCP_RELEASE);
if (result == ERR_OK) {
dhcp_option(dhcp, DHCP_OPTION_SERVER_ID, 4);
dhcp_option_long(dhcp, lwip_ntohl(ip4_addr_get_u32(ip_2_ip4(&server_ip_addr))));
dhcp_option_trailer(dhcp);
pbuf_realloc(dhcp->p_out, sizeof(struct dhcp_msg) - DHCP_OPTIONS_LEN + dhcp->options_out_len);
udp_sendto_if(dhcp_pcb, dhcp->p_out, &server_ip_addr, DHCP_SERVER_PORT, netif);
dhcp_delete_msg(dhcp);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_STATE, ("dhcp_release: RELEASED, DHCP_STATE_OFF\n"));
} else {
/* sending release failed, but that's not a problem since the correct behaviour of dhcp does not rely on release */
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_SERIOUS, ("dhcp_release: could not allocate DHCP request\n"));
}
/* remove IP address from interface (prevents routing from selecting this interface) */
netif_set_addr(netif, IP4_ADDR_ANY4, IP4_ADDR_ANY4, IP4_ADDR_ANY4);
return result;
}
/**
* @ingroup dhcp4
* Remove the DHCP client from the interface.
*
* @param netif The network interface to stop DHCP on
*/
void
dhcp_stop(struct netif *netif)
{
struct dhcp *dhcp;
LWIP_ERROR("dhcp_stop: netif != NULL", (netif != NULL), return;);
dhcp = netif_dhcp_data(netif);
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_stop()\n"));
/* netif is DHCP configured? */
if (dhcp != NULL) {
#if LWIP_DHCP_AUTOIP_COOP
if (dhcp->autoip_coop_state == DHCP_AUTOIP_COOP_STATE_ON) {
autoip_stop(netif);
dhcp->autoip_coop_state = DHCP_AUTOIP_COOP_STATE_OFF;
}
#endif /* LWIP_DHCP_AUTOIP_COOP */
LWIP_ASSERT("reply wasn't freed", dhcp->msg_in == NULL);
dhcp_set_state(dhcp, DHCP_STATE_OFF);
if (dhcp->pcb_allocated != 0) {
dhcp_dec_pcb_refcount(); /* free DHCP PCB if not needed any more */
dhcp->pcb_allocated = 0;
}
}
}
/*
* Set the DHCP state of a DHCP client.
*
* If the state changed, reset the number of tries.
*/
static void
dhcp_set_state(struct dhcp *dhcp, u8_t new_state)
{
if (new_state != dhcp->state) {
dhcp->state = new_state;
dhcp->tries = 0;
dhcp->request_timeout = 0;
}
}
/*
* Concatenate an option type and length field to the outgoing
* DHCP message.
*
*/
static void
dhcp_option(struct dhcp *dhcp, u8_t option_type, u8_t option_len)
{
LWIP_ASSERT("dhcp_option: dhcp->options_out_len + 2 + option_len <= DHCP_OPTIONS_LEN", dhcp->options_out_len + 2U + option_len <= DHCP_OPTIONS_LEN);
dhcp->msg_out->options[dhcp->options_out_len++] = option_type;
dhcp->msg_out->options[dhcp->options_out_len++] = option_len;
}
/*
* Concatenate a single byte to the outgoing DHCP message.
*
*/
static void
dhcp_option_byte(struct dhcp *dhcp, u8_t value)
{
LWIP_ASSERT("dhcp_option_byte: dhcp->options_out_len < DHCP_OPTIONS_LEN", dhcp->options_out_len < DHCP_OPTIONS_LEN);
dhcp->msg_out->options[dhcp->options_out_len++] = value;
}
static void
dhcp_option_short(struct dhcp *dhcp, u16_t value)
{
LWIP_ASSERT("dhcp_option_short: dhcp->options_out_len + 2 <= DHCP_OPTIONS_LEN", dhcp->options_out_len + 2U <= DHCP_OPTIONS_LEN);
dhcp->msg_out->options[dhcp->options_out_len++] = (u8_t)((value & 0xff00U) >> 8);
dhcp->msg_out->options[dhcp->options_out_len++] = (u8_t) (value & 0x00ffU);
}
static void
dhcp_option_long(struct dhcp *dhcp, u32_t value)
{
LWIP_ASSERT("dhcp_option_long: dhcp->options_out_len + 4 <= DHCP_OPTIONS_LEN", dhcp->options_out_len + 4U <= DHCP_OPTIONS_LEN);
dhcp->msg_out->options[dhcp->options_out_len++] = (u8_t)((value & 0xff000000UL) >> 24);
dhcp->msg_out->options[dhcp->options_out_len++] = (u8_t)((value & 0x00ff0000UL) >> 16);
dhcp->msg_out->options[dhcp->options_out_len++] = (u8_t)((value & 0x0000ff00UL) >> 8);
dhcp->msg_out->options[dhcp->options_out_len++] = (u8_t)((value & 0x000000ffUL));
}
#if LWIP_NETIF_HOSTNAME
static void
dhcp_option_hostname(struct dhcp *dhcp, struct netif *netif)
{
if (netif->hostname != NULL) {
size_t namelen = strlen(netif->hostname);
if (namelen > 0) {
size_t len;
const char *p = netif->hostname;
/* Shrink len to available bytes (need 2 bytes for OPTION_HOSTNAME
and 1 byte for trailer) */
size_t available = DHCP_OPTIONS_LEN - dhcp->options_out_len - 3;
LWIP_ASSERT("DHCP: hostname is too long!", namelen <= available);
len = LWIP_MIN(namelen, available);
LWIP_ASSERT("DHCP: hostname is too long!", len <= 0xFF);
dhcp_option(dhcp, DHCP_OPTION_HOSTNAME, (u8_t)len);
while (len--) {
dhcp_option_byte(dhcp, *p++);
}
}
}
}
#endif /* LWIP_NETIF_HOSTNAME */
/**
* Extract the DHCP message and the DHCP options.
*
* Extract the DHCP message and the DHCP options, each into a contiguous
* piece of memory. As a DHCP message is variable sized by its options,
* and also allows overriding some fields for options, the easy approach
* is to first unfold the options into a contiguous piece of memory, and
* use that further on.
*
*/
static err_t
dhcp_parse_reply(struct dhcp *dhcp, struct pbuf *p)
{
u8_t *options;
u16_t offset;
u16_t offset_max;
u16_t options_idx;
u16_t options_idx_max;
struct pbuf *q;
int parse_file_as_options = 0;
int parse_sname_as_options = 0;
/* clear received options */
dhcp_clear_all_options(dhcp);
/* check that beginning of dhcp_msg (up to and including chaddr) is in first pbuf */
if (p->len < DHCP_SNAME_OFS) {
return ERR_BUF;
}
dhcp->msg_in = (struct dhcp_msg *)p->payload;
#if LWIP_DHCP_BOOTP_FILE
/* clear boot file name */
dhcp->boot_file_name[0] = 0;
#endif /* LWIP_DHCP_BOOTP_FILE */
/* parse options */
/* start with options field */
options_idx = DHCP_OPTIONS_OFS;
/* parse options to the end of the received packet */
options_idx_max = p->tot_len;
again:
q = p;
while ((q != NULL) && (options_idx >= q->len)) {
options_idx -= q->len;
options_idx_max -= q->len;
q = q->next;
}
if (q == NULL) {
return ERR_BUF;
}
offset = options_idx;
offset_max = options_idx_max;
options = (u8_t*)q->payload;
/* at least 1 byte to read and no end marker, then at least 3 bytes to read? */
while ((q != NULL) && (offset < offset_max) && (options[offset] != DHCP_OPTION_END)) {
u8_t op = options[offset];
u8_t len;
u8_t decode_len = 0;
int decode_idx = -1;
u16_t val_offset = offset + 2;
/* len byte might be in the next pbuf */
if ((offset + 1) < q->len) {
len = options[offset + 1];
} else {
len = (q->next != NULL ? ((u8_t*)q->next->payload)[0] : 0);
}
/* LWIP_DEBUGF(DHCP_DEBUG, ("msg_offset=%"U16_F", q->len=%"U16_F, msg_offset, q->len)); */
decode_len = len;
switch(op) {
/* case(DHCP_OPTION_END): handled above */
case(DHCP_OPTION_PAD):
/* special option: no len encoded */
decode_len = len = 0;
/* will be increased below */
offset--;
break;
case(DHCP_OPTION_SUBNET_MASK):
LWIP_ERROR("len == 4", len == 4, return ERR_VAL;);
decode_idx = DHCP_OPTION_IDX_SUBNET_MASK;
break;
case(DHCP_OPTION_ROUTER):
decode_len = 4; /* only copy the first given router */
LWIP_ERROR("len >= decode_len", len >= decode_len, return ERR_VAL;);
decode_idx = DHCP_OPTION_IDX_ROUTER;
break;
#if LWIP_DHCP_PROVIDE_DNS_SERVERS
case(DHCP_OPTION_DNS_SERVER):
/* special case: there might be more than one server */
LWIP_ERROR("len %% 4 == 0", len % 4 == 0, return ERR_VAL;);
/* limit number of DNS servers */
decode_len = LWIP_MIN(len, 4 * DNS_MAX_SERVERS);
LWIP_ERROR("len >= decode_len", len >= decode_len, return ERR_VAL;);
decode_idx = DHCP_OPTION_IDX_DNS_SERVER;
break;
#endif /* LWIP_DHCP_PROVIDE_DNS_SERVERS */
case(DHCP_OPTION_LEASE_TIME):
LWIP_ERROR("len == 4", len == 4, return ERR_VAL;);
decode_idx = DHCP_OPTION_IDX_LEASE_TIME;
break;
#if LWIP_DHCP_GET_NTP_SRV
case(DHCP_OPTION_NTP):
/* special case: there might be more than one server */
LWIP_ERROR("len %% 4 == 0", len % 4 == 0, return ERR_VAL;);
/* limit number of NTP servers */
decode_len = LWIP_MIN(len, 4 * LWIP_DHCP_MAX_NTP_SERVERS);
LWIP_ERROR("len >= decode_len", len >= decode_len, return ERR_VAL;);
decode_idx = DHCP_OPTION_IDX_NTP_SERVER;
break;
#endif /* LWIP_DHCP_GET_NTP_SRV*/
case(DHCP_OPTION_OVERLOAD):
LWIP_ERROR("len == 1", len == 1, return ERR_VAL;);
/* decode overload only in options, not in file/sname: invalid packet */
LWIP_ERROR("overload in file/sname", options_idx == DHCP_OPTIONS_OFS, return ERR_VAL;);
decode_idx = DHCP_OPTION_IDX_OVERLOAD;
break;
case(DHCP_OPTION_MESSAGE_TYPE):
LWIP_ERROR("len == 1", len == 1, return ERR_VAL;);
decode_idx = DHCP_OPTION_IDX_MSG_TYPE;
break;
case(DHCP_OPTION_SERVER_ID):
LWIP_ERROR("len == 4", len == 4, return ERR_VAL;);
decode_idx = DHCP_OPTION_IDX_SERVER_ID;
break;
case(DHCP_OPTION_T1):
LWIP_ERROR("len == 4", len == 4, return ERR_VAL;);
decode_idx = DHCP_OPTION_IDX_T1;
break;
case(DHCP_OPTION_T2):
LWIP_ERROR("len == 4", len == 4, return ERR_VAL;);
decode_idx = DHCP_OPTION_IDX_T2;
break;
default:
decode_len = 0;
LWIP_DEBUGF(DHCP_DEBUG, ("skipping option %"U16_F" in options\n", (u16_t)op));
break;
}
offset += len + 2;
if (decode_len > 0) {
u32_t value = 0;
u16_t copy_len;
decode_next:
LWIP_ASSERT("check decode_idx", decode_idx >= 0 && decode_idx < DHCP_OPTION_IDX_MAX);
if (!dhcp_option_given(dhcp, decode_idx)) {
copy_len = LWIP_MIN(decode_len, 4);
if (pbuf_copy_partial(q, &value, copy_len, val_offset) != copy_len) {
return ERR_BUF;
}
if (decode_len > 4) {
/* decode more than one u32_t */
LWIP_ERROR("decode_len %% 4 == 0", decode_len % 4 == 0, return ERR_VAL;);
dhcp_got_option(dhcp, decode_idx);
dhcp_set_option_value(dhcp, decode_idx, lwip_htonl(value));
decode_len -= 4;
val_offset += 4;
decode_idx++;
goto decode_next;
} else if (decode_len == 4) {
value = lwip_ntohl(value);
} else {
LWIP_ERROR("invalid decode_len", decode_len == 1, return ERR_VAL;);
value = ((u8_t*)&value)[0];
}
dhcp_got_option(dhcp, decode_idx);
dhcp_set_option_value(dhcp, decode_idx, value);
}
}
if (offset >= q->len) {
offset -= q->len;
offset_max -= q->len;
if ((offset < offset_max) && offset_max) {
q = q->next;
LWIP_ERROR("next pbuf was null", q != NULL, return ERR_VAL;);
options = (u8_t*)q->payload;
} else {
/* We've run out of bytes, probably no end marker. Don't proceed. */
break;
}
}
}
/* is this an overloaded message? */
if (dhcp_option_given(dhcp, DHCP_OPTION_IDX_OVERLOAD)) {
u32_t overload = dhcp_get_option_value(dhcp, DHCP_OPTION_IDX_OVERLOAD);
dhcp_clear_option(dhcp, DHCP_OPTION_IDX_OVERLOAD);
if (overload == DHCP_OVERLOAD_FILE) {
parse_file_as_options = 1;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("overloaded file field\n"));
} else if (overload == DHCP_OVERLOAD_SNAME) {
parse_sname_as_options = 1;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("overloaded sname field\n"));
} else if (overload == DHCP_OVERLOAD_SNAME_FILE) {
parse_sname_as_options = 1;
parse_file_as_options = 1;
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("overloaded sname and file field\n"));
} else {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("invalid overload option: %d\n", (int)overload));
}
#if LWIP_DHCP_BOOTP_FILE
if (!parse_file_as_options) {
/* only do this for ACK messages */
if (dhcp_option_given(dhcp, DHCP_OPTION_IDX_MSG_TYPE) &&
(dhcp_get_option_value(dhcp, DHCP_OPTION_IDX_MSG_TYPE) == DHCP_ACK))
/* copy bootp file name, don't care for sname (server hostname) */
if (pbuf_copy_partial(p, dhcp->boot_file_name, DHCP_FILE_LEN-1, DHCP_FILE_OFS) != (DHCP_FILE_LEN-1)) {
return ERR_BUF;
}
/* make sure the string is really NULL-terminated */
dhcp->boot_file_name[DHCP_FILE_LEN-1] = 0;
}
#endif /* LWIP_DHCP_BOOTP_FILE */
}
if (parse_file_as_options) {
/* if both are overloaded, parse file first and then sname (RFC 2131 ch. 4.1) */
parse_file_as_options = 0;
options_idx = DHCP_FILE_OFS;
options_idx_max = DHCP_FILE_OFS + DHCP_FILE_LEN;
goto again;
} else if (parse_sname_as_options) {
parse_sname_as_options = 0;
options_idx = DHCP_SNAME_OFS;
options_idx_max = DHCP_SNAME_OFS + DHCP_SNAME_LEN;
goto again;
}
return ERR_OK;
}
/**
* If an incoming DHCP message is in response to us, then trigger the state machine
*/
static void
dhcp_recv(void *arg, struct udp_pcb *pcb, struct pbuf *p, const ip_addr_t *addr, u16_t port)
{
struct netif *netif = ip_current_input_netif();
struct dhcp *dhcp = netif_dhcp_data(netif);
struct dhcp_msg *reply_msg = (struct dhcp_msg *)p->payload;
u8_t msg_type;
u8_t i;
LWIP_UNUSED_ARG(arg);
/* Caught DHCP message from netif that does not have DHCP enabled? -> not interested */
if ((dhcp == NULL) || (dhcp->pcb_allocated == 0)) {
goto free_pbuf_and_return;
}
LWIP_ASSERT("invalid server address type", IP_IS_V4(addr));
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("dhcp_recv(pbuf = %p) from DHCP server %"U16_F".%"U16_F".%"U16_F".%"U16_F" port %"U16_F"\n", (void*)p,
ip4_addr1_16(ip_2_ip4(addr)), ip4_addr2_16(ip_2_ip4(addr)), ip4_addr3_16(ip_2_ip4(addr)), ip4_addr4_16(ip_2_ip4(addr)), port));
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("pbuf->len = %"U16_F"\n", p->len));
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("pbuf->tot_len = %"U16_F"\n", p->tot_len));
/* prevent warnings about unused arguments */
LWIP_UNUSED_ARG(pcb);
LWIP_UNUSED_ARG(addr);
LWIP_UNUSED_ARG(port);
LWIP_ASSERT("reply wasn't freed", dhcp->msg_in == NULL);
if (p->len < DHCP_MIN_REPLY_LEN) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_WARNING, ("DHCP reply message or pbuf too short\n"));
goto free_pbuf_and_return;
}
if (reply_msg->op != DHCP_BOOTREPLY) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_WARNING, ("not a DHCP reply message, but type %"U16_F"\n", (u16_t)reply_msg->op));
goto free_pbuf_and_return;
}
/* iterate through hardware address and match against DHCP message */
for (i = 0; i < netif->hwaddr_len && i < NETIF_MAX_HWADDR_LEN && i < DHCP_CHADDR_LEN; i++) {
if (netif->hwaddr[i] != reply_msg->chaddr[i]) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_WARNING,
("netif->hwaddr[%"U16_F"]==%02"X16_F" != reply_msg->chaddr[%"U16_F"]==%02"X16_F"\n",
(u16_t)i, (u16_t)netif->hwaddr[i], (u16_t)i, (u16_t)reply_msg->chaddr[i]));
goto free_pbuf_and_return;
}
}
/* match transaction ID against what we expected */
if (lwip_ntohl(reply_msg->xid) != dhcp->xid) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_WARNING,
("transaction id mismatch reply_msg->xid(%"X32_F")!=dhcp->xid(%"X32_F")\n",lwip_ntohl(reply_msg->xid),dhcp->xid));
goto free_pbuf_and_return;
}
/* option fields could be unfold? */
if (dhcp_parse_reply(dhcp, p) != ERR_OK) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_SERIOUS,
("problem unfolding DHCP message - too short on memory?\n"));
goto free_pbuf_and_return;
}
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("searching DHCP_OPTION_MESSAGE_TYPE\n"));
/* obtain pointer to DHCP message type */
if (!dhcp_option_given(dhcp, DHCP_OPTION_IDX_MSG_TYPE)) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_WARNING, ("DHCP_OPTION_MESSAGE_TYPE option not found\n"));
goto free_pbuf_and_return;
}
/* read DHCP message type */
msg_type = (u8_t)dhcp_get_option_value(dhcp, DHCP_OPTION_IDX_MSG_TYPE);
/* message type is DHCP ACK? */
if (msg_type == DHCP_ACK) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("DHCP_ACK received\n"));
/* in requesting state? */
if (dhcp->state == DHCP_STATE_REQUESTING) {
dhcp_handle_ack(netif);
#if DHCP_DOES_ARP_CHECK
if ((netif->flags & NETIF_FLAG_ETHARP) != 0) {
/* check if the acknowledged lease address is already in use */
dhcp_check(netif);
} else {
/* bind interface to the acknowledged lease address */
dhcp_bind(netif);
}
#else
/* bind interface to the acknowledged lease address */
dhcp_bind(netif);
#endif
}
/* already bound to the given lease address? */
else if ((dhcp->state == DHCP_STATE_REBOOTING) || (dhcp->state == DHCP_STATE_REBINDING) ||
(dhcp->state == DHCP_STATE_RENEWING)) {
dhcp_handle_ack(netif);
dhcp_bind(netif);
}
}
/* received a DHCP_NAK in appropriate state? */
else if ((msg_type == DHCP_NAK) &&
((dhcp->state == DHCP_STATE_REBOOTING) || (dhcp->state == DHCP_STATE_REQUESTING) ||
(dhcp->state == DHCP_STATE_REBINDING) || (dhcp->state == DHCP_STATE_RENEWING ))) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("DHCP_NAK received\n"));
dhcp_handle_nak(netif);
}
/* received a DHCP_OFFER in DHCP_STATE_SELECTING state? */
else if ((msg_type == DHCP_OFFER) && (dhcp->state == DHCP_STATE_SELECTING)) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE, ("DHCP_OFFER received in DHCP_STATE_SELECTING state\n"));
dhcp->request_timeout = 0;
/* remember offered lease */
dhcp_handle_offer(netif);
}
free_pbuf_and_return:
if (dhcp != NULL) {
dhcp->msg_in = NULL;
}
pbuf_free(p);
}
/**
* Create a DHCP request, fill in common headers
*
* @param netif the netif under DHCP control
* @param dhcp dhcp control struct
* @param message_type message type of the request
*/
static err_t
dhcp_create_msg(struct netif *netif, struct dhcp *dhcp, u8_t message_type)
{
u16_t i;
#ifndef DHCP_GLOBAL_XID
/** default global transaction identifier starting value (easy to match
* with a packet analyser). We simply increment for each new request.
* Predefine DHCP_GLOBAL_XID to a better value or a function call to generate one
* at runtime, any supporting function prototypes can be defined in DHCP_GLOBAL_XID_HEADER */
#if DHCP_CREATE_RAND_XID && defined(LWIP_RAND)
static u32_t xid;
#else /* DHCP_CREATE_RAND_XID && defined(LWIP_RAND) */
static u32_t xid = 0xABCD0000;
#endif /* DHCP_CREATE_RAND_XID && defined(LWIP_RAND) */
#else
if (!xid_initialised) {
xid = DHCP_GLOBAL_XID;
xid_initialised = !xid_initialised;
}
#endif
LWIP_ERROR("dhcp_create_msg: netif != NULL", (netif != NULL), return ERR_ARG;);
LWIP_ERROR("dhcp_create_msg: dhcp != NULL", (dhcp != NULL), return ERR_VAL;);
LWIP_ASSERT("dhcp_create_msg: dhcp->p_out == NULL", dhcp->p_out == NULL);
LWIP_ASSERT("dhcp_create_msg: dhcp->msg_out == NULL", dhcp->msg_out == NULL);
dhcp->p_out = pbuf_alloc(PBUF_TRANSPORT, sizeof(struct dhcp_msg), PBUF_RAM);
if (dhcp->p_out == NULL) {
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE | LWIP_DBG_LEVEL_SERIOUS,
("dhcp_create_msg(): could not allocate pbuf\n"));
return ERR_MEM;
}
LWIP_ASSERT("dhcp_create_msg: check that first pbuf can hold struct dhcp_msg",
(dhcp->p_out->len >= sizeof(struct dhcp_msg)));
/* DHCP_REQUEST should reuse 'xid' from DHCPOFFER */
if ((message_type != DHCP_REQUEST) || (dhcp->state == DHCP_STATE_REBOOTING)) {
/* reuse transaction identifier in retransmissions */
if (dhcp->tries == 0) {
#if DHCP_CREATE_RAND_XID && defined(LWIP_RAND)
xid = LWIP_RAND();
#else /* DHCP_CREATE_RAND_XID && defined(LWIP_RAND) */
xid++;
#endif /* DHCP_CREATE_RAND_XID && defined(LWIP_RAND) */
}
dhcp->xid = xid;
}
LWIP_DEBUGF(DHCP_DEBUG | LWIP_DBG_TRACE,
("transaction id xid(%"X32_F")\n", xid));
dhcp->msg_out = (struct dhcp_msg *)dhcp->p_out->payload;
dhcp->msg_out->op = DHCP_BOOTREQUEST;
/* @todo: make link layer independent */
dhcp->msg_out->htype = DHCP_HTYPE_ETH;
dhcp->msg_out->hlen = netif->hwaddr_len;
dhcp->msg_out->hops = 0;
dhcp->msg_out->xid = lwip_htonl(dhcp->xid);
dhcp->msg_out->secs = 0;
/* we don't need the broadcast flag since we can receive unicast traffic
before being fully configured! */
dhcp->msg_out->flags = 0;
ip4_addr_set_zero(&dhcp->msg_out->ciaddr);
/* set ciaddr to netif->ip_addr based on message_type and state */
if ((message_type == DHCP_INFORM) || (message_type == DHCP_DECLINE) || (message_type == DHCP_RELEASE) ||
((message_type == DHCP_REQUEST) && /* DHCP_STATE_BOUND not used for sending! */
((dhcp->state== DHCP_STATE_RENEWING) || dhcp->state== DHCP_STATE_REBINDING))) {
ip4_addr_copy(dhcp->msg_out->ciaddr, *netif_ip4_addr(netif));
}
ip4_addr_set_zero(&dhcp->msg_out->yiaddr);
ip4_addr_set_zero(&dhcp->msg_out->siaddr);
ip4_addr_set_zero(&dhcp->msg_out->giaddr);
for (i = 0; i < DHCP_CHADDR_LEN; i++) {
/* copy netif hardware address, pad with zeroes */
dhcp->msg_out->chaddr[i] = (i < netif->hwaddr_len && i < NETIF_MAX_HWADDR_LEN) ? netif->hwaddr[i] : 0/* pad byte*/;
}
for (i = 0; i < DHCP_SNAME_LEN; i++) {
dhcp->msg_out->sname[i] = 0;
}
for (i = 0; i < DHCP_FILE_LEN; i++) {
dhcp->msg_out->file[i] = 0;
}
dhcp->msg_out->cookie = PP_HTONL(DHCP_MAGIC_COOKIE);
dhcp->options_out_len = 0;
/* fill options field with an incrementing array (for debugging purposes) */
for (i = 0; i < DHCP_OPTIONS_LEN; i++) {
dhcp->msg_out->options[i] = (u8_t)i; /* for debugging only, no matter if truncated */
}
/* Add option MESSAGE_TYPE */
dhcp_option(dhcp, DHCP_OPTION_MESSAGE_TYPE, DHCP_OPTION_MESSAGE_TYPE_LEN);
dhcp_option_byte(dhcp, message_type);
return ERR_OK;
}
/**
* Free previously allocated memory used to send a DHCP request.
*
* @param dhcp the dhcp struct to free the request from
*/
static void
dhcp_delete_msg(struct dhcp *dhcp)
{
LWIP_ERROR("dhcp_delete_msg: dhcp != NULL", (dhcp != NULL), return;);
LWIP_ASSERT("dhcp_delete_msg: dhcp->p_out != NULL", dhcp->p_out != NULL);
LWIP_ASSERT("dhcp_delete_msg: dhcp->msg_out != NULL", dhcp->msg_out != NULL);
if (dhcp->p_out != NULL) {
pbuf_free(dhcp->p_out);
}
dhcp->p_out = NULL;
dhcp->msg_out = NULL;
}
/**
* Add a DHCP message trailer
*
* Adds the END option to the DHCP message, and if
* necessary, up to three padding bytes.
*
* @param dhcp DHCP state structure
*/
static void
dhcp_option_trailer(struct dhcp *dhcp)
{
LWIP_ERROR("dhcp_option_trailer: dhcp != NULL", (dhcp != NULL), return;);
LWIP_ASSERT("dhcp_option_trailer: dhcp->msg_out != NULL\n", dhcp->msg_out != NULL);
LWIP_ASSERT("dhcp_option_trailer: dhcp->options_out_len < DHCP_OPTIONS_LEN\n", dhcp->options_out_len < DHCP_OPTIONS_LEN);
dhcp->msg_out->options[dhcp->options_out_len++] = DHCP_OPTION_END;
/* packet is too small, or not 4 byte aligned? */
while (((dhcp->options_out_len < DHCP_MIN_OPTIONS_LEN) || (dhcp->options_out_len & 3)) &&
(dhcp->options_out_len < DHCP_OPTIONS_LEN)) {
/* add a fill/padding byte */
dhcp->msg_out->options[dhcp->options_out_len++] = 0;
}
}
/** check if DHCP supplied netif->ip_addr
*
* @param netif the netif to check
* @return 1 if DHCP supplied netif->ip_addr (states BOUND or RENEWING),
* 0 otherwise
*/
u8_t
dhcp_supplied_address(const struct netif *netif)
{
if ((netif != NULL) && (netif_dhcp_data(netif) != NULL)) {
struct dhcp* dhcp = netif_dhcp_data(netif);
return (dhcp->state == DHCP_STATE_BOUND) || (dhcp->state == DHCP_STATE_RENEWING) ||
(dhcp->state == DHCP_STATE_REBINDING);
}
return 0;
}
#endif /* LWIP_IPV4 && LWIP_DHCP */
#endif /* LIBOHIBOARD_ETHERNET_LWIP_2_0_3 */
|
the_stack_data/87910.c | /*
* @Description: 七夕快乐
* @version: 9.99
* @Author: Chandler Lu
* @Date: 2018-03-09 10:59:39
* @LastEditTime: 2019-08-07 23:48:36
*/
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
char data;
struct Node *lchild, *rchild;
} Node;
Node* init(char data) {
Node *node = (Node *)malloc(sizeof(Node));
node->data = data;
node->lchild = NULL;
node->rchild = NULL;
return node;
}
Node* build() {
Node *node = init('9');
node->lchild = init('0');
node->rchild = init('a');
node->rchild->lchild = init('M');
node->rchild->rchild = init('p');
node->rchild->rchild->lchild = init('g');
node->rchild->rchild->rchild = init('e');
node->rchild->rchild->rchild->lchild = init('i');
node->lchild->lchild = init('2');
node->lchild->lchild->lchild = init('a');
node->lchild->lchild->lchild->lchild = init('H');
node->lchild->lchild->lchild->rchild = init('p');
node->lchild->lchild->lchild->rchild->lchild = init('p');
node->lchild->lchild->lchild->rchild->rchild = init('y');
node->lchild->rchild = init('1');
return node;
}
void inorder(Node *node) {
if (node->lchild != NULL) {
inorder(node->lchild);
}
if (node->data == '2') {
printf(" ");
}
if (node->data == 'M') {
printf(" ");
}
printf("%c", node->data);
if (node->rchild != NULL) {
inorder(node->rchild);
}
}
void clear(Node *node) {
if (node->lchild != NULL) {
clear(node->lchild);
}
if (node->rchild != NULL) {
clear(node->rchild);
}
free(node);
}
int main() {
Node *root = build();
inorder(root);
printf("\n");
clear(root);
return 0;
} |
the_stack_data/28152.c | s(a,n)int*a;{n-->1?s(a,n),s(a+1,n),n=*a,*a=a[1],a[n>*a]=n:0;}
|
the_stack_data/173578709.c | #ifndef THC_GENERIC_FILE
#define THC_GENERIC_FILE "generic/CStorage.c"
#else
#include "THCHalf.h"
/* everything is as the generic Storage.c, except few things (see below) */
#ifndef THC_REAL_IS_HALF
#define THFile_readRealRaw(file, data, size) \
{ \
real *fdata = (real*)THAlloc(sizeof(real)*size); \
TH_CONCAT_3(THFile_read,Real,Raw)(file, fdata, size); \
THCudaCheck(hipMemcpy(data, fdata, size * sizeof(real), hipMemcpyHostToDevice)); \
THFree(fdata); \
}
#define THFile_writeRealRaw(file, data, size) \
{ \
real *fdata = (real*)THAlloc(sizeof(real)*size); \
THCudaCheck(hipMemcpy(fdata, data, size * sizeof(real), hipMemcpyDeviceToHost)); \
TH_CONCAT_3(THFile_write,Real,Raw)(file, fdata, size); \
THFree(fdata); \
}
#else
#define THFile_readRealRaw(file, data, size) \
{ \
real *fdata = (real*)THAlloc(sizeof(real)*size); \
THFile_readCharRaw(file, (char *)fdata, sizeof(real) * size); \
THCudaCheck(hipMemcpy(data, fdata, size * sizeof(real), hipMemcpyHostToDevice)); \
THFree(fdata); \
}
#define THFile_writeRealRaw(file, data, size) \
{ \
real *fdata = (real*)THAlloc(sizeof(real)*size); \
THCudaCheck(hipMemcpy(fdata, data, size * sizeof(real), hipMemcpyDeviceToHost)); \
THFile_writeCharRaw(file, (char *)fdata, size * sizeof(real)); \
THFree(fdata); \
}
#endif
#define TH_GENERIC_FILE "generic/Storage.c"
#include "generic/Storage.c"
#undef TH_GENERIC_FILE
#undef THFile_readRealRaw
#undef THFile_writeRealRaw
/* now we overwrite some methods specific to CudaStorage */
static int cutorch_Storage_(copy)(lua_State *L)
{
THCState *state = cutorch_getstate(L);
THCStorage *storage =(THCStorage *)luaT_checkudata(L, 1, torch_Storage);
void *src;
if( (src = luaT_toudata(L, 2, "torch.CudaByteStorage")) )
THCStorage_(copyCudaByte)(state, storage, (THCudaByteStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.CudaCharStorage")) )
THCStorage_(copyCudaChar)(state, storage, (THCudaCharStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.CudaShortStorage")) )
THCStorage_(copyCudaShort)(state, storage, (THCudaShortStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.CudaIntStorage")) )
THCStorage_(copyCudaInt)(state, storage, (THCudaIntStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.CudaLongStorage")) )
THCStorage_(copyCudaLong)(state, storage, (THCudaLongStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.CudaStorage")) )
THCStorage_(copyCudaFloat)(state, storage, (THCudaStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.CudaDoubleStorage")) )
THCStorage_(copyCudaDouble)(state, storage, (THCudaDoubleStorage *)src);
#ifdef CUDA_HALF_TENSOR
else if( (src = luaT_toudata(L, 2, "torch.CudaHalfStorage")) )
THCStorage_(copyCudaHalf)(state, storage, (THCudaHalfStorage *)src);
#endif
else if( (src = luaT_toudata(L, 2, "torch.ByteStorage")) )
THCStorage_(copyByte)(state, storage, (THByteStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.CharStorage")) )
THCStorage_(copyChar)(state, storage, (THCharStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.ShortStorage")) )
THCStorage_(copyShort)(state, storage, (THShortStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.IntStorage")) )
THCStorage_(copyInt)(state, storage, (THIntStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.LongStorage")) )
THCStorage_(copyLong)(state, storage, (THLongStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.FloatStorage")) )
THCStorage_(copyFloat)(state, storage, (THFloatStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.DoubleStorage")) )
THCStorage_(copyDouble)(state, storage, (THDoubleStorage *)src);
else
luaL_typerror(L, 2, "torch.*Storage");
lua_settop(L, 1);
return 1;
}
#ifndef THC_REAL_IS_HALF
static int TH_CONCAT_3(cutorch_,Real,Storage_copy)(lua_State *L)
{
THStorage *storage = (THStorage *)luaT_checkudata(L, 1, TH_CONCAT_STRING_3(torch.,Real,Storage));
void *src;
if( (src = luaT_toudata(L, 2, TH_CONCAT_STRING_3(torch.,Real,Storage) )))
THStorage_(copy)(storage, (THStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.ByteStorage")) )
THStorage_(copyByte)(storage, (THByteStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.CharStorage")) )
THStorage_(copyChar)(storage, (THCharStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.ShortStorage")) )
THStorage_(copyShort)(storage, (THShortStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.IntStorage")) )
THStorage_(copyInt)(storage, (THIntStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.LongStorage")) )
THStorage_(copyLong)(storage, (THLongStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.FloatStorage")) )
THStorage_(copyFloat)(storage, (THFloatStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.DoubleStorage")) )
THStorage_(copyDouble)(storage, (THDoubleStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.CudaStorage")) )
THStorage_(copyCudaFloat)(cutorch_getstate(L), storage, (THCudaStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.CudaLongStorage")) )
THStorage_(copyCudaLong)(cutorch_getstate(L), storage, (THCudaLongStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.CudaByteStorage")) )
THStorage_(copyCudaByte)(cutorch_getstate(L), storage, (THCudaByteStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.CudaCharStorage")) )
THStorage_(copyCudaChar)(cutorch_getstate(L), storage, (THCudaCharStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.CudaShortStorage")) )
THStorage_(copyCudaShort)(cutorch_getstate(L), storage, (THCudaShortStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.CudaIntStorage")) )
THStorage_(copyCudaInt)(cutorch_getstate(L), storage, (THCudaIntStorage *)src);
else if( (src = luaT_toudata(L, 2, "torch.CudaDoubleStorage")) )
THStorage_(copyCudaDouble)(cutorch_getstate(L), storage, (THCudaDoubleStorage *)src);
#ifdef CUDA_HALF_TENSOR
else if( (src = luaT_toudata(L, 2, "torch.CudaHalfStorage")) )
THStorage_(copyCudaHalf)(cutorch_getstate(L), storage, (THCudaHalfStorage *)src);
#endif
else
luaL_typerror(L, 2, "torch.*Storage");
lua_settop(L, 1);
return 1;
}
#endif
static int cutorch_Storage_(getDevice)(lua_State *L) {
THCStorage *storage = (THCStorage *)luaT_checkudata(L, 1, torch_Storage);
lua_pushinteger(L, THCStorage_(getDevice)(cutorch_getstate(L), storage) + 1);
return 1;
}
void cutorch_Storage_(init)(lua_State* L)
{
/* the standard stuff */
torch_Storage_(init)(L);
// torch_Storage macro is defined in Storage.c produce the CudaTensor types
// so I have to construct the normal torch types by hand
#ifndef THC_REAL_IS_HALF
luaT_pushmetatable(L, TH_CONCAT_STRING_3(torch.,Real,Storage));
lua_pushcfunction(L, TH_CONCAT_3(cutorch_,Real,Storage_copy));
lua_setfield(L, -2, "copy");
lua_pop(L, 1);
#endif
luaT_pushmetatable(L, torch_Storage);
lua_pushcfunction(L, cutorch_Storage_(copy));
lua_setfield(L, -2, "copy");
lua_pop(L, 1);
luaT_pushmetatable(L, torch_Storage);
lua_pushcfunction(L, cutorch_Storage_(getDevice));
lua_setfield(L, -2, "getDevice");
lua_pop(L, 1);
}
#endif
|
the_stack_data/41898.c | /* Check that parallel loops located inside a while foop are parallelized */
void while01(int n)
{
int i,j;
float x[100];
while(i<n) {
for(j=0;j<100;j++) {
x[j] = 0.;
}
i++;
}
}
|
the_stack_data/289382.c | #include <stdio.h>
int main(){
//Variáveis
int n1, n2, soma, mult;
//input
printf("Digite o primeiro numero: ");
scanf("%d", &n1);
printf("Digite o segundo numero: ");
scanf("%D", &n2);
//process
soma = (n1 + n2);
mult = (soma * n1);
//output
printf("O resultado e: %d",mult);
return 0;
} |
the_stack_data/173579481.c | // RUN: %check %s -Wshadow
int idx;
int f(void);
main()
{
int idx = 0; // CHECK: /warning: declaration of "idx" shadows global declaration/
int f = 2; // CHECK: /warning: declaration of "f" shadows global declaration/
}
|
the_stack_data/31388020.c | /* 1 */ #include <stdio.h>
/* 2 */ typedef struct {
/* 3 */ char data[4096];
/* 4 */ int key;
/* 5 */ } item;
/* 6 */
/* 7 */ item array[] = {
/* 8 */ {"bill", 3},
/* 9 */ {"neil", 4},
/* 10 */ {"john", 2},
/* 11 */ {"rick", 5},
/* 12 */ {"alex", 1},
/* 13 */ };
/* 14 */
/* 15 */ void sort(item *a, int n) {
/* 16 */
/* 17 */ int i = 0, j = 0;
/* 18 */ int s = 1;
/* 19 */
/* 20 */ for(; i < n & s != 0; i++) {
/* 21 */ s = 0;
/* 22 */ for(j = 0; j < n; j++) {
/* 23 */ if(a[j].key > a[j+1].key) {
/* 24 */ item t = a[j];
/* 25 */ a[j] = a[j+1];
/* 26 */ a[j+1] = t;
/* 27 */ s++;
/* 28 */ }
/* 29 */ }
/* 30 */ n--;
/* 31 */ }
/* 32 */ }
/* 33 */
/* 34 */ int main()
/* 35 */ {
/* 36 */ int i;
/* 37 */ sort(array,5);
/* 38 */ for(i = 0; i < 5; i++)
/* 39 */ printf("array[%d] = {%s, %d}\n",
/* 40 */ i, array[i].data, array[i].key);
/* 41 */ return 0;
/* 42 */ }
|
the_stack_data/90766275.c | /*
* linux/arch/arm/lib/io-shark.c
*
* by Alexander Schulz
*
* derived from:
* linux/arch/arm/lib/io-ebsa.S
* Copyright (C) 1995, 1996 Russell King
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation.
*/
|
the_stack_data/48576176.c | // general protection fault in __skb_flow_dissect
// https://syzkaller.appspot.com/bug?id=657634fd8edcf2bcedae1271b9e6307ce4a61ce8
// status:fixed
// autogenerated by syzkaller (http://github.com/google/syzkaller)
#define _GNU_SOURCE
#include <stdint.h>
#include <string.h>
#include <sys/syscall.h>
#include <unistd.h>
long r[18];
void loop()
{
memset(r, -1, sizeof(r));
r[0] = syscall(__NR_mmap, 0x20000000ul, 0x18000ul, 0x3ul, 0x32ul,
0xfffffffffffffffful, 0x0ul);
r[1] = syscall(__NR_socketpair, 0x1ul, 0x2000000000005ul, 0x0ul,
0x20008000ul);
if (r[1] != -1)
r[2] = *(uint32_t*)0x20008000;
if (r[1] != -1)
r[3] = *(uint32_t*)0x20008004;
*(uint16_t*)0x20015000 = (uint16_t)0x2;
*(uint64_t*)0x20015008 = (uint64_t)0x20014000;
*(uint16_t*)0x20014000 = (uint16_t)0x20;
*(uint8_t*)0x20014002 = (uint8_t)0x0;
*(uint8_t*)0x20014003 = (uint8_t)0x0;
*(uint32_t*)0x20014004 = (uint32_t)0xeffffffffffff034;
*(uint16_t*)0x20014008 = (uint16_t)0x6;
*(uint8_t*)0x2001400a = (uint8_t)0x0;
*(uint8_t*)0x2001400b = (uint8_t)0x0;
*(uint32_t*)0x2001400c = (uint32_t)0x0;
r[14] = syscall(__NR_setsockopt, r[2], 0x1ul, 0x1aul, 0x20015000ul,
0x10ul);
*(uint16_t*)0x20017ff6 = (uint16_t)0x0;
memcpy((void*)0x20017ff8, "\x2e\x2f\x66\x69\x6c\x65\x30\x00", 8);
r[17] = syscall(__NR_sendto, r[3], 0x2000cfdbul, 0x0ul, 0x0ul,
0x20017ff6ul, 0xaul);
}
int main()
{
loop();
return 0;
}
|
the_stack_data/184518357.c | /*
* Convert "cell arrange" address to normal address.
* (C) notaz, 2008
*
* This work is licensed under the terms of MAME license.
* See COPYING file in the top-level directory.
*/
// 64 x32 x16 x8 x4 x4
static unsigned int cell_map(int celln)
{
int col, row;
switch ((celln >> 12) & 7) { // 0-0x8000
case 0: // x32 cells
case 1:
case 2:
case 3:
col = celln >> 8;
row = celln & 0xff;
break;
case 4: // x16
case 5:
col = celln >> 7;
row = celln & 0x7f;
row |= 0x10000 >> 8;
break;
case 6: // x8
col = celln >> 6;
row = celln & 0x3f;
row |= 0x18000 >> 8;
break;
case 7: // x4
col = celln >> 5;
row = celln & 0x1f;
row |= (celln & 0x7800) >> 6;
break;
default: // never happens, only here to make compiler happy
col = row = 0;
break;
}
return (col & 0x3f) + row*64;
}
|
the_stack_data/510949.c | #include <stdio.h>
#include <stdlib.h>
int main()
{
char ch, file_name[25];
FILE *fp;
printf("Enter name of a file you wish to see\n");
gets(file_name);
fp = fopen(file_name, "r"); // read mode
if (fp == NULL)
{
perror("Error while opening the file.\n");
exit(EXIT_FAILURE);
}
printf("The contents of %s file are:\n", file_name);
while((ch = fgetc(fp)) != EOF)
printf("%c", ch);
fclose(fp);
return 0;
}
|
the_stack_data/97012353.c | /* Make the library identifiable with the RCS ident command. */
static char *termcap_version_string = "\n$Version: GNU termcap 1.3 $\n";
|
the_stack_data/10758.c | #include <stdio.h>
#include <stdlib.h>
int main(void){
int a = 1;
do{ // Do While serve para executar uma parte do código anterior e depois fazer a verifição do While.
printf("a = %d\n", a);
a++;
}
while(a <= 5);{
printf("a = %d\n", a);
a++;
}
system("pause");
return(0);
}
|
the_stack_data/1208459.c | #include <stdlib.h>
#include <unistd.h>
#include <stdio.h>
#include <string.h>
void func(int key)
{
char overflowme[32];
printf("overflow me: ");
gets(overflowme);
if (key == 0xcafebabe) {
printf("Flag: You're an expert! Keep it up!\n");
} else {
printf("Try looking from gdb!\n");
}
}
int main(int argc, char **argv)
{
printf("Welcome to the first challenge for Format Strings!\n");
printf("If you need any help for the exercise, try looking at the lecture video!\n");
func(0xdeadbeef);
return 0;
} |
the_stack_data/140765194.c | /* HAL raised several warnings, ignore them */
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-parameter"
#ifdef STM32F2xx
#include "stm32f2xx_hal_dcmi.c"
#elif STM32F4xx
#include "stm32f4xx_hal_dcmi.c"
#elif STM32F7xx
#include "stm32f7xx_hal_dcmi.c"
#elif STM32H7xx
#include "stm32h7xx_hal_dcmi.c"
#elif STM32L4xx
#include "stm32l4xx_hal_dcmi.c"
#elif STM32MP1xx
#include "stm32mp1xx_hal_dcmi.c"
#elif STM32U5xx
#include "stm32u5xx_hal_dcmi.c"
#endif
#pragma GCC diagnostic pop
|
the_stack_data/250346.c | /* Functional tests for the function hotpatching feature. */
/* { dg-do compile } */
/* { dg-options "-O3 -mzarch" } */
int a;
__attribute__((hotpatch(a,0)))
int main (void)
{ /* { dg-error "attribute is not a comma separated pair of non-negative integer constants or too large" } */
return 0;
}
|
the_stack_data/72011987.c | #include <math.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <complex.h>
#ifdef complex
#undef complex
#endif
#ifdef I
#undef I
#endif
#if defined(_WIN64)
typedef long long BLASLONG;
typedef unsigned long long BLASULONG;
#else
typedef long BLASLONG;
typedef unsigned long BLASULONG;
#endif
#ifdef LAPACK_ILP64
typedef BLASLONG blasint;
#if defined(_WIN64)
#define blasabs(x) llabs(x)
#else
#define blasabs(x) labs(x)
#endif
#else
typedef int blasint;
#define blasabs(x) abs(x)
#endif
typedef blasint integer;
typedef unsigned int uinteger;
typedef char *address;
typedef short int shortint;
typedef float real;
typedef double doublereal;
typedef struct { real r, i; } complex;
typedef struct { doublereal r, i; } doublecomplex;
#ifdef _MSC_VER
static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
#else
static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
#endif
#define pCf(z) (*_pCf(z))
#define pCd(z) (*_pCd(z))
typedef int logical;
typedef short int shortlogical;
typedef char logical1;
typedef char integer1;
#define TRUE_ (1)
#define FALSE_ (0)
/* Extern is for use with -E */
#ifndef Extern
#define Extern extern
#endif
/* I/O stuff */
typedef int flag;
typedef int ftnlen;
typedef int ftnint;
/*external read, write*/
typedef struct
{ flag cierr;
ftnint ciunit;
flag ciend;
char *cifmt;
ftnint cirec;
} cilist;
/*internal read, write*/
typedef struct
{ flag icierr;
char *iciunit;
flag iciend;
char *icifmt;
ftnint icirlen;
ftnint icirnum;
} icilist;
/*open*/
typedef struct
{ flag oerr;
ftnint ounit;
char *ofnm;
ftnlen ofnmlen;
char *osta;
char *oacc;
char *ofm;
ftnint orl;
char *oblnk;
} olist;
/*close*/
typedef struct
{ flag cerr;
ftnint cunit;
char *csta;
} cllist;
/*rewind, backspace, endfile*/
typedef struct
{ flag aerr;
ftnint aunit;
} alist;
/* inquire */
typedef struct
{ flag inerr;
ftnint inunit;
char *infile;
ftnlen infilen;
ftnint *inex; /*parameters in standard's order*/
ftnint *inopen;
ftnint *innum;
ftnint *innamed;
char *inname;
ftnlen innamlen;
char *inacc;
ftnlen inacclen;
char *inseq;
ftnlen inseqlen;
char *indir;
ftnlen indirlen;
char *infmt;
ftnlen infmtlen;
char *inform;
ftnint informlen;
char *inunf;
ftnlen inunflen;
ftnint *inrecl;
ftnint *innrec;
char *inblank;
ftnlen inblanklen;
} inlist;
#define VOID void
union Multitype { /* for multiple entry points */
integer1 g;
shortint h;
integer i;
/* longint j; */
real r;
doublereal d;
complex c;
doublecomplex z;
};
typedef union Multitype Multitype;
struct Vardesc { /* for Namelist */
char *name;
char *addr;
ftnlen *dims;
int type;
};
typedef struct Vardesc Vardesc;
struct Namelist {
char *name;
Vardesc **vars;
int nvars;
};
typedef struct Namelist Namelist;
#define abs(x) ((x) >= 0 ? (x) : -(x))
#define dabs(x) (fabs(x))
#define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
#define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
#define dmin(a,b) (f2cmin(a,b))
#define dmax(a,b) (f2cmax(a,b))
#define bit_test(a,b) ((a) >> (b) & 1)
#define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
#define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
#define abort_() { sig_die("Fortran abort routine called", 1); }
#define c_abs(z) (cabsf(Cf(z)))
#define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
#ifdef _MSC_VER
#define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}
#define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/df(b)._Val[1]);}
#else
#define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
#define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
#endif
#define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
#define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
#define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
//#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
#define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
#define d_abs(x) (fabs(*(x)))
#define d_acos(x) (acos(*(x)))
#define d_asin(x) (asin(*(x)))
#define d_atan(x) (atan(*(x)))
#define d_atn2(x, y) (atan2(*(x),*(y)))
#define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
#define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
#define d_cos(x) (cos(*(x)))
#define d_cosh(x) (cosh(*(x)))
#define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
#define d_exp(x) (exp(*(x)))
#define d_imag(z) (cimag(Cd(z)))
#define r_imag(z) (cimagf(Cf(z)))
#define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define d_log(x) (log(*(x)))
#define d_mod(x, y) (fmod(*(x), *(y)))
#define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
#define d_nint(x) u_nint(*(x))
#define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
#define d_sign(a,b) u_sign(*(a),*(b))
#define r_sign(a,b) u_sign(*(a),*(b))
#define d_sin(x) (sin(*(x)))
#define d_sinh(x) (sinh(*(x)))
#define d_sqrt(x) (sqrt(*(x)))
#define d_tan(x) (tan(*(x)))
#define d_tanh(x) (tanh(*(x)))
#define i_abs(x) abs(*(x))
#define i_dnnt(x) ((integer)u_nint(*(x)))
#define i_len(s, n) (n)
#define i_nint(x) ((integer)u_nint(*(x)))
#define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
#define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
#define pow_si(B,E) spow_ui(*(B),*(E))
#define pow_ri(B,E) spow_ui(*(B),*(E))
#define pow_di(B,E) dpow_ui(*(B),*(E))
#define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
#define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
#define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
#define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
#define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
#define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
#define sig_die(s, kill) { exit(1); }
#define s_stop(s, n) {exit(0);}
static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
#define z_abs(z) (cabs(Cd(z)))
#define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
#define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
#define myexit_() break;
#define mycycle() continue;
#define myceiling(w) {ceil(w)}
#define myhuge(w) {HUGE_VAL}
//#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
#define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
/* procedure parameter types for -A and -C++ */
#define F2C_proc_par_types 1
#ifdef __cplusplus
typedef logical (*L_fp)(...);
#else
typedef logical (*L_fp)();
#endif
static float spow_ui(float x, integer n) {
float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static double dpow_ui(double x, integer n) {
double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#ifdef _MSC_VER
static _Fcomplex cpow_ui(complex x, integer n) {
complex pow={1.0,0.0}; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
for(u = n; ; ) {
if(u & 01) pow.r *= x.r, pow.i *= x.i;
if(u >>= 1) x.r *= x.r, x.i *= x.i;
else break;
}
}
_Fcomplex p={pow.r, pow.i};
return p;
}
#else
static _Complex float cpow_ui(_Complex float x, integer n) {
_Complex float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#endif
#ifdef _MSC_VER
static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
_Dcomplex pow={1.0,0.0}; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
for(u = n; ; ) {
if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
else break;
}
}
_Dcomplex p = {pow._Val[0], pow._Val[1]};
return p;
}
#else
static _Complex double zpow_ui(_Complex double x, integer n) {
_Complex double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#endif
static integer pow_ii(integer x, integer n) {
integer pow; unsigned long int u;
if (n <= 0) {
if (n == 0 || x == 1) pow = 1;
else if (x != -1) pow = x == 0 ? 1/x : 0;
else n = -n;
}
if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
u = n;
for(pow = 1; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static integer dmaxloc_(double *w, integer s, integer e, integer *n)
{
double m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static integer smaxloc_(float *w, integer s, integer e, integer *n)
{
float m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Fcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
}
}
pCf(z) = zdotc;
}
#else
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
#endif
static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Dcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
}
}
pCd(z) = zdotc;
}
#else
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Fcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
}
}
pCf(z) = zdotc;
}
#else
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i]) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
#endif
static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Dcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
}
}
pCd(z) = zdotc;
}
#else
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i]) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
/* -- translated by f2c (version 20000121).
You must link the resulting object file with the libraries:
-lf2c -lm (in that order)
*/
/* Table of constant values */
static integer c__1 = 1;
static integer c_n1 = -1;
static integer c__3 = 3;
static integer c__2 = 2;
/* > \brief \b CUNGLQ */
/* =========== DOCUMENTATION =========== */
/* Online html documentation available at */
/* http://www.netlib.org/lapack/explore-html/ */
/* > \htmlonly */
/* > Download CUNGLQ + dependencies */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cunglq.
f"> */
/* > [TGZ]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cunglq.
f"> */
/* > [ZIP]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cunglq.
f"> */
/* > [TXT]</a> */
/* > \endhtmlonly */
/* Definition: */
/* =========== */
/* SUBROUTINE CUNGLQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) */
/* INTEGER INFO, K, LDA, LWORK, M, N */
/* COMPLEX A( LDA, * ), TAU( * ), WORK( * ) */
/* > \par Purpose: */
/* ============= */
/* > */
/* > \verbatim */
/* > */
/* > CUNGLQ generates an M-by-N complex matrix Q with orthonormal rows, */
/* > which is defined as the first M rows of a product of K elementary */
/* > reflectors of order N */
/* > */
/* > Q = H(k)**H . . . H(2)**H H(1)**H */
/* > */
/* > as returned by CGELQF. */
/* > \endverbatim */
/* Arguments: */
/* ========== */
/* > \param[in] M */
/* > \verbatim */
/* > M is INTEGER */
/* > The number of rows of the matrix Q. M >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in] N */
/* > \verbatim */
/* > N is INTEGER */
/* > The number of columns of the matrix Q. N >= M. */
/* > \endverbatim */
/* > */
/* > \param[in] K */
/* > \verbatim */
/* > K is INTEGER */
/* > The number of elementary reflectors whose product defines the */
/* > matrix Q. M >= K >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in,out] A */
/* > \verbatim */
/* > A is COMPLEX array, dimension (LDA,N) */
/* > On entry, the i-th row must contain the vector which defines */
/* > the elementary reflector H(i), for i = 1,2,...,k, as returned */
/* > by CGELQF in the first k rows of its array argument A. */
/* > On exit, the M-by-N matrix Q. */
/* > \endverbatim */
/* > */
/* > \param[in] LDA */
/* > \verbatim */
/* > LDA is INTEGER */
/* > The first dimension of the array A. LDA >= f2cmax(1,M). */
/* > \endverbatim */
/* > */
/* > \param[in] TAU */
/* > \verbatim */
/* > TAU is COMPLEX array, dimension (K) */
/* > TAU(i) must contain the scalar factor of the elementary */
/* > reflector H(i), as returned by CGELQF. */
/* > \endverbatim */
/* > */
/* > \param[out] WORK */
/* > \verbatim */
/* > WORK is COMPLEX array, dimension (MAX(1,LWORK)) */
/* > On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
/* > \endverbatim */
/* > */
/* > \param[in] LWORK */
/* > \verbatim */
/* > LWORK is INTEGER */
/* > The dimension of the array WORK. LWORK >= f2cmax(1,M). */
/* > For optimum performance LWORK >= M*NB, where NB is */
/* > the optimal blocksize. */
/* > */
/* > If LWORK = -1, then a workspace query is assumed; the routine */
/* > only calculates the optimal size of the WORK array, returns */
/* > this value as the first entry of the WORK array, and no error */
/* > message related to LWORK is issued by XERBLA. */
/* > \endverbatim */
/* > */
/* > \param[out] INFO */
/* > \verbatim */
/* > INFO is INTEGER */
/* > = 0: successful exit; */
/* > < 0: if INFO = -i, the i-th argument has an illegal value */
/* > \endverbatim */
/* Authors: */
/* ======== */
/* > \author Univ. of Tennessee */
/* > \author Univ. of California Berkeley */
/* > \author Univ. of Colorado Denver */
/* > \author NAG Ltd. */
/* > \date December 2016 */
/* > \ingroup complexOTHERcomputational */
/* ===================================================================== */
/* Subroutine */ int cunglq_(integer *m, integer *n, integer *k, complex *a,
integer *lda, complex *tau, complex *work, integer *lwork, integer *
info)
{
/* System generated locals */
integer a_dim1, a_offset, i__1, i__2, i__3, i__4;
/* Local variables */
integer i__, j, l, nbmin, iinfo;
extern /* Subroutine */ int cungl2_(integer *, integer *, integer *,
complex *, integer *, complex *, complex *, integer *);
integer ib, nb, ki, kk;
extern /* Subroutine */ int clarfb_(char *, char *, char *, char *,
integer *, integer *, integer *, complex *, integer *, complex *,
integer *, complex *, integer *, complex *, integer *);
integer nx;
extern /* Subroutine */ int clarft_(char *, char *, integer *, integer *,
complex *, integer *, complex *, complex *, integer *), xerbla_(char *, integer *, ftnlen);
extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
integer *, integer *, ftnlen, ftnlen);
integer ldwork, lwkopt;
logical lquery;
integer iws;
/* -- LAPACK computational routine (version 3.7.0) -- */
/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
/* December 2016 */
/* ===================================================================== */
/* Test the input arguments */
/* Parameter adjustments */
a_dim1 = *lda;
a_offset = 1 + a_dim1 * 1;
a -= a_offset;
--tau;
--work;
/* Function Body */
*info = 0;
nb = ilaenv_(&c__1, "CUNGLQ", " ", m, n, k, &c_n1, (ftnlen)6, (ftnlen)1);
lwkopt = f2cmax(1,*m) * nb;
work[1].r = (real) lwkopt, work[1].i = 0.f;
lquery = *lwork == -1;
if (*m < 0) {
*info = -1;
} else if (*n < *m) {
*info = -2;
} else if (*k < 0 || *k > *m) {
*info = -3;
} else if (*lda < f2cmax(1,*m)) {
*info = -5;
} else if (*lwork < f2cmax(1,*m) && ! lquery) {
*info = -8;
}
if (*info != 0) {
i__1 = -(*info);
xerbla_("CUNGLQ", &i__1, (ftnlen)6);
return 0;
} else if (lquery) {
return 0;
}
/* Quick return if possible */
if (*m <= 0) {
work[1].r = 1.f, work[1].i = 0.f;
return 0;
}
nbmin = 2;
nx = 0;
iws = *m;
if (nb > 1 && nb < *k) {
/* Determine when to cross over from blocked to unblocked code. */
/* Computing MAX */
i__1 = 0, i__2 = ilaenv_(&c__3, "CUNGLQ", " ", m, n, k, &c_n1, (
ftnlen)6, (ftnlen)1);
nx = f2cmax(i__1,i__2);
if (nx < *k) {
/* Determine if workspace is large enough for blocked code. */
ldwork = *m;
iws = ldwork * nb;
if (*lwork < iws) {
/* Not enough workspace to use optimal NB: reduce NB and */
/* determine the minimum value of NB. */
nb = *lwork / ldwork;
/* Computing MAX */
i__1 = 2, i__2 = ilaenv_(&c__2, "CUNGLQ", " ", m, n, k, &c_n1,
(ftnlen)6, (ftnlen)1);
nbmin = f2cmax(i__1,i__2);
}
}
}
if (nb >= nbmin && nb < *k && nx < *k) {
/* Use blocked code after the last block. */
/* The first kk rows are handled by the block method. */
ki = (*k - nx - 1) / nb * nb;
/* Computing MIN */
i__1 = *k, i__2 = ki + nb;
kk = f2cmin(i__1,i__2);
/* Set A(kk+1:m,1:kk) to zero. */
i__1 = kk;
for (j = 1; j <= i__1; ++j) {
i__2 = *m;
for (i__ = kk + 1; i__ <= i__2; ++i__) {
i__3 = i__ + j * a_dim1;
a[i__3].r = 0.f, a[i__3].i = 0.f;
/* L10: */
}
/* L20: */
}
} else {
kk = 0;
}
/* Use unblocked code for the last or only block. */
if (kk < *m) {
i__1 = *m - kk;
i__2 = *n - kk;
i__3 = *k - kk;
cungl2_(&i__1, &i__2, &i__3, &a[kk + 1 + (kk + 1) * a_dim1], lda, &
tau[kk + 1], &work[1], &iinfo);
}
if (kk > 0) {
/* Use blocked code */
i__1 = -nb;
for (i__ = ki + 1; i__1 < 0 ? i__ >= 1 : i__ <= 1; i__ += i__1) {
/* Computing MIN */
i__2 = nb, i__3 = *k - i__ + 1;
ib = f2cmin(i__2,i__3);
if (i__ + ib <= *m) {
/* Form the triangular factor of the block reflector */
/* H = H(i) H(i+1) . . . H(i+ib-1) */
i__2 = *n - i__ + 1;
clarft_("Forward", "Rowwise", &i__2, &ib, &a[i__ + i__ *
a_dim1], lda, &tau[i__], &work[1], &ldwork);
/* Apply H**H to A(i+ib:m,i:n) from the right */
i__2 = *m - i__ - ib + 1;
i__3 = *n - i__ + 1;
clarfb_("Right", "Conjugate transpose", "Forward", "Rowwise",
&i__2, &i__3, &ib, &a[i__ + i__ * a_dim1], lda, &work[
1], &ldwork, &a[i__ + ib + i__ * a_dim1], lda, &work[
ib + 1], &ldwork);
}
/* Apply H**H to columns i:n of current block */
i__2 = *n - i__ + 1;
cungl2_(&ib, &i__2, &ib, &a[i__ + i__ * a_dim1], lda, &tau[i__], &
work[1], &iinfo);
/* Set columns 1:i-1 of current block to zero */
i__2 = i__ - 1;
for (j = 1; j <= i__2; ++j) {
i__3 = i__ + ib - 1;
for (l = i__; l <= i__3; ++l) {
i__4 = l + j * a_dim1;
a[i__4].r = 0.f, a[i__4].i = 0.f;
/* L30: */
}
/* L40: */
}
/* L50: */
}
}
work[1].r = (real) iws, work[1].i = 0.f;
return 0;
/* End of CUNGLQ */
} /* cunglq_ */
|
the_stack_data/36396.c | /*
* Copyright 2013 NVIDIA Corporation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <math.h>
#include <string.h>
#include <openacc.h>
#include <stdio.h>
#define NN 1024
#define NM 1024
double A[NN][NM];
double Anew[NN][NM];
/* Assume we are on x86_64 */
static __inline__ unsigned long long rdtsc(void){
#ifdef __x86_64
unsigned hi, lo;
__asm__ __volatile__ ("rdtsc" : "=a"(lo), "=d"(hi));
return ( (unsigned long long)lo)|( ((unsigned long long)hi)<<32 );
#else
#if __powerpc64__
return __builtin_readcyclecounter();
#endif // __powerpc64__
#endif
}
int main(int argc, char** argv)
{
const int n = NN;
const int m = NM;
const int iter_max = 1000;
const double tol = 1.0e-6;
double error = 1.0;
memset(A, 0, n * m * sizeof(double));
memset(Anew, 0, n * m * sizeof(double));
for (int j = 0; j < n; j++)
{
A[j][0] = 1.0;
Anew[j][0] = 1.0;
}
printf("Jacobi relaxation Calculation: %d x %d mesh\n", n, m);
double t_start = rdtsc();
int iter = 0;
#pragma acc data copyin(Anew), copy(A)
while ( error > tol && iter < iter_max )
{
error = 0.0;
#pragma acc data copyout( error )
#pragma acc parallel loop
for( int j = 1; j < n-1; j++)
{
for( int i = 1; i < m-1; i++ )
{
Anew[j][i] = 0.25 * ( A[j][i+1] + A[j][i-1]
+ A[j-1][i] + A[j+1][i]);
error = fmax( error, fabs(Anew[j][i] - A[j][i]));
}
}
#pragma acc parallel loop
for( int j = 1; j < n-1; j++)
{
for( int i = 1; i < m-1; i++ )
{
A[j][i] = Anew[j][i];
}
}
if(iter % 100 == 0) printf("%5d, %0.6f\n", iter, error);
iter++;
}
double t_end = rdtsc();
double runtime = t_end - t_start;
printf(" total: %f s\n", runtime / 1000);
}
|
the_stack_data/119161.c | #include<stdio.h>
int main()
{
int i,sum=0,a[100],n;
printf("enter n");
scanf("%d",&n);
for(i=0;i<n;i++)
{
a[i]=i*i*i;
}
for(i=0;i<n;i++)
{
printf("the array is %d\n",a[i]);
}
}
|
the_stack_data/182952019.c | /* $Id: _alloca.c,v 1.4 2009/03/15 00:20:41 gmcgarry Exp $ */
/*
* This explanation of _alloca() comes from Chris Giese, posted to
* alt.os.dev:
*
* By default, Windows reserves 1 meg of virtual memory for the stack.
* No page of stack memory is actually allocated (commited) until the
* page is accessed. This is demand-allocation. The page beyond the
* top of the stack is the guard page. If this page is accessed,
* memory will be allocated for it, and the guard page moved downward
* by 4K (one page). Thus, the stack can grow beyond the initial 1 meg.
* Windows will not, however, let you grow the stack by accessing
* discontiguous pages of memory. Going beyond the guard page causes
* an exception. Stack-probing code prevents this.
*/
#ifndef __MSC__
asm( " .text\n"
" .globl __alloca\n"
"__alloca:\n"
#ifdef __i386__
" pop %edx\n"
" pop %eax\n"
" add $3,%eax\n"
" and $-4,%eax\n"
"1: cmp $4096,%eax\n"
" jge 2f\n"
" sub %eax,%esp\n"
" test %eax,(%esp)\n"
" mov %esp,%eax\n"
" push %edx\n"
" push %edx\n"
" ret\n"
"2: sub $4096,%esp\n"
" sub $4096,%eax\n"
" test %eax,(%esp)\n"
" jmp 1b\n"
#endif
);
#endif
|
the_stack_data/198581262.c | // Lines set generated by tiler.
// m_width = 120
// m_height = 10
// m_cellSizeX = 32
// m_cellSizeY = 32
// m_borderWidth = 0
// m_dir0_max = 5
// m_dir1_max = 5
// m_dir2_max = 5
// m_c_max = 50
// m_dir0_weight = 1
// m_dir1_weight = 0
// m_dir2_weight = 1
// m_c_weight = 0
// m_grid = 0
// m_cutOffsetX = 110
// m_cutOffsetY = 0
// m_invertScreensOrder = 1
// m_randomSeed = 0
// m_useRandomSeed = 1
short screenlines_lvl70[] = {
89,
98, 96, 66, 96,
66, 96, 82, 128,
162, 96, 130, 96,
130, 96, 146, 128,
338, 64, 306, 64,
306, 64, 322, 96,
34, 96, 2, 96,
2, 96, -14, 128,
66, 96, 34, 96,
2, 32, -30, 32,
34, 32, 2, 32,
50, 128, 18, 128,
18, 128, 34, 160,
82, 128, 50, 128,
18, 0, -14, 0,
-14, 0, 2, 32,
50, 0, 18, 0,
178, 0, 146, 0,
146, 0, 130, 32,
322, 32, 290, 32,
290, 32, 274, 64,
194, 96, 162, 96,
162, 96, 146, 128,
82, 0, 50, 0,
50, 0, 66, 32,
146, 0, 82, 0,
338, 0, 306, 0,
306, 0, 290, 32,
274, 128, 242, 128,
242, 128, 258, 160,
130, 32, 98, 32,
98, 32, 114, 64,
162, 32, 130, 32,
338, 128, 306, 128,
306, 128, 322, 160,
242, 0, 210, 0,
210, 0, 226, 32,
274, 0, 242, 0,
50, 64, 18, 64,
18, 64, 34, 96,
82, 64, 50, 64,
210, 128, 178, 128,
178, 128, 194, 160,
242, 128, 210, 128,
178, 64, 146, 64,
146, 64, 162, 96,
210, 64, 178, 64,
226, 32, 194, 32,
194, 32, 210, 64,
258, 32, 226, 32,
226, 96, 194, 96,
194, 96, 210, 128,
258, 96, 226, 96,
146, 128, 114, 128,
114, 128, 130, 160,
178, 128, 146, 128,
2, 96, -30, 96,
146, 64, 114, 64,
114, 64, 130, 96,
242, 64, 210, 64,
210, 64, 194, 96,
274, 64, 242, 64,
306, 0, 274, 0,
274, 0, 258, 32,
114, 64, 82, 64,
82, 64, 98, 96,
66, 32, 34, 32,
34, 32, 18, 64,
98, 32, 66, 32,
18, 128, -14, 128,
130, 96, 98, 96,
98, 96, 82, 128,
322, 96, 290, 96,
290, 96, 274, 128,
290, 96, 258, 96,
258, 96, 242, 128,
306, 128, 274, 128,
274, 128, 290, 160,
210, 0, 178, 0,
178, 0, 194, 32,
18, 64, -14, 64,
194, 32, 162, 32,
162, 32, 146, 64,
306, 64, 274, 64,
274, 64, 258, 96,
290, 32, 258, 32,
258, 32, 242, 64,
114, 128, 82, 128,
82, 128, 66, 160
};
short screenlines_lvl71[] = {
90,
162, 32, 130, 32,
130, 32, 146, 64,
242, 64, 210, 64,
210, 64, 226, 96,
178, 64, 162, 96,
130, 96, 98, 96,
98, 96, 114, 128,
210, 128, 178, 128,
178, 128, 194, 160,
146, 0, 114, 0,
114, 0, 130, 32,
322, 96, 306, 128,
322, 32, 290, 32,
290, 32, 306, 64,
338, 0, 306, 0,
306, 0, 322, 32,
66, 96, 34, 96,
34, 96, 18, 128,
98, 96, 66, 96,
146, 128, 114, 128,
114, 128, 98, 160,
178, 128, 146, 128,
2, 96, -30, 96,
34, 96, 2, 96,
194, 32, 162, 32,
162, 32, 146, 64,
226, 32, 194, 32,
274, 64, 242, 64,
242, 64, 226, 96,
242, 128, 210, 128,
210, 128, 194, 160,
274, 128, 242, 128,
82, 128, 50, 128,
50, 128, 34, 160,
114, 128, 82, 128,
210, 64, 178, 64,
178, 64, 194, 96,
50, 0, 18, 0,
18, 0, 34, 32,
18, 64, -14, 64,
-14, 64, 2, 96,
50, 64, 18, 64,
258, 96, 226, 96,
226, 96, 210, 128,
66, 32, 34, 32,
34, 32, 50, 64,
98, 32, 66, 32,
2, 32, -30, 32,
34, 32, 2, 32,
18, 0, -14, 0,
290, 32, 258, 32,
258, 32, 242, 64,
178, 0, 146, 0,
146, 0, 162, 32,
210, 0, 178, 0,
162, 96, 130, 96,
130, 96, 114, 128,
242, 0, 210, 0,
210, 0, 194, 32,
274, 0, 242, 0,
290, 96, 258, 96,
258, 96, 274, 128,
322, 96, 290, 96,
82, 0, 50, 0,
50, 0, 66, 32,
114, 0, 82, 0,
306, 128, 274, 128,
274, 128, 290, 160,
338, 128, 306, 128,
306, 0, 274, 0,
274, 0, 258, 32,
82, 64, 50, 64,
50, 64, 66, 96,
114, 64, 82, 64,
82, 64, 98, 96,
146, 64, 114, 64,
114, 64, 130, 96,
178, 64, 146, 64,
18, 128, -14, 128,
50, 128, 18, 128,
194, 96, 162, 96,
162, 96, 178, 128,
226, 96, 194, 96,
130, 32, 98, 32,
98, 32, 82, 64,
306, 64, 274, 64,
274, 64, 290, 96,
338, 64, 306, 64,
258, 32, 226, 32,
226, 32, 210, 64
};
short screenlines_lvl72[] = {
89,
82, 0, 50, 0,
50, 0, 66, 32,
18, 128, -14, 128,
-14, 128, 2, 160,
50, 128, 18, 128,
242, 128, 210, 128,
210, 128, 226, 160,
306, 128, 242, 128,
306, 64, 274, 64,
274, 64, 258, 96,
242, 0, 210, 0,
210, 0, 194, 32,
114, 128, 82, 128,
82, 128, 66, 160,
322, 96, 290, 96,
290, 96, 274, 128,
98, 96, 66, 96,
66, 96, 50, 128,
114, 0, 82, 0,
82, 0, 66, 32,
146, 0, 114, 0,
34, 96, 2, 96,
2, 96, 18, 128,
66, 96, 34, 96,
146, 128, 114, 128,
114, 128, 130, 160,
178, 128, 146, 128,
338, 64, 306, 64,
306, 64, 322, 96,
194, 32, 162, 32,
162, 32, 146, 64,
226, 32, 194, 32,
258, 32, 226, 32,
226, 32, 242, 64,
290, 32, 258, 32,
82, 64, 50, 64,
50, 64, 34, 96,
114, 64, 82, 64,
322, 32, 290, 32,
290, 32, 306, 64,
306, 0, 274, 0,
274, 0, 290, 32,
338, 0, 306, 0,
146, 64, 114, 64,
114, 64, 98, 96,
34, 32, 2, 32,
2, 32, 18, 64,
66, 32, 34, 32,
82, 128, 50, 128,
50, 128, 34, 160,
194, 96, 162, 96,
162, 96, 178, 128,
226, 96, 194, 96,
258, 96, 226, 96,
226, 96, 210, 128,
18, 0, -14, 0,
2, 32, -30, 32,
18, 64, -14, 64,
-14, 64, 2, 96,
50, 64, 18, 64,
242, 64, 210, 64,
210, 64, 226, 96,
274, 64, 242, 64,
338, 128, 306, 128,
306, 128, 290, 160,
210, 64, 178, 64,
178, 64, 162, 96,
178, 0, 146, 0,
146, 0, 162, 32,
210, 0, 178, 0,
98, 32, 66, 32,
66, 32, 50, 64,
130, 96, 98, 96,
98, 96, 114, 128,
162, 96, 130, 96,
50, 0, 18, 0,
18, 0, 34, 32,
178, 64, 146, 64,
146, 64, 130, 96,
130, 32, 98, 32,
98, 32, 114, 64,
162, 32, 130, 32,
210, 128, 178, 128,
178, 128, 194, 160,
2, 96, -30, 96,
274, 0, 242, 0,
242, 0, 258, 32,
290, 96, 258, 96,
258, 96, 242, 128
};
short screenlines_lvl73[] = {
91,
162, 32, 146, 64,
226, 96, 194, 96,
194, 96, 210, 128,
338, 128, 306, 128,
306, 128, 322, 160,
306, 64, 274, 64,
274, 64, 258, 96,
274, 0, 242, 0,
242, 0, 258, 32,
306, 0, 274, 0,
194, 32, 162, 32,
162, 32, 178, 64,
226, 32, 194, 32,
18, 0, -14, 0,
50, 0, 18, 0,
2, 32, -30, 32,
34, 32, 2, 32,
242, 128, 210, 128,
210, 128, 194, 160,
274, 128, 242, 128,
178, 128, 146, 128,
146, 128, 162, 160,
210, 128, 178, 128,
34, 96, 2, 96,
2, 96, 18, 128,
258, 96, 226, 96,
226, 96, 242, 128,
82, 64, 50, 64,
50, 64, 34, 96,
338, 0, 306, 0,
306, 0, 290, 32,
162, 96, 130, 96,
130, 96, 114, 128,
290, 32, 258, 32,
258, 32, 274, 64,
322, 32, 290, 32,
130, 32, 98, 32,
98, 32, 82, 64,
162, 32, 130, 32,
66, 32, 34, 32,
34, 32, 50, 64,
98, 32, 66, 32,
338, 64, 306, 64,
306, 64, 322, 96,
2, 96, -30, 96,
306, 128, 274, 128,
274, 128, 258, 160,
18, 128, -14, 128,
-14, 128, 2, 160,
50, 128, 18, 128,
242, 0, 210, 0,
210, 0, 194, 32,
146, 0, 114, 0,
114, 0, 98, 32,
258, 32, 226, 32,
226, 32, 210, 64,
82, 0, 50, 0,
50, 0, 66, 32,
114, 0, 82, 0,
178, 0, 146, 0,
146, 0, 162, 32,
210, 0, 178, 0,
114, 128, 82, 128,
82, 128, 98, 160,
98, 96, 66, 96,
66, 96, 82, 128,
130, 96, 98, 96,
242, 64, 210, 64,
210, 64, 226, 96,
274, 64, 242, 64,
82, 128, 50, 128,
50, 128, 34, 160,
146, 64, 114, 64,
114, 64, 130, 96,
290, 96, 258, 96,
258, 96, 274, 128,
178, 64, 146, 64,
146, 64, 162, 96,
210, 64, 178, 64,
18, 64, -14, 64,
50, 64, 18, 64,
114, 64, 82, 64,
82, 64, 98, 96,
322, 96, 290, 96,
290, 96, 306, 128,
66, 96, 34, 96,
34, 96, 50, 128,
194, 96, 162, 96,
162, 96, 178, 128,
146, 128, 114, 128,
114, 128, 130, 160
};
short screenlines_lvl74[] = {
90,
114, 64, 98, 96,
178, 128, 146, 128,
146, 128, 162, 160,
18, 128, 2, 160,
274, 64, 242, 64,
242, 64, 258, 96,
306, 64, 274, 64,
162, 32, 130, 32,
130, 32, 114, 64,
18, 0, -14, 0,
-14, 0, 2, 32,
50, 0, 18, 0,
274, 0, 242, 0,
242, 0, 226, 32,
306, 0, 274, 0,
290, 96, 258, 96,
258, 96, 242, 128,
82, 64, 50, 64,
50, 64, 34, 96,
114, 64, 82, 64,
338, 0, 306, 0,
306, 0, 290, 32,
146, 64, 114, 64,
114, 64, 130, 96,
2, 96, -30, 96,
34, 96, 2, 96,
226, 32, 194, 32,
194, 32, 178, 64,
258, 32, 226, 32,
66, 96, 34, 96,
34, 96, 50, 128,
322, 32, 290, 32,
290, 32, 306, 64,
194, 32, 162, 32,
162, 32, 146, 64,
290, 32, 258, 32,
258, 32, 274, 64,
2, 32, -30, 32,
18, 128, -14, 128,
98, 96, 66, 96,
66, 96, 82, 128,
130, 96, 98, 96,
178, 64, 146, 64,
146, 64, 162, 96,
210, 64, 178, 64,
50, 128, 18, 128,
18, 128, 34, 160,
82, 128, 50, 128,
306, 128, 274, 128,
274, 128, 258, 160,
162, 96, 130, 96,
130, 96, 146, 128,
194, 96, 162, 96,
98, 32, 66, 32,
66, 32, 82, 64,
130, 32, 98, 32,
322, 96, 290, 96,
290, 96, 306, 128,
338, 128, 306, 128,
306, 128, 322, 160,
274, 128, 242, 128,
242, 128, 226, 160,
66, 32, 34, 32,
34, 32, 50, 64,
82, 0, 50, 0,
50, 0, 66, 32,
114, 0, 82, 0,
34, 32, 2, 32,
2, 32, -14, 64,
210, 128, 178, 128,
178, 128, 162, 160,
242, 128, 210, 128,
178, 0, 146, 0,
146, 0, 162, 32,
242, 0, 178, 0,
146, 0, 114, 0,
114, 0, 98, 32,
18, 64, -14, 64,
-14, 64, 2, 96,
50, 64, 18, 64,
114, 128, 82, 128,
82, 128, 98, 160,
146, 128, 114, 128,
338, 64, 306, 64,
306, 64, 290, 96,
226, 96, 194, 96,
194, 96, 178, 128,
258, 96, 226, 96,
242, 64, 210, 64,
210, 64, 194, 96
};
short screenlines_lvl75[] = {
88,
50, 0, 34, 32,
290, 96, 258, 96,
258, 96, 274, 128,
98, 96, 82, 128,
274, 128, 258, 160,
306, 64, 274, 64,
274, 64, 258, 96,
210, 0, 178, 0,
178, 0, 194, 32,
242, 0, 210, 0,
130, 32, 98, 32,
98, 32, 82, 64,
162, 32, 130, 32,
338, 0, 306, 0,
306, 0, 322, 32,
242, 128, 210, 128,
210, 128, 226, 160,
274, 128, 242, 128,
322, 96, 290, 96,
290, 96, 274, 128,
66, 96, 34, 96,
34, 96, 18, 128,
98, 96, 66, 96,
226, 32, 194, 32,
194, 32, 210, 64,
258, 32, 226, 32,
18, 128, -14, 128,
50, 128, 18, 128,
242, 64, 210, 64,
210, 64, 194, 96,
274, 64, 242, 64,
178, 128, 146, 128,
146, 128, 162, 160,
210, 128, 178, 128,
34, 96, -30, 96,
194, 96, 162, 96,
162, 96, 178, 128,
226, 96, 194, 96,
290, 32, 258, 32,
258, 32, 242, 64,
322, 32, 290, 32,
146, 0, 114, 0,
114, 0, 98, 32,
306, 128, 274, 128,
274, 128, 290, 160,
338, 128, 306, 128,
274, 0, 242, 0,
242, 0, 226, 32,
18, 64, -14, 64,
50, 64, 18, 64,
2, 32, -30, 32,
34, 32, 2, 32,
210, 64, 178, 64,
178, 64, 162, 96,
18, 0, -14, 0,
50, 0, 18, 0,
82, 128, 50, 128,
50, 128, 34, 160,
194, 32, 162, 32,
162, 32, 146, 64,
146, 64, 114, 64,
114, 64, 98, 96,
178, 64, 146, 64,
82, 0, 50, 0,
50, 0, 66, 32,
114, 0, 82, 0,
322, 32, 306, 64,
130, 96, 98, 96,
98, 96, 114, 128,
162, 96, 130, 96,
114, 128, 82, 128,
82, 128, 98, 160,
258, 96, 226, 96,
226, 96, 210, 128,
338, 64, 306, 64,
306, 64, 322, 96,
66, 32, 34, 32,
34, 32, 18, 64,
98, 32, 66, 32,
146, 128, 114, 128,
114, 128, 130, 160,
82, 64, 50, 64,
50, 64, 66, 96,
114, 64, 82, 64,
306, 0, 274, 0,
274, 0, 290, 32,
178, 0, 146, 0,
146, 0, 162, 32
};
short screenlines_lvl76[] = {
88,
50, 0, 18, 0,
18, 0, 34, 32,
258, 32, 226, 32,
226, 32, 242, 64,
194, 96, 162, 96,
162, 96, 178, 128,
34, 96, 18, 128,
306, 128, 274, 128,
274, 128, 290, 160,
146, 128, 130, 160,
50, 128, -14, 128,
114, 128, 82, 128,
82, 128, 98, 160,
146, 128, 114, 128,
82, 0, 50, 0,
50, 0, 34, 32,
338, 128, 306, 128,
306, 128, 290, 160,
290, 96, 258, 96,
258, 96, 274, 128,
354, 96, 290, 96,
66, 96, 34, 96,
34, 96, 50, 128,
98, 96, 66, 96,
98, 32, 66, 32,
66, 32, 50, 64,
130, 32, 98, 32,
2, 96, -30, 96,
34, 96, 2, 96,
258, 96, 226, 96,
226, 96, 210, 128,
210, 0, 178, 0,
178, 0, 162, 32,
18, 0, -14, 0,
338, 64, 306, 64,
306, 64, 290, 96,
322, 32, 290, 32,
290, 32, 306, 64,
290, 32, 258, 32,
258, 32, 242, 64,
114, 0, 82, 0,
82, 0, 98, 32,
178, 0, 114, 0,
2, 32, -30, 32,
274, 128, 242, 128,
242, 128, 226, 160,
226, 96, 194, 96,
194, 96, 178, 128,
162, 32, 130, 32,
130, 32, 114, 64,
178, 128, 146, 128,
146, 128, 162, 160,
242, 128, 178, 128,
34, 32, 2, 32,
2, 32, 18, 64,
66, 32, 34, 32,
338, 0, 306, 0,
306, 0, 290, 32,
210, 64, 178, 64,
178, 64, 162, 96,
194, 32, 162, 32,
162, 32, 178, 64,
226, 32, 194, 32,
50, 64, 18, 64,
18, 64, 34, 96,
82, 64, 50, 64,
114, 64, 82, 64,
82, 64, 66, 96,
130, 96, 98, 96,
98, 96, 114, 128,
162, 96, 130, 96,
242, 64, 210, 64,
210, 64, 226, 96,
274, 64, 242, 64,
274, 0, 242, 0,
242, 0, 258, 32,
306, 0, 274, 0,
242, 0, 210, 0,
210, 0, 226, 32,
82, 128, 50, 128,
50, 128, 34, 160,
306, 64, 274, 64,
274, 64, 258, 96,
146, 64, 114, 64,
114, 64, 130, 96,
178, 64, 146, 64,
18, 64, -14, 64,
-14, 64, 2, 96
};
short screenlines_lvl77[] = {
91,
82, 0, 66, 32,
226, 96, 194, 96,
194, 96, 210, 128,
18, 64, -14, 64,
162, 32, 130, 32,
130, 32, 114, 64,
306, 128, 274, 128,
274, 128, 290, 160,
370, 128, 306, 128,
114, 0, 82, 0,
82, 0, 98, 32,
146, 0, 114, 0,
146, 64, 114, 64,
114, 64, 130, 96,
178, 64, 146, 64,
50, 0, 18, 0,
18, 0, 2, 32,
82, 0, 50, 0,
82, 128, 50, 128,
50, 128, 34, 160,
258, 96, 226, 96,
226, 96, 242, 128,
290, 96, 258, 96,
322, 96, 290, 96,
290, 96, 274, 128,
2, 96, -30, 96,
274, 64, 242, 64,
242, 64, 258, 96,
306, 64, 274, 64,
34, 32, 2, 32,
2, 32, -14, 64,
66, 32, 34, 32,
274, 128, 242, 128,
242, 128, 258, 160,
306, 0, 274, 0,
274, 0, 290, 32,
338, 0, 306, 0,
242, 128, 210, 128,
210, 128, 226, 160,
18, 128, -46, 128,
290, 32, 258, 32,
258, 32, 274, 64,
322, 32, 290, 32,
178, 0, 146, 0,
146, 0, 130, 32,
2, 32, -30, 32,
210, 0, 178, 0,
178, 0, 194, 32,
242, 0, 210, 0,
50, 128, 18, 128,
18, 128, 2, 160,
194, 32, 162, 32,
162, 32, 178, 64,
226, 32, 194, 32,
114, 128, 82, 128,
82, 128, 98, 160,
146, 128, 114, 128,
178, 128, 146, 128,
146, 128, 162, 160,
210, 128, 178, 128,
130, 96, 98, 96,
98, 96, 114, 128,
66, 96, 34, 96,
34, 96, 18, 128,
274, 0, 242, 0,
242, 0, 258, 32,
162, 96, 130, 96,
130, 96, 146, 128,
194, 96, 162, 96,
98, 96, 66, 96,
66, 96, 82, 128,
82, 64, 50, 64,
50, 64, 66, 96,
114, 64, 82, 64,
242, 64, 210, 64,
210, 64, 226, 96,
130, 32, 98, 32,
98, 32, 82, 64,
258, 32, 226, 32,
226, 32, 242, 64,
34, 96, 2, 96,
2, 96, -14, 128,
210, 64, 178, 64,
178, 64, 162, 96,
18, 0, -14, 0,
50, 64, 18, 64,
18, 64, 2, 96,
338, 64, 306, 64,
306, 64, 322, 96,
98, 32, 66, 32,
66, 32, 50, 64
};
short screenlines_lvl78[] = {
85,
50, 64, 34, 96,
130, 96, 114, 128,
306, 0, 274, 0,
274, 0, 258, 32,
178, 64, 146, 64,
146, 64, 130, 96,
306, 64, 274, 64,
274, 64, 258, 96,
338, 64, 306, 64,
2, 96, -30, 96,
34, 96, 2, 96,
34, 32, 2, 32,
2, 32, -14, 64,
66, 32, 34, 32,
50, 0, 18, 0,
18, 0, 34, 32,
82, 0, 50, 0,
146, 0, 114, 0,
114, 0, 130, 32,
210, 0, 146, 0,
162, 96, 130, 96,
130, 96, 146, 128,
194, 96, 162, 96,
290, 96, 258, 96,
258, 96, 274, 128,
322, 96, 290, 96,
2, 32, -30, 32,
18, 0, -14, 0,
82, 64, 50, 64,
50, 64, 66, 96,
114, 64, 82, 64,
322, 32, 306, 64,
18, 128, -14, 128,
114, 0, 82, 0,
82, 0, 66, 32,
98, 96, 66, 96,
66, 96, 82, 128,
130, 96, 98, 96,
98, 32, 66, 32,
66, 32, 50, 64,
130, 32, 98, 32,
226, 96, 194, 96,
194, 96, 210, 128,
258, 96, 226, 96,
66, 96, 34, 96,
34, 96, 18, 128,
274, 128, 242, 128,
242, 128, 258, 160,
338, 128, 274, 128,
210, 64, 178, 64,
178, 64, 162, 96,
242, 64, 210, 64,
290, 32, 258, 32,
258, 32, 242, 64,
322, 32, 290, 32,
146, 128, 114, 128,
114, 128, 130, 160,
178, 128, 146, 128,
242, 0, 210, 0,
210, 0, 194, 32,
274, 0, 242, 0,
114, 128, 82, 128,
82, 128, 66, 160,
226, 32, 194, 32,
194, 32, 178, 64,
258, 32, 226, 32,
146, 64, 114, 64,
114, 64, 98, 96,
210, 128, 178, 128,
178, 128, 162, 160,
242, 128, 210, 128,
322, 96, 306, 128,
50, 128, 18, 128,
18, 128, 34, 160,
82, 128, 50, 128,
18, 64, -14, 64,
-14, 64, 2, 96,
50, 64, 18, 64,
162, 32, 130, 32,
130, 32, 114, 64,
194, 32, 162, 32,
338, 0, 306, 0,
306, 0, 290, 32,
274, 64, 242, 64,
242, 64, 226, 96
};
short screenlines_lvl79[] = {
91,
82, 0, 50, 0,
50, 0, 66, 32,
98, 96, 66, 96,
66, 96, 82, 128,
162, 96, 146, 128,
114, 64, 82, 64,
82, 64, 66, 96,
194, 32, 162, 32,
162, 32, 178, 64,
226, 32, 194, 32,
34, 96, 2, 96,
2, 96, 18, 128,
66, 96, 34, 96,
114, 0, 82, 0,
82, 0, 66, 32,
146, 0, 114, 0,
114, 128, 82, 128,
82, 128, 66, 160,
34, 32, 2, 32,
2, 32, -14, 64,
66, 32, 34, 32,
210, 64, 178, 64,
178, 64, 194, 96,
242, 64, 210, 64,
274, 64, 242, 64,
242, 64, 258, 96,
306, 64, 274, 64,
18, 128, -14, 128,
50, 64, 18, 64,
18, 64, 34, 96,
82, 64, 50, 64,
322, 96, 290, 96,
290, 96, 306, 128,
146, 64, 114, 64,
114, 64, 98, 96,
322, 32, 306, 64,
258, 96, 226, 96,
226, 96, 242, 128,
290, 96, 258, 96,
18, 64, -14, 64,
194, 96, 162, 96,
162, 96, 178, 128,
226, 96, 194, 96,
130, 96, 98, 96,
98, 96, 82, 128,
162, 96, 130, 96,
242, 128, 210, 128,
210, 128, 226, 160,
274, 128, 242, 128,
322, 32, 290, 32,
290, 32, 274, 64,
306, 0, 274, 0,
274, 0, 290, 32,
338, 0, 306, 0,
274, 0, 242, 0,
242, 0, 258, 32,
338, 128, 306, 128,
306, 128, 290, 160,
306, 128, 274, 128,
274, 128, 258, 160,
146, 128, 114, 128,
114, 128, 130, 160,
178, 128, 146, 128,
242, 0, 210, 0,
210, 0, 226, 32,
258, 32, 226, 32,
226, 32, 210, 64,
290, 32, 258, 32,
178, 0, 146, 0,
146, 0, 130, 32,
50, 128, 18, 128,
18, 128, 2, 160,
82, 128, 50, 128,
2, 96, -30, 96,
2, 32, -30, 32,
18, 0, -14, 0,
178, 64, 146, 64,
146, 64, 162, 96,
210, 0, 178, 0,
178, 0, 194, 32,
50, 0, 18, 0,
18, 0, 34, 32,
98, 32, 66, 32,
66, 32, 82, 64,
130, 32, 98, 32,
338, 64, 306, 64,
306, 64, 322, 96,
210, 128, 178, 128,
178, 128, 194, 160,
162, 32, 130, 32,
130, 32, 146, 64
};
|
the_stack_data/182953391.c | void ft_print_num_two(int num)
{
ft_putchar((num / 10) + '0');
ft_putchar((num % 10) + '0');
}
void ft_print_comb2(void)
{
int arr[1];
arr[0] = 0 - 1;
while (++arr[0] < 98)
{
arr[1] = arr[0];
while (++arr[1] <= 99)
{
ft_print_num_two(arr[0]);
ft_putchar(' ');
ft_print_num_two(arr[1]);
ft_putstr(", ", 2);
}
}
ft_putstr("98 99", 5);
} |
the_stack_data/181393129.c | /***********************************************************
icubrt.c -- 立方根
***********************************************************/
unsigned int icubrt(unsigned int x)
{
unsigned int s, t;
if (x == 0) return 0;
s = 1; t = x;
while (s < t) { s <<= 1; t >>= 2; }
do {
t = s; s = (x / (s * s) + 2 * s) / 3;
} while (s < t);
return t;
}
#include <stdio.h>
#include <stdlib.h>
int main(void)
{
unsigned int i;
unsigned long s;
printf("整数の立方根のテスト中\n");
i = 0;
do {
if ((i & 0x3fff) == 0) printf("i = %u\n", i);
s = icubrt(i);
if (s * s * s > i || (s + 1) * (s + 1) * (s + 1) <= i) {
printf("Error: i = %u, icubrt(i) = %lu\n", i, s);
break;
}
} while (++i != 0);
printf("テスト完了\n");
return 0;
}
|
the_stack_data/22625.c | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define ISIZE 10
#define JSIZE 15
int main(int argc, char **argv)
{
double a[ISIZE][JSIZE]; int i, j;
FILE *ff;
for (i=0; i<ISIZE; i++)
for (j=0; j<JSIZE; j++)
a[i][j] = 10*i +j;
for (i=0; i<ISIZE; i++)
for (j=0; j<JSIZE; j++)
a[i][j] = sin(0.00001*a[i][j]);
ff = fopen("result.txt","w");
for(i=0; i < ISIZE; i++)
{
for (j=0; j < JSIZE; j++)
fprintf(ff, "%f ", a[i][j]);
fprintf(ff, "\n");
}
fclose(ff);
return 0;
}
|
the_stack_data/176705955.c | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define BUFSIZE ( 1024 * 1024 )
int main( int argc, char * argv[] )
{
char *buf1, *buf2;
FILE * fp1, *fp2;
int ret1, ret2;
int ret, total;
if( argc < 3 ){
return -1;
}
fp1 = fopen( argv[ 1 ], "r" );
fp2 = fopen( argv[ 2 ], "r" );
buf1 = malloc( BUFSIZE );
buf2 = malloc( BUFSIZE );
if( fp1 == NULL || fp2 == NULL || buf1 == NULL || buf2 == NULL ){
if( fp1 != NULL )fclose( fp1 );
if( fp2 != NULL )fclose( fp2 );
printf( "init error!\n" );
return -1;
}
total = ret = 0;
while( 1 ){
ret1 = fread( buf1, 1, BUFSIZE, fp1 );
ret2 = fread( buf2, 1, BUFSIZE, fp2 );
if( ret1 == ret2 ){
total += ret1;
if( ret1 == 0 )break;
if( memcmp( buf1, buf2, ret ) != 0 ){
ret = -1;
printf( "compare error\n" );
break;
}
}else{
printf( "read num:%d:%d\n", ret1, ret2 );
ret = -1;
break;
}
}
printf( "%s %s %d\n", argv[ 1 ], argv[ 2 ], total );
fclose( fp1 );
fclose( fp2 );
return ret;
}
|
the_stack_data/113616.c | #include <stdio.h>
int primo(int a){
int i,c;
for(c=0,i=1;i<=a;i++){
if(a%i==0){
c++;
}
}
if(c==2){
return 1;
}
else{
return 0;
}
}
int main(){
int i,j,n,c;
scanf("%d", &n);
for(c=0,i=2;i<=n;i++){
if(primo(i)==1){
printf("%d ", i);
}
}
}
|
the_stack_data/134150.c | // When entry values are emitted, expect a subprogram for extern decls so that
// the dwarf generator can describe call site parameters at extern call sites.
//
// Initial implementation relied on the 'retainedTypes:' from the corresponding
// DICompileUnit, so we also ensure that we do not store the extern declaration
// subprogram into the 'retainedTypes:'.
//
// RUN: %clang -g -O2 -target x86_64-none-linux-gnu -S -emit-llvm %s -o - \
// RUN: | FileCheck %s -check-prefix=DECLS-FOR-EXTERN
// Similarly, when the debugger tuning is gdb, expect a subprogram for extern
// decls so that the dwarf generator can describe information needed for tail
// call frame reconstrution.
//
// RUN: %clang -g -O2 -target x86_64-none-linux-gnu -ggdb -S -emit-llvm %s -o - \
// RUN: | FileCheck %s -check-prefix=DECLS-FOR-EXTERN
//
// Do not emit a subprogram for extern decls when entry values are disabled and
// the tuning is not set to gdb.
//
// RUN: %clang -g -O2 -target x86_64-none-linux-gnu -gsce -S -emit-llvm %s -o - \
// RUN: | FileCheck %s -check-prefix=NO-DECLS-FOR-EXTERN
// DECLS-FOR-EXTERN-NOT: !DICompileUnit({{.*}}retainedTypes: !{{[0-9]+}}
// DECLS-FOR-EXTERN: [[INT_TYPE:![0-9]+]] = !DIBasicType(name: "int",
// DECLS-FOR-EXTERN: !DISubprogram(name: "fn1"
// DECLS-FOR-EXTERN-SAME: type: [[FN1_TYPE:![0-9]+]],
// DECLS-FOR-EXTERN: [[FN1_TYPE]] = !DISubroutineType(types: [[FN1_TYPES:![0-9]+]])
// DECLS-FOR-EXTERN: [[FN1_TYPES]] = !{[[X_TYPE:![0-9]+]],
// DECLS-FOR-EXTERN: [[X_TYPE]] = !DIDerivedType(tag: DW_TAG_typedef, name: "x",
// DECLS-FOR-EXTERN-SAME: baseType: [[INT_TYPE]])
// DECLS-FOR-EXTERN-NOT: !DISubprogram(name: "memcmp"
// DECLS-FOR-EXTERN-NOT: !DISubprogram(name: "__some_reserved_name"
// NO-DECLS-FOR-EXTERN-NOT: !DISubprogram(name: "fn1"
// NO-DECLS-FOR-EXTERN-NOT: !DISubprogram(name: "memcmp"
// NO-DECLS-FOR-EXTERN-NOT: !DISubprogram(name: "__some_reserved_name"
typedef int x;
extern x fn1(int a, int b);
extern int memcmp(const void *s1, const void *s2, unsigned long n);
extern void __some_reserved_name(void);
int fn2 (int *src, int *dst) {
int x = 4, y = 5;
int res = fn1(x, y);
int res2 = memcmp(dst, src, res);
__some_reserved_name();
return res + res2;
}
|
the_stack_data/12636993.c | /* $OpenBSD: strncmp.c,v 1.7 2005/08/08 08:05:37 espie Exp $ */
/*
* Copyright (c) 1989 The Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#if !defined(_KERNEL) && !defined(_STANDALONE)
#include <string.h>
#else
#include <lib/libkern/libkern.h>
#endif
int
strncmp(const char *s1, const char *s2, size_t n)
{
if (n == 0)
return (0);
do {
if (*s1 != *s2++)
return (*(unsigned char *)s1 - *(unsigned char *)--s2);
if (*s1++ == 0)
break;
} while (--n != 0);
return (0);
}
|
the_stack_data/218893879.c | #include <stdio.h>
#include <stdlib.h>
int main(int argc, char **argv) {
long double u = 2.0L;
long double v = -4.0L;
for (size_t i = 0; i < 90; i++) {
long double w = 111.0L - 1130.0L / v + 3000.0L / (u * v);
u = v;
v = w;
}
printf("%-16.12Lf\n", v);
return EXIT_SUCCESS;
}
|
the_stack_data/75138768.c | #include <stdio.h>
int resta(int a, int b)
{
int c;
c = a - b;
return c;
}
|
the_stack_data/28261495.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_sort_params.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: kaye <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2020/08/10 19:41:54 by kaye #+# #+# */
/* Updated: 2020/08/12 14:22:53 by kaye ### ########.fr */
/* */
/* ************************************************************************** */
#include <unistd.h>
void ft_putstr(char *str)
{
while (*str)
write(1, str++, 1);
}
int ft_strcmp(char *s1, char *s2)
{
int i;
i = 0;
while ((s1[i] || s2[i]) && (s1[i] == s2[i]))
i++;
return (s1[i] - s2[i]);
}
int main(int argc, char **argv)
{
int i;
int j;
char *tmp;
i = 0;
while (++i < argc - 1)
{
j = i + 1;
while (j < argc)
{
if (ft_strcmp(argv[i], argv[j]) > 0)
{
tmp = argv[i];
argv[i] = argv[j];
argv[j] = tmp;
}
j++;
}
}
i = 0;
while (++i < argc)
{
ft_putstr(argv[i]);
write(1, "\n", 1);
}
}
|
the_stack_data/200142187.c | #include<stdio.h>
#include<assert.h>
float calDiscount (int time, float totAmount);
void testCalDiscount();
void displayGift(float finalTot);
int main()
{
int inputTime;
float inputTotAmount, inputFinalTot;
testCalDiscount();
printf("Enter time: ");
scanf("%d", &inputTime);
printf("Enter the total amount: ");
scanf("%f", &inputTotAmount);
inputFinalTot = inputTotAmount - calDiscount(inputTime, inputTotAmount);
printf("Final amount: %.2f", inputFinalTot);
displayGift(inputFinalTot);
return 0;
}
float calDiscount (int time, float totAmount)
{
if (time >= 16 && time < 20 && totAmount >= 5000)
return totAmount * 10 / 100.0;
else if (time >= 16 && time < 20 && totAmount >= 2500 && totAmount < 5000)
return totAmount * 7 / 100.0;
else if (time >= 20 && time < 22 && totAmount >= 5000)
return totAmount * 12 / 100.0;
else if (time >= 20 && time < 22 && totAmount >= 2500 && totAmount < 5000)
return totAmount * 9 / 100.0;
else
return 0;
}
void testCalDiscount()
{
assert(calDiscount (12, 5000) == 0);
assert(calDiscount (16, 5000) == 500);
printf("testCalDiscount() unit tests passed.\n");
}
void displayGift(float finalTot)
{
if (finalTot >= 7000)
printf(" (Packet of Milk)");
if (finalTot <= 6999 && finalTot >= 5000)
printf(" (1kg of Sugar)");
if (finalTot <= 4999 && finalTot >= 3000)
printf(" (Pack of 6 Eggs)");
if (finalTot < 3000)
printf(" (No Gift)");
}
|
the_stack_data/677584.c | // Copyright 2016 The Fuchsia Authors
// Copyright (c) 2008 Travis Geiselbrecht
//
// Use of this source code is governed by a MIT-style
// license that can be found in the LICENSE file or at
// https://opensource.org/licenses/MIT
#include <string.h>
#include <sys/types.h>
#if !_ASM_MEMMOVE
typedef long word;
#define lsize sizeof(word)
#define lmask (lsize - 1)
void *memmove(void *dest, void const *src, size_t count) {
char *d = (char *)dest;
const char *s = (const char *)src;
int len;
if (count == 0 || dest == src)
return dest;
if ((long)d < (long)s) {
if (((long)d | (long)s) & lmask) {
// src and/or dest do not align on word boundary
if ((((long)d ^ (long)s) & lmask) || (count < lsize))
len = count; // copy the rest of the buffer with the byte mover
else
len = lsize - ((long)d & lmask); // move the ptrs up to a word boundary
count -= len;
for (; len > 0; len--)
*d++ = *s++;
}
for (len = count / lsize; len > 0; len--) {
*(word *)d = *(word *)s;
d += lsize;
s += lsize;
}
for (len = count & lmask; len > 0; len--)
*d++ = *s++;
} else {
d += count;
s += count;
if (((long)d | (long)s) & lmask) {
// src and/or dest do not align on word boundary
if ((((long)d ^ (long)s) & lmask) || (count <= lsize))
len = count;
else
len = ((long)d & lmask);
count -= len;
for (; len > 0; len--)
*--d = *--s;
}
for (len = count / lsize; len > 0; len--) {
d -= lsize;
s -= lsize;
*(word *)d = *(word *)s;
}
for (len = count & lmask; len > 0; len--)
*--d = *--s;
}
return dest;
}
#endif
|
the_stack_data/247017885.c | #include <stdio.h>
#include <stdlib.h>
typedef struct List_node{
int value;
struct List_node *next;
}List_node;
typedef struct List_node List;
List *swap(List *head ,List *node_1 ,List *node_2){
if( (head == NULL) || (node_1 == NULL) || (node_2 == NULL) || (node_1 == node_2) )
return head;
int num_pre_node_1_and_node_2 = 0 ;
List *_head = head ;
List *pre_node_1,*pre_node_2,*tmp_node;
while(head && head->next){
if(head->next == node_1){
pre_node_1 = head;
num_pre_node_1_and_node_2 = num_pre_node_1_and_node_2 + 1;
}
if(head->next == node_2){
pre_node_2 = head;
num_pre_node_1_and_node_2 = num_pre_node_1_and_node_2 + 1;
}
head = head->next;
}
head = _head;
if(head == node_1){
pre_node_1 = NULL;
num_pre_node_1_and_node_2 = num_pre_node_1_and_node_2+ 1;
}
if(head == node_2){
pre_node_2 = NULL;
num_pre_node_1_and_node_2 = num_pre_node_1_and_node_2+ 1;
}
if(num_pre_node_1_and_node_2 != 2)
return head;
if(pre_node_1 == NULL){
pre_node_2->next = node_1;
tmp_node = node_1->next;
node_1->next = node_2->next;
node_2->next = tmp_node;
return node_2 ;
}
if(pre_node_2 == NULL){
pre_node_1->next = node_2;
tmp_node = node_2->next;
node_2->next = node_1->next;
node_1->next = tmp_node;
return node_1;
}
if(node_2->next == node_1){
pre_node_2->next = node_1;
tmp_node = node_1->next;
node_1->next = node_2;
node_2->next = tmp_node;
return head;
}
if(node_1->next == node_2){
pre_node_1->next = node_2;
tmp_node = node_2->next;
node_2->next = node_1;
node_1->next = tmp_node;
return head;
}
pre_node_1->next = node_2;
tmp_node = node_2->next;
node_2->next = node_1->next;
pre_node_2->next = node_1;
node_1->next = tmp_node;
return head;
}
int main(){return 0;}
|
the_stack_data/57078.c | #include <stdio.h>
#include <stdlib.h>
void fatorial(int n){
int i;
int fat =1;
for(i=n;i<=1;i--){
fat = fat *i;
}
printf("o fatorial �: %d",fat);
return;
}
int main()
{
int numero;
printf("digite um numero para ser fatorado:");
scanf("%d",&numero);
fatorial(numero);
return 0;
}
|
the_stack_data/648.c | #include <stdio.h>
#include <stdlib.h>
int main()
{
int n,i,j,flag;
scanf("%d",&n);
for(i=n+1;1;i++){
for(j=2,flag=0;j<i;j++)
if(i%j==0) flag=1;
if(flag==0) break;}
printf("%d",i);
return 0;
} |
the_stack_data/199441.c | //
// Created by zhangrongxiang on 2018/2/1 10:40
// File client
//
#include<sys/types.h>
#include<sys/socket.h>
#include<string.h>
#include<netinet/in.h>
#include<stdio.h>
#include<stdlib.h>
#include<arpa/inet.h>
#include<fcntl.h>
#include<sys/stat.h>
#include<errno.h>
#include<sys/sysinfo.h>
#include<sys/select.h>
#include<sys/time.h>
#include<unistd.h>
#define MAX_SIZE 1024*40
#define SERV_PORT 2500
void connectUDP(char name[20], int sockfd, struct sockaddr *pservaddr, socklen_t servlen) {
char buf[MAX_SIZE];
fd_set wrset;
struct timeval tv;
int rlen, wlen;
int fd;
int ret;
int i;
if (connect(sockfd, (struct sockaddr *) pservaddr, servlen) == -1) {
perror("connet error");
exit(1);
} else
printf("connect server ok!\n");
fd = open(name, O_RDONLY);
if (fd == -1) {
printf("fopen error %s\n", strerror(errno));
exit(-1);
}
i = 0;
while (1) {
tv.tv_sec = 1;
tv.tv_usec = 0;
FD_ZERO(&wrset);
FD_SET(sockfd, &wrset);
ret = select(sockfd + 1, NULL, &wrset, NULL, &tv);
if (ret == -1) {
printf("select error %s\n", strerror(errno));
exit(-1);
} else if (ret == 0) {
printf("select timeout,continue circle\n");
continue;
}
memset(buf, 0, MAX_SIZE);
if (FD_ISSET(sockfd, &wrset)) {
rlen = read(fd, buf, MAX_SIZE);
if (rlen < 0) {
printf("fread data error %s\n", strerror(errno));
exit(-1);
} else if (rlen == 0) {
wlen = write(sockfd, "end", 3);
if (wlen != 3) {
printf("write end error %s\n", strerror(errno));
exit(-1);
}
printf("all complete\n");
close(fd);
close(sockfd);
exit(0);
}
wlen = write(sockfd, buf, rlen);
if (wlen != rlen) {
printf("write data to sockfd error:%s\n", strerror(errno));
exit(-1);
}
i++;
usleep(500);
printf("The %d times read\n", i);
}
}
}
int main(int argc, char *argv[]) {
char *fh;
struct sysinfo s_info;
float time1, time2;
int error1, error2;
int sockfd;
struct stat fsize;
struct sockaddr_in servaddr;
error1 = sysinfo(&s_info);
time1 = s_info.uptime;
int r;
if (argc != 3) {
printf("useage:udpclient<IPaddress>;\n");
exit(1);
}
bzero(&servaddr, sizeof(servaddr));
servaddr.sin_family = AF_INET;
servaddr.sin_port = htons(SERV_PORT);
if (inet_pton(AF_INET, argv[1], &servaddr.sin_addr) <= 0) {
printf("[%s]is not a valid IPaddress\n", argv[1]);
exit(1);
}
fh = argv[2];
sockfd = socket(AF_INET, SOCK_DGRAM, 0);
r = fcntl(sockfd, F_GETFL, 0);
fcntl(sockfd, F_SETFL, r & ~O_NONBLOCK);
connectUDP(argv[2], sockfd, (struct sockaddr *) &servaddr, sizeof(servaddr));
fprintf(stderr, "ServerIP:\t%s\n", argv[1]);
if (stat(argv[2], &fsize) == -1)
perror("failed to get fiel statusi\n");
else
fprintf(stderr, "file name:\t%s\nfile size:\t%dK\n", argv[2], fsize.st_size / 1024);
error2 = sysinfo(&s_info);
time2 = s_info.uptime;
printf("tranfice file time =%fs\n", (time2 - time1));
return 0;
}
|
the_stack_data/18888737.c | #include <stdio.h>
#include <stdlib.h>
void funcaoPrint(int x[3][3]){
int i,j;
for(i=0;i<3;i++){
for(j=0;j<3;j++){
printf("%d ", x[i][j]);
}
printf("\n");
}
}
int main(){
int matriz[3][3] = {1,2,3,4,5,6,7,8,9};
funcaoPrint(matriz);
return 0;
} |
the_stack_data/90278.c | //@ ltl invariant negative: (<> ((X AP(x_8 - x_17 > 16)) R AP(x_16 - x_22 > -11)));
float x_0;
float x_1;
float x_2;
float x_3;
float x_4;
float x_5;
float x_6;
float x_7;
float x_8;
float x_9;
float x_10;
float x_11;
float x_12;
float x_13;
float x_14;
float x_15;
float x_16;
float x_17;
float x_18;
float x_19;
float x_20;
float x_21;
float x_22;
float x_23;
int main()
{
float x_0_;
float x_1_;
float x_2_;
float x_3_;
float x_4_;
float x_5_;
float x_6_;
float x_7_;
float x_8_;
float x_9_;
float x_10_;
float x_11_;
float x_12_;
float x_13_;
float x_14_;
float x_15_;
float x_16_;
float x_17_;
float x_18_;
float x_19_;
float x_20_;
float x_21_;
float x_22_;
float x_23_;
while(1) {
x_0_ = ((((13.0 + x_0) > ((20.0 + x_1) > (12.0 + x_2)? (20.0 + x_1) : (12.0 + x_2))? (13.0 + x_0) : ((20.0 + x_1) > (12.0 + x_2)? (20.0 + x_1) : (12.0 + x_2))) > ((15.0 + x_5) > ((4.0 + x_12) > (17.0 + x_13)? (4.0 + x_12) : (17.0 + x_13))? (15.0 + x_5) : ((4.0 + x_12) > (17.0 + x_13)? (4.0 + x_12) : (17.0 + x_13)))? ((13.0 + x_0) > ((20.0 + x_1) > (12.0 + x_2)? (20.0 + x_1) : (12.0 + x_2))? (13.0 + x_0) : ((20.0 + x_1) > (12.0 + x_2)? (20.0 + x_1) : (12.0 + x_2))) : ((15.0 + x_5) > ((4.0 + x_12) > (17.0 + x_13)? (4.0 + x_12) : (17.0 + x_13))? (15.0 + x_5) : ((4.0 + x_12) > (17.0 + x_13)? (4.0 + x_12) : (17.0 + x_13)))) > (((1.0 + x_15) > ((13.0 + x_17) > (3.0 + x_20)? (13.0 + x_17) : (3.0 + x_20))? (1.0 + x_15) : ((13.0 + x_17) > (3.0 + x_20)? (13.0 + x_17) : (3.0 + x_20))) > ((9.0 + x_21) > ((11.0 + x_22) > (20.0 + x_23)? (11.0 + x_22) : (20.0 + x_23))? (9.0 + x_21) : ((11.0 + x_22) > (20.0 + x_23)? (11.0 + x_22) : (20.0 + x_23)))? ((1.0 + x_15) > ((13.0 + x_17) > (3.0 + x_20)? (13.0 + x_17) : (3.0 + x_20))? (1.0 + x_15) : ((13.0 + x_17) > (3.0 + x_20)? (13.0 + x_17) : (3.0 + x_20))) : ((9.0 + x_21) > ((11.0 + x_22) > (20.0 + x_23)? (11.0 + x_22) : (20.0 + x_23))? (9.0 + x_21) : ((11.0 + x_22) > (20.0 + x_23)? (11.0 + x_22) : (20.0 + x_23))))? (((13.0 + x_0) > ((20.0 + x_1) > (12.0 + x_2)? (20.0 + x_1) : (12.0 + x_2))? (13.0 + x_0) : ((20.0 + x_1) > (12.0 + x_2)? (20.0 + x_1) : (12.0 + x_2))) > ((15.0 + x_5) > ((4.0 + x_12) > (17.0 + x_13)? (4.0 + x_12) : (17.0 + x_13))? (15.0 + x_5) : ((4.0 + x_12) > (17.0 + x_13)? (4.0 + x_12) : (17.0 + x_13)))? ((13.0 + x_0) > ((20.0 + x_1) > (12.0 + x_2)? (20.0 + x_1) : (12.0 + x_2))? (13.0 + x_0) : ((20.0 + x_1) > (12.0 + x_2)? (20.0 + x_1) : (12.0 + x_2))) : ((15.0 + x_5) > ((4.0 + x_12) > (17.0 + x_13)? (4.0 + x_12) : (17.0 + x_13))? (15.0 + x_5) : ((4.0 + x_12) > (17.0 + x_13)? (4.0 + x_12) : (17.0 + x_13)))) : (((1.0 + x_15) > ((13.0 + x_17) > (3.0 + x_20)? (13.0 + x_17) : (3.0 + x_20))? (1.0 + x_15) : ((13.0 + x_17) > (3.0 + x_20)? (13.0 + x_17) : (3.0 + x_20))) > ((9.0 + x_21) > ((11.0 + x_22) > (20.0 + x_23)? (11.0 + x_22) : (20.0 + x_23))? (9.0 + x_21) : ((11.0 + x_22) > (20.0 + x_23)? (11.0 + x_22) : (20.0 + x_23)))? ((1.0 + x_15) > ((13.0 + x_17) > (3.0 + x_20)? (13.0 + x_17) : (3.0 + x_20))? (1.0 + x_15) : ((13.0 + x_17) > (3.0 + x_20)? (13.0 + x_17) : (3.0 + x_20))) : ((9.0 + x_21) > ((11.0 + x_22) > (20.0 + x_23)? (11.0 + x_22) : (20.0 + x_23))? (9.0 + x_21) : ((11.0 + x_22) > (20.0 + x_23)? (11.0 + x_22) : (20.0 + x_23)))));
x_1_ = ((((4.0 + x_0) > ((20.0 + x_1) > (19.0 + x_2)? (20.0 + x_1) : (19.0 + x_2))? (4.0 + x_0) : ((20.0 + x_1) > (19.0 + x_2)? (20.0 + x_1) : (19.0 + x_2))) > ((9.0 + x_5) > ((5.0 + x_6) > (19.0 + x_9)? (5.0 + x_6) : (19.0 + x_9))? (9.0 + x_5) : ((5.0 + x_6) > (19.0 + x_9)? (5.0 + x_6) : (19.0 + x_9)))? ((4.0 + x_0) > ((20.0 + x_1) > (19.0 + x_2)? (20.0 + x_1) : (19.0 + x_2))? (4.0 + x_0) : ((20.0 + x_1) > (19.0 + x_2)? (20.0 + x_1) : (19.0 + x_2))) : ((9.0 + x_5) > ((5.0 + x_6) > (19.0 + x_9)? (5.0 + x_6) : (19.0 + x_9))? (9.0 + x_5) : ((5.0 + x_6) > (19.0 + x_9)? (5.0 + x_6) : (19.0 + x_9)))) > (((13.0 + x_10) > ((3.0 + x_15) > (15.0 + x_16)? (3.0 + x_15) : (15.0 + x_16))? (13.0 + x_10) : ((3.0 + x_15) > (15.0 + x_16)? (3.0 + x_15) : (15.0 + x_16))) > ((8.0 + x_19) > ((3.0 + x_20) > (2.0 + x_21)? (3.0 + x_20) : (2.0 + x_21))? (8.0 + x_19) : ((3.0 + x_20) > (2.0 + x_21)? (3.0 + x_20) : (2.0 + x_21)))? ((13.0 + x_10) > ((3.0 + x_15) > (15.0 + x_16)? (3.0 + x_15) : (15.0 + x_16))? (13.0 + x_10) : ((3.0 + x_15) > (15.0 + x_16)? (3.0 + x_15) : (15.0 + x_16))) : ((8.0 + x_19) > ((3.0 + x_20) > (2.0 + x_21)? (3.0 + x_20) : (2.0 + x_21))? (8.0 + x_19) : ((3.0 + x_20) > (2.0 + x_21)? (3.0 + x_20) : (2.0 + x_21))))? (((4.0 + x_0) > ((20.0 + x_1) > (19.0 + x_2)? (20.0 + x_1) : (19.0 + x_2))? (4.0 + x_0) : ((20.0 + x_1) > (19.0 + x_2)? (20.0 + x_1) : (19.0 + x_2))) > ((9.0 + x_5) > ((5.0 + x_6) > (19.0 + x_9)? (5.0 + x_6) : (19.0 + x_9))? (9.0 + x_5) : ((5.0 + x_6) > (19.0 + x_9)? (5.0 + x_6) : (19.0 + x_9)))? ((4.0 + x_0) > ((20.0 + x_1) > (19.0 + x_2)? (20.0 + x_1) : (19.0 + x_2))? (4.0 + x_0) : ((20.0 + x_1) > (19.0 + x_2)? (20.0 + x_1) : (19.0 + x_2))) : ((9.0 + x_5) > ((5.0 + x_6) > (19.0 + x_9)? (5.0 + x_6) : (19.0 + x_9))? (9.0 + x_5) : ((5.0 + x_6) > (19.0 + x_9)? (5.0 + x_6) : (19.0 + x_9)))) : (((13.0 + x_10) > ((3.0 + x_15) > (15.0 + x_16)? (3.0 + x_15) : (15.0 + x_16))? (13.0 + x_10) : ((3.0 + x_15) > (15.0 + x_16)? (3.0 + x_15) : (15.0 + x_16))) > ((8.0 + x_19) > ((3.0 + x_20) > (2.0 + x_21)? (3.0 + x_20) : (2.0 + x_21))? (8.0 + x_19) : ((3.0 + x_20) > (2.0 + x_21)? (3.0 + x_20) : (2.0 + x_21)))? ((13.0 + x_10) > ((3.0 + x_15) > (15.0 + x_16)? (3.0 + x_15) : (15.0 + x_16))? (13.0 + x_10) : ((3.0 + x_15) > (15.0 + x_16)? (3.0 + x_15) : (15.0 + x_16))) : ((8.0 + x_19) > ((3.0 + x_20) > (2.0 + x_21)? (3.0 + x_20) : (2.0 + x_21))? (8.0 + x_19) : ((3.0 + x_20) > (2.0 + x_21)? (3.0 + x_20) : (2.0 + x_21)))));
x_2_ = ((((3.0 + x_1) > ((20.0 + x_3) > (7.0 + x_5)? (20.0 + x_3) : (7.0 + x_5))? (3.0 + x_1) : ((20.0 + x_3) > (7.0 + x_5)? (20.0 + x_3) : (7.0 + x_5))) > ((12.0 + x_8) > ((14.0 + x_10) > (20.0 + x_11)? (14.0 + x_10) : (20.0 + x_11))? (12.0 + x_8) : ((14.0 + x_10) > (20.0 + x_11)? (14.0 + x_10) : (20.0 + x_11)))? ((3.0 + x_1) > ((20.0 + x_3) > (7.0 + x_5)? (20.0 + x_3) : (7.0 + x_5))? (3.0 + x_1) : ((20.0 + x_3) > (7.0 + x_5)? (20.0 + x_3) : (7.0 + x_5))) : ((12.0 + x_8) > ((14.0 + x_10) > (20.0 + x_11)? (14.0 + x_10) : (20.0 + x_11))? (12.0 + x_8) : ((14.0 + x_10) > (20.0 + x_11)? (14.0 + x_10) : (20.0 + x_11)))) > (((7.0 + x_15) > ((5.0 + x_16) > (1.0 + x_17)? (5.0 + x_16) : (1.0 + x_17))? (7.0 + x_15) : ((5.0 + x_16) > (1.0 + x_17)? (5.0 + x_16) : (1.0 + x_17))) > ((6.0 + x_18) > ((5.0 + x_20) > (1.0 + x_23)? (5.0 + x_20) : (1.0 + x_23))? (6.0 + x_18) : ((5.0 + x_20) > (1.0 + x_23)? (5.0 + x_20) : (1.0 + x_23)))? ((7.0 + x_15) > ((5.0 + x_16) > (1.0 + x_17)? (5.0 + x_16) : (1.0 + x_17))? (7.0 + x_15) : ((5.0 + x_16) > (1.0 + x_17)? (5.0 + x_16) : (1.0 + x_17))) : ((6.0 + x_18) > ((5.0 + x_20) > (1.0 + x_23)? (5.0 + x_20) : (1.0 + x_23))? (6.0 + x_18) : ((5.0 + x_20) > (1.0 + x_23)? (5.0 + x_20) : (1.0 + x_23))))? (((3.0 + x_1) > ((20.0 + x_3) > (7.0 + x_5)? (20.0 + x_3) : (7.0 + x_5))? (3.0 + x_1) : ((20.0 + x_3) > (7.0 + x_5)? (20.0 + x_3) : (7.0 + x_5))) > ((12.0 + x_8) > ((14.0 + x_10) > (20.0 + x_11)? (14.0 + x_10) : (20.0 + x_11))? (12.0 + x_8) : ((14.0 + x_10) > (20.0 + x_11)? (14.0 + x_10) : (20.0 + x_11)))? ((3.0 + x_1) > ((20.0 + x_3) > (7.0 + x_5)? (20.0 + x_3) : (7.0 + x_5))? (3.0 + x_1) : ((20.0 + x_3) > (7.0 + x_5)? (20.0 + x_3) : (7.0 + x_5))) : ((12.0 + x_8) > ((14.0 + x_10) > (20.0 + x_11)? (14.0 + x_10) : (20.0 + x_11))? (12.0 + x_8) : ((14.0 + x_10) > (20.0 + x_11)? (14.0 + x_10) : (20.0 + x_11)))) : (((7.0 + x_15) > ((5.0 + x_16) > (1.0 + x_17)? (5.0 + x_16) : (1.0 + x_17))? (7.0 + x_15) : ((5.0 + x_16) > (1.0 + x_17)? (5.0 + x_16) : (1.0 + x_17))) > ((6.0 + x_18) > ((5.0 + x_20) > (1.0 + x_23)? (5.0 + x_20) : (1.0 + x_23))? (6.0 + x_18) : ((5.0 + x_20) > (1.0 + x_23)? (5.0 + x_20) : (1.0 + x_23)))? ((7.0 + x_15) > ((5.0 + x_16) > (1.0 + x_17)? (5.0 + x_16) : (1.0 + x_17))? (7.0 + x_15) : ((5.0 + x_16) > (1.0 + x_17)? (5.0 + x_16) : (1.0 + x_17))) : ((6.0 + x_18) > ((5.0 + x_20) > (1.0 + x_23)? (5.0 + x_20) : (1.0 + x_23))? (6.0 + x_18) : ((5.0 + x_20) > (1.0 + x_23)? (5.0 + x_20) : (1.0 + x_23)))));
x_3_ = ((((5.0 + x_0) > ((5.0 + x_2) > (18.0 + x_3)? (5.0 + x_2) : (18.0 + x_3))? (5.0 + x_0) : ((5.0 + x_2) > (18.0 + x_3)? (5.0 + x_2) : (18.0 + x_3))) > ((17.0 + x_4) > ((9.0 + x_6) > (4.0 + x_8)? (9.0 + x_6) : (4.0 + x_8))? (17.0 + x_4) : ((9.0 + x_6) > (4.0 + x_8)? (9.0 + x_6) : (4.0 + x_8)))? ((5.0 + x_0) > ((5.0 + x_2) > (18.0 + x_3)? (5.0 + x_2) : (18.0 + x_3))? (5.0 + x_0) : ((5.0 + x_2) > (18.0 + x_3)? (5.0 + x_2) : (18.0 + x_3))) : ((17.0 + x_4) > ((9.0 + x_6) > (4.0 + x_8)? (9.0 + x_6) : (4.0 + x_8))? (17.0 + x_4) : ((9.0 + x_6) > (4.0 + x_8)? (9.0 + x_6) : (4.0 + x_8)))) > (((11.0 + x_11) > ((1.0 + x_18) > (7.0 + x_19)? (1.0 + x_18) : (7.0 + x_19))? (11.0 + x_11) : ((1.0 + x_18) > (7.0 + x_19)? (1.0 + x_18) : (7.0 + x_19))) > ((4.0 + x_21) > ((17.0 + x_22) > (8.0 + x_23)? (17.0 + x_22) : (8.0 + x_23))? (4.0 + x_21) : ((17.0 + x_22) > (8.0 + x_23)? (17.0 + x_22) : (8.0 + x_23)))? ((11.0 + x_11) > ((1.0 + x_18) > (7.0 + x_19)? (1.0 + x_18) : (7.0 + x_19))? (11.0 + x_11) : ((1.0 + x_18) > (7.0 + x_19)? (1.0 + x_18) : (7.0 + x_19))) : ((4.0 + x_21) > ((17.0 + x_22) > (8.0 + x_23)? (17.0 + x_22) : (8.0 + x_23))? (4.0 + x_21) : ((17.0 + x_22) > (8.0 + x_23)? (17.0 + x_22) : (8.0 + x_23))))? (((5.0 + x_0) > ((5.0 + x_2) > (18.0 + x_3)? (5.0 + x_2) : (18.0 + x_3))? (5.0 + x_0) : ((5.0 + x_2) > (18.0 + x_3)? (5.0 + x_2) : (18.0 + x_3))) > ((17.0 + x_4) > ((9.0 + x_6) > (4.0 + x_8)? (9.0 + x_6) : (4.0 + x_8))? (17.0 + x_4) : ((9.0 + x_6) > (4.0 + x_8)? (9.0 + x_6) : (4.0 + x_8)))? ((5.0 + x_0) > ((5.0 + x_2) > (18.0 + x_3)? (5.0 + x_2) : (18.0 + x_3))? (5.0 + x_0) : ((5.0 + x_2) > (18.0 + x_3)? (5.0 + x_2) : (18.0 + x_3))) : ((17.0 + x_4) > ((9.0 + x_6) > (4.0 + x_8)? (9.0 + x_6) : (4.0 + x_8))? (17.0 + x_4) : ((9.0 + x_6) > (4.0 + x_8)? (9.0 + x_6) : (4.0 + x_8)))) : (((11.0 + x_11) > ((1.0 + x_18) > (7.0 + x_19)? (1.0 + x_18) : (7.0 + x_19))? (11.0 + x_11) : ((1.0 + x_18) > (7.0 + x_19)? (1.0 + x_18) : (7.0 + x_19))) > ((4.0 + x_21) > ((17.0 + x_22) > (8.0 + x_23)? (17.0 + x_22) : (8.0 + x_23))? (4.0 + x_21) : ((17.0 + x_22) > (8.0 + x_23)? (17.0 + x_22) : (8.0 + x_23)))? ((11.0 + x_11) > ((1.0 + x_18) > (7.0 + x_19)? (1.0 + x_18) : (7.0 + x_19))? (11.0 + x_11) : ((1.0 + x_18) > (7.0 + x_19)? (1.0 + x_18) : (7.0 + x_19))) : ((4.0 + x_21) > ((17.0 + x_22) > (8.0 + x_23)? (17.0 + x_22) : (8.0 + x_23))? (4.0 + x_21) : ((17.0 + x_22) > (8.0 + x_23)? (17.0 + x_22) : (8.0 + x_23)))));
x_4_ = ((((3.0 + x_0) > ((5.0 + x_4) > (5.0 + x_6)? (5.0 + x_4) : (5.0 + x_6))? (3.0 + x_0) : ((5.0 + x_4) > (5.0 + x_6)? (5.0 + x_4) : (5.0 + x_6))) > ((11.0 + x_7) > ((17.0 + x_9) > (4.0 + x_10)? (17.0 + x_9) : (4.0 + x_10))? (11.0 + x_7) : ((17.0 + x_9) > (4.0 + x_10)? (17.0 + x_9) : (4.0 + x_10)))? ((3.0 + x_0) > ((5.0 + x_4) > (5.0 + x_6)? (5.0 + x_4) : (5.0 + x_6))? (3.0 + x_0) : ((5.0 + x_4) > (5.0 + x_6)? (5.0 + x_4) : (5.0 + x_6))) : ((11.0 + x_7) > ((17.0 + x_9) > (4.0 + x_10)? (17.0 + x_9) : (4.0 + x_10))? (11.0 + x_7) : ((17.0 + x_9) > (4.0 + x_10)? (17.0 + x_9) : (4.0 + x_10)))) > (((15.0 + x_12) > ((16.0 + x_14) > (16.0 + x_16)? (16.0 + x_14) : (16.0 + x_16))? (15.0 + x_12) : ((16.0 + x_14) > (16.0 + x_16)? (16.0 + x_14) : (16.0 + x_16))) > ((18.0 + x_20) > ((15.0 + x_22) > (18.0 + x_23)? (15.0 + x_22) : (18.0 + x_23))? (18.0 + x_20) : ((15.0 + x_22) > (18.0 + x_23)? (15.0 + x_22) : (18.0 + x_23)))? ((15.0 + x_12) > ((16.0 + x_14) > (16.0 + x_16)? (16.0 + x_14) : (16.0 + x_16))? (15.0 + x_12) : ((16.0 + x_14) > (16.0 + x_16)? (16.0 + x_14) : (16.0 + x_16))) : ((18.0 + x_20) > ((15.0 + x_22) > (18.0 + x_23)? (15.0 + x_22) : (18.0 + x_23))? (18.0 + x_20) : ((15.0 + x_22) > (18.0 + x_23)? (15.0 + x_22) : (18.0 + x_23))))? (((3.0 + x_0) > ((5.0 + x_4) > (5.0 + x_6)? (5.0 + x_4) : (5.0 + x_6))? (3.0 + x_0) : ((5.0 + x_4) > (5.0 + x_6)? (5.0 + x_4) : (5.0 + x_6))) > ((11.0 + x_7) > ((17.0 + x_9) > (4.0 + x_10)? (17.0 + x_9) : (4.0 + x_10))? (11.0 + x_7) : ((17.0 + x_9) > (4.0 + x_10)? (17.0 + x_9) : (4.0 + x_10)))? ((3.0 + x_0) > ((5.0 + x_4) > (5.0 + x_6)? (5.0 + x_4) : (5.0 + x_6))? (3.0 + x_0) : ((5.0 + x_4) > (5.0 + x_6)? (5.0 + x_4) : (5.0 + x_6))) : ((11.0 + x_7) > ((17.0 + x_9) > (4.0 + x_10)? (17.0 + x_9) : (4.0 + x_10))? (11.0 + x_7) : ((17.0 + x_9) > (4.0 + x_10)? (17.0 + x_9) : (4.0 + x_10)))) : (((15.0 + x_12) > ((16.0 + x_14) > (16.0 + x_16)? (16.0 + x_14) : (16.0 + x_16))? (15.0 + x_12) : ((16.0 + x_14) > (16.0 + x_16)? (16.0 + x_14) : (16.0 + x_16))) > ((18.0 + x_20) > ((15.0 + x_22) > (18.0 + x_23)? (15.0 + x_22) : (18.0 + x_23))? (18.0 + x_20) : ((15.0 + x_22) > (18.0 + x_23)? (15.0 + x_22) : (18.0 + x_23)))? ((15.0 + x_12) > ((16.0 + x_14) > (16.0 + x_16)? (16.0 + x_14) : (16.0 + x_16))? (15.0 + x_12) : ((16.0 + x_14) > (16.0 + x_16)? (16.0 + x_14) : (16.0 + x_16))) : ((18.0 + x_20) > ((15.0 + x_22) > (18.0 + x_23)? (15.0 + x_22) : (18.0 + x_23))? (18.0 + x_20) : ((15.0 + x_22) > (18.0 + x_23)? (15.0 + x_22) : (18.0 + x_23)))));
x_5_ = ((((19.0 + x_2) > ((13.0 + x_3) > (10.0 + x_4)? (13.0 + x_3) : (10.0 + x_4))? (19.0 + x_2) : ((13.0 + x_3) > (10.0 + x_4)? (13.0 + x_3) : (10.0 + x_4))) > ((18.0 + x_5) > ((2.0 + x_6) > (6.0 + x_7)? (2.0 + x_6) : (6.0 + x_7))? (18.0 + x_5) : ((2.0 + x_6) > (6.0 + x_7)? (2.0 + x_6) : (6.0 + x_7)))? ((19.0 + x_2) > ((13.0 + x_3) > (10.0 + x_4)? (13.0 + x_3) : (10.0 + x_4))? (19.0 + x_2) : ((13.0 + x_3) > (10.0 + x_4)? (13.0 + x_3) : (10.0 + x_4))) : ((18.0 + x_5) > ((2.0 + x_6) > (6.0 + x_7)? (2.0 + x_6) : (6.0 + x_7))? (18.0 + x_5) : ((2.0 + x_6) > (6.0 + x_7)? (2.0 + x_6) : (6.0 + x_7)))) > (((1.0 + x_10) > ((3.0 + x_13) > (14.0 + x_18)? (3.0 + x_13) : (14.0 + x_18))? (1.0 + x_10) : ((3.0 + x_13) > (14.0 + x_18)? (3.0 + x_13) : (14.0 + x_18))) > ((13.0 + x_19) > ((14.0 + x_21) > (20.0 + x_22)? (14.0 + x_21) : (20.0 + x_22))? (13.0 + x_19) : ((14.0 + x_21) > (20.0 + x_22)? (14.0 + x_21) : (20.0 + x_22)))? ((1.0 + x_10) > ((3.0 + x_13) > (14.0 + x_18)? (3.0 + x_13) : (14.0 + x_18))? (1.0 + x_10) : ((3.0 + x_13) > (14.0 + x_18)? (3.0 + x_13) : (14.0 + x_18))) : ((13.0 + x_19) > ((14.0 + x_21) > (20.0 + x_22)? (14.0 + x_21) : (20.0 + x_22))? (13.0 + x_19) : ((14.0 + x_21) > (20.0 + x_22)? (14.0 + x_21) : (20.0 + x_22))))? (((19.0 + x_2) > ((13.0 + x_3) > (10.0 + x_4)? (13.0 + x_3) : (10.0 + x_4))? (19.0 + x_2) : ((13.0 + x_3) > (10.0 + x_4)? (13.0 + x_3) : (10.0 + x_4))) > ((18.0 + x_5) > ((2.0 + x_6) > (6.0 + x_7)? (2.0 + x_6) : (6.0 + x_7))? (18.0 + x_5) : ((2.0 + x_6) > (6.0 + x_7)? (2.0 + x_6) : (6.0 + x_7)))? ((19.0 + x_2) > ((13.0 + x_3) > (10.0 + x_4)? (13.0 + x_3) : (10.0 + x_4))? (19.0 + x_2) : ((13.0 + x_3) > (10.0 + x_4)? (13.0 + x_3) : (10.0 + x_4))) : ((18.0 + x_5) > ((2.0 + x_6) > (6.0 + x_7)? (2.0 + x_6) : (6.0 + x_7))? (18.0 + x_5) : ((2.0 + x_6) > (6.0 + x_7)? (2.0 + x_6) : (6.0 + x_7)))) : (((1.0 + x_10) > ((3.0 + x_13) > (14.0 + x_18)? (3.0 + x_13) : (14.0 + x_18))? (1.0 + x_10) : ((3.0 + x_13) > (14.0 + x_18)? (3.0 + x_13) : (14.0 + x_18))) > ((13.0 + x_19) > ((14.0 + x_21) > (20.0 + x_22)? (14.0 + x_21) : (20.0 + x_22))? (13.0 + x_19) : ((14.0 + x_21) > (20.0 + x_22)? (14.0 + x_21) : (20.0 + x_22)))? ((1.0 + x_10) > ((3.0 + x_13) > (14.0 + x_18)? (3.0 + x_13) : (14.0 + x_18))? (1.0 + x_10) : ((3.0 + x_13) > (14.0 + x_18)? (3.0 + x_13) : (14.0 + x_18))) : ((13.0 + x_19) > ((14.0 + x_21) > (20.0 + x_22)? (14.0 + x_21) : (20.0 + x_22))? (13.0 + x_19) : ((14.0 + x_21) > (20.0 + x_22)? (14.0 + x_21) : (20.0 + x_22)))));
x_6_ = ((((19.0 + x_0) > ((10.0 + x_2) > (17.0 + x_3)? (10.0 + x_2) : (17.0 + x_3))? (19.0 + x_0) : ((10.0 + x_2) > (17.0 + x_3)? (10.0 + x_2) : (17.0 + x_3))) > ((1.0 + x_5) > ((15.0 + x_6) > (6.0 + x_8)? (15.0 + x_6) : (6.0 + x_8))? (1.0 + x_5) : ((15.0 + x_6) > (6.0 + x_8)? (15.0 + x_6) : (6.0 + x_8)))? ((19.0 + x_0) > ((10.0 + x_2) > (17.0 + x_3)? (10.0 + x_2) : (17.0 + x_3))? (19.0 + x_0) : ((10.0 + x_2) > (17.0 + x_3)? (10.0 + x_2) : (17.0 + x_3))) : ((1.0 + x_5) > ((15.0 + x_6) > (6.0 + x_8)? (15.0 + x_6) : (6.0 + x_8))? (1.0 + x_5) : ((15.0 + x_6) > (6.0 + x_8)? (15.0 + x_6) : (6.0 + x_8)))) > (((8.0 + x_9) > ((18.0 + x_10) > (18.0 + x_11)? (18.0 + x_10) : (18.0 + x_11))? (8.0 + x_9) : ((18.0 + x_10) > (18.0 + x_11)? (18.0 + x_10) : (18.0 + x_11))) > ((19.0 + x_12) > ((4.0 + x_17) > (11.0 + x_21)? (4.0 + x_17) : (11.0 + x_21))? (19.0 + x_12) : ((4.0 + x_17) > (11.0 + x_21)? (4.0 + x_17) : (11.0 + x_21)))? ((8.0 + x_9) > ((18.0 + x_10) > (18.0 + x_11)? (18.0 + x_10) : (18.0 + x_11))? (8.0 + x_9) : ((18.0 + x_10) > (18.0 + x_11)? (18.0 + x_10) : (18.0 + x_11))) : ((19.0 + x_12) > ((4.0 + x_17) > (11.0 + x_21)? (4.0 + x_17) : (11.0 + x_21))? (19.0 + x_12) : ((4.0 + x_17) > (11.0 + x_21)? (4.0 + x_17) : (11.0 + x_21))))? (((19.0 + x_0) > ((10.0 + x_2) > (17.0 + x_3)? (10.0 + x_2) : (17.0 + x_3))? (19.0 + x_0) : ((10.0 + x_2) > (17.0 + x_3)? (10.0 + x_2) : (17.0 + x_3))) > ((1.0 + x_5) > ((15.0 + x_6) > (6.0 + x_8)? (15.0 + x_6) : (6.0 + x_8))? (1.0 + x_5) : ((15.0 + x_6) > (6.0 + x_8)? (15.0 + x_6) : (6.0 + x_8)))? ((19.0 + x_0) > ((10.0 + x_2) > (17.0 + x_3)? (10.0 + x_2) : (17.0 + x_3))? (19.0 + x_0) : ((10.0 + x_2) > (17.0 + x_3)? (10.0 + x_2) : (17.0 + x_3))) : ((1.0 + x_5) > ((15.0 + x_6) > (6.0 + x_8)? (15.0 + x_6) : (6.0 + x_8))? (1.0 + x_5) : ((15.0 + x_6) > (6.0 + x_8)? (15.0 + x_6) : (6.0 + x_8)))) : (((8.0 + x_9) > ((18.0 + x_10) > (18.0 + x_11)? (18.0 + x_10) : (18.0 + x_11))? (8.0 + x_9) : ((18.0 + x_10) > (18.0 + x_11)? (18.0 + x_10) : (18.0 + x_11))) > ((19.0 + x_12) > ((4.0 + x_17) > (11.0 + x_21)? (4.0 + x_17) : (11.0 + x_21))? (19.0 + x_12) : ((4.0 + x_17) > (11.0 + x_21)? (4.0 + x_17) : (11.0 + x_21)))? ((8.0 + x_9) > ((18.0 + x_10) > (18.0 + x_11)? (18.0 + x_10) : (18.0 + x_11))? (8.0 + x_9) : ((18.0 + x_10) > (18.0 + x_11)? (18.0 + x_10) : (18.0 + x_11))) : ((19.0 + x_12) > ((4.0 + x_17) > (11.0 + x_21)? (4.0 + x_17) : (11.0 + x_21))? (19.0 + x_12) : ((4.0 + x_17) > (11.0 + x_21)? (4.0 + x_17) : (11.0 + x_21)))));
x_7_ = ((((4.0 + x_0) > ((4.0 + x_1) > (19.0 + x_5)? (4.0 + x_1) : (19.0 + x_5))? (4.0 + x_0) : ((4.0 + x_1) > (19.0 + x_5)? (4.0 + x_1) : (19.0 + x_5))) > ((4.0 + x_7) > ((16.0 + x_8) > (9.0 + x_11)? (16.0 + x_8) : (9.0 + x_11))? (4.0 + x_7) : ((16.0 + x_8) > (9.0 + x_11)? (16.0 + x_8) : (9.0 + x_11)))? ((4.0 + x_0) > ((4.0 + x_1) > (19.0 + x_5)? (4.0 + x_1) : (19.0 + x_5))? (4.0 + x_0) : ((4.0 + x_1) > (19.0 + x_5)? (4.0 + x_1) : (19.0 + x_5))) : ((4.0 + x_7) > ((16.0 + x_8) > (9.0 + x_11)? (16.0 + x_8) : (9.0 + x_11))? (4.0 + x_7) : ((16.0 + x_8) > (9.0 + x_11)? (16.0 + x_8) : (9.0 + x_11)))) > (((19.0 + x_13) > ((7.0 + x_17) > (7.0 + x_19)? (7.0 + x_17) : (7.0 + x_19))? (19.0 + x_13) : ((7.0 + x_17) > (7.0 + x_19)? (7.0 + x_17) : (7.0 + x_19))) > ((14.0 + x_20) > ((10.0 + x_21) > (10.0 + x_23)? (10.0 + x_21) : (10.0 + x_23))? (14.0 + x_20) : ((10.0 + x_21) > (10.0 + x_23)? (10.0 + x_21) : (10.0 + x_23)))? ((19.0 + x_13) > ((7.0 + x_17) > (7.0 + x_19)? (7.0 + x_17) : (7.0 + x_19))? (19.0 + x_13) : ((7.0 + x_17) > (7.0 + x_19)? (7.0 + x_17) : (7.0 + x_19))) : ((14.0 + x_20) > ((10.0 + x_21) > (10.0 + x_23)? (10.0 + x_21) : (10.0 + x_23))? (14.0 + x_20) : ((10.0 + x_21) > (10.0 + x_23)? (10.0 + x_21) : (10.0 + x_23))))? (((4.0 + x_0) > ((4.0 + x_1) > (19.0 + x_5)? (4.0 + x_1) : (19.0 + x_5))? (4.0 + x_0) : ((4.0 + x_1) > (19.0 + x_5)? (4.0 + x_1) : (19.0 + x_5))) > ((4.0 + x_7) > ((16.0 + x_8) > (9.0 + x_11)? (16.0 + x_8) : (9.0 + x_11))? (4.0 + x_7) : ((16.0 + x_8) > (9.0 + x_11)? (16.0 + x_8) : (9.0 + x_11)))? ((4.0 + x_0) > ((4.0 + x_1) > (19.0 + x_5)? (4.0 + x_1) : (19.0 + x_5))? (4.0 + x_0) : ((4.0 + x_1) > (19.0 + x_5)? (4.0 + x_1) : (19.0 + x_5))) : ((4.0 + x_7) > ((16.0 + x_8) > (9.0 + x_11)? (16.0 + x_8) : (9.0 + x_11))? (4.0 + x_7) : ((16.0 + x_8) > (9.0 + x_11)? (16.0 + x_8) : (9.0 + x_11)))) : (((19.0 + x_13) > ((7.0 + x_17) > (7.0 + x_19)? (7.0 + x_17) : (7.0 + x_19))? (19.0 + x_13) : ((7.0 + x_17) > (7.0 + x_19)? (7.0 + x_17) : (7.0 + x_19))) > ((14.0 + x_20) > ((10.0 + x_21) > (10.0 + x_23)? (10.0 + x_21) : (10.0 + x_23))? (14.0 + x_20) : ((10.0 + x_21) > (10.0 + x_23)? (10.0 + x_21) : (10.0 + x_23)))? ((19.0 + x_13) > ((7.0 + x_17) > (7.0 + x_19)? (7.0 + x_17) : (7.0 + x_19))? (19.0 + x_13) : ((7.0 + x_17) > (7.0 + x_19)? (7.0 + x_17) : (7.0 + x_19))) : ((14.0 + x_20) > ((10.0 + x_21) > (10.0 + x_23)? (10.0 + x_21) : (10.0 + x_23))? (14.0 + x_20) : ((10.0 + x_21) > (10.0 + x_23)? (10.0 + x_21) : (10.0 + x_23)))));
x_8_ = ((((11.0 + x_0) > ((3.0 + x_1) > (17.0 + x_2)? (3.0 + x_1) : (17.0 + x_2))? (11.0 + x_0) : ((3.0 + x_1) > (17.0 + x_2)? (3.0 + x_1) : (17.0 + x_2))) > ((1.0 + x_5) > ((6.0 + x_6) > (2.0 + x_8)? (6.0 + x_6) : (2.0 + x_8))? (1.0 + x_5) : ((6.0 + x_6) > (2.0 + x_8)? (6.0 + x_6) : (2.0 + x_8)))? ((11.0 + x_0) > ((3.0 + x_1) > (17.0 + x_2)? (3.0 + x_1) : (17.0 + x_2))? (11.0 + x_0) : ((3.0 + x_1) > (17.0 + x_2)? (3.0 + x_1) : (17.0 + x_2))) : ((1.0 + x_5) > ((6.0 + x_6) > (2.0 + x_8)? (6.0 + x_6) : (2.0 + x_8))? (1.0 + x_5) : ((6.0 + x_6) > (2.0 + x_8)? (6.0 + x_6) : (2.0 + x_8)))) > (((16.0 + x_9) > ((14.0 + x_10) > (15.0 + x_15)? (14.0 + x_10) : (15.0 + x_15))? (16.0 + x_9) : ((14.0 + x_10) > (15.0 + x_15)? (14.0 + x_10) : (15.0 + x_15))) > ((2.0 + x_16) > ((9.0 + x_22) > (14.0 + x_23)? (9.0 + x_22) : (14.0 + x_23))? (2.0 + x_16) : ((9.0 + x_22) > (14.0 + x_23)? (9.0 + x_22) : (14.0 + x_23)))? ((16.0 + x_9) > ((14.0 + x_10) > (15.0 + x_15)? (14.0 + x_10) : (15.0 + x_15))? (16.0 + x_9) : ((14.0 + x_10) > (15.0 + x_15)? (14.0 + x_10) : (15.0 + x_15))) : ((2.0 + x_16) > ((9.0 + x_22) > (14.0 + x_23)? (9.0 + x_22) : (14.0 + x_23))? (2.0 + x_16) : ((9.0 + x_22) > (14.0 + x_23)? (9.0 + x_22) : (14.0 + x_23))))? (((11.0 + x_0) > ((3.0 + x_1) > (17.0 + x_2)? (3.0 + x_1) : (17.0 + x_2))? (11.0 + x_0) : ((3.0 + x_1) > (17.0 + x_2)? (3.0 + x_1) : (17.0 + x_2))) > ((1.0 + x_5) > ((6.0 + x_6) > (2.0 + x_8)? (6.0 + x_6) : (2.0 + x_8))? (1.0 + x_5) : ((6.0 + x_6) > (2.0 + x_8)? (6.0 + x_6) : (2.0 + x_8)))? ((11.0 + x_0) > ((3.0 + x_1) > (17.0 + x_2)? (3.0 + x_1) : (17.0 + x_2))? (11.0 + x_0) : ((3.0 + x_1) > (17.0 + x_2)? (3.0 + x_1) : (17.0 + x_2))) : ((1.0 + x_5) > ((6.0 + x_6) > (2.0 + x_8)? (6.0 + x_6) : (2.0 + x_8))? (1.0 + x_5) : ((6.0 + x_6) > (2.0 + x_8)? (6.0 + x_6) : (2.0 + x_8)))) : (((16.0 + x_9) > ((14.0 + x_10) > (15.0 + x_15)? (14.0 + x_10) : (15.0 + x_15))? (16.0 + x_9) : ((14.0 + x_10) > (15.0 + x_15)? (14.0 + x_10) : (15.0 + x_15))) > ((2.0 + x_16) > ((9.0 + x_22) > (14.0 + x_23)? (9.0 + x_22) : (14.0 + x_23))? (2.0 + x_16) : ((9.0 + x_22) > (14.0 + x_23)? (9.0 + x_22) : (14.0 + x_23)))? ((16.0 + x_9) > ((14.0 + x_10) > (15.0 + x_15)? (14.0 + x_10) : (15.0 + x_15))? (16.0 + x_9) : ((14.0 + x_10) > (15.0 + x_15)? (14.0 + x_10) : (15.0 + x_15))) : ((2.0 + x_16) > ((9.0 + x_22) > (14.0 + x_23)? (9.0 + x_22) : (14.0 + x_23))? (2.0 + x_16) : ((9.0 + x_22) > (14.0 + x_23)? (9.0 + x_22) : (14.0 + x_23)))));
x_9_ = ((((6.0 + x_0) > ((13.0 + x_1) > (6.0 + x_5)? (13.0 + x_1) : (6.0 + x_5))? (6.0 + x_0) : ((13.0 + x_1) > (6.0 + x_5)? (13.0 + x_1) : (6.0 + x_5))) > ((4.0 + x_6) > ((2.0 + x_7) > (17.0 + x_8)? (2.0 + x_7) : (17.0 + x_8))? (4.0 + x_6) : ((2.0 + x_7) > (17.0 + x_8)? (2.0 + x_7) : (17.0 + x_8)))? ((6.0 + x_0) > ((13.0 + x_1) > (6.0 + x_5)? (13.0 + x_1) : (6.0 + x_5))? (6.0 + x_0) : ((13.0 + x_1) > (6.0 + x_5)? (13.0 + x_1) : (6.0 + x_5))) : ((4.0 + x_6) > ((2.0 + x_7) > (17.0 + x_8)? (2.0 + x_7) : (17.0 + x_8))? (4.0 + x_6) : ((2.0 + x_7) > (17.0 + x_8)? (2.0 + x_7) : (17.0 + x_8)))) > (((11.0 + x_9) > ((18.0 + x_12) > (11.0 + x_16)? (18.0 + x_12) : (11.0 + x_16))? (11.0 + x_9) : ((18.0 + x_12) > (11.0 + x_16)? (18.0 + x_12) : (11.0 + x_16))) > ((15.0 + x_20) > ((14.0 + x_21) > (5.0 + x_22)? (14.0 + x_21) : (5.0 + x_22))? (15.0 + x_20) : ((14.0 + x_21) > (5.0 + x_22)? (14.0 + x_21) : (5.0 + x_22)))? ((11.0 + x_9) > ((18.0 + x_12) > (11.0 + x_16)? (18.0 + x_12) : (11.0 + x_16))? (11.0 + x_9) : ((18.0 + x_12) > (11.0 + x_16)? (18.0 + x_12) : (11.0 + x_16))) : ((15.0 + x_20) > ((14.0 + x_21) > (5.0 + x_22)? (14.0 + x_21) : (5.0 + x_22))? (15.0 + x_20) : ((14.0 + x_21) > (5.0 + x_22)? (14.0 + x_21) : (5.0 + x_22))))? (((6.0 + x_0) > ((13.0 + x_1) > (6.0 + x_5)? (13.0 + x_1) : (6.0 + x_5))? (6.0 + x_0) : ((13.0 + x_1) > (6.0 + x_5)? (13.0 + x_1) : (6.0 + x_5))) > ((4.0 + x_6) > ((2.0 + x_7) > (17.0 + x_8)? (2.0 + x_7) : (17.0 + x_8))? (4.0 + x_6) : ((2.0 + x_7) > (17.0 + x_8)? (2.0 + x_7) : (17.0 + x_8)))? ((6.0 + x_0) > ((13.0 + x_1) > (6.0 + x_5)? (13.0 + x_1) : (6.0 + x_5))? (6.0 + x_0) : ((13.0 + x_1) > (6.0 + x_5)? (13.0 + x_1) : (6.0 + x_5))) : ((4.0 + x_6) > ((2.0 + x_7) > (17.0 + x_8)? (2.0 + x_7) : (17.0 + x_8))? (4.0 + x_6) : ((2.0 + x_7) > (17.0 + x_8)? (2.0 + x_7) : (17.0 + x_8)))) : (((11.0 + x_9) > ((18.0 + x_12) > (11.0 + x_16)? (18.0 + x_12) : (11.0 + x_16))? (11.0 + x_9) : ((18.0 + x_12) > (11.0 + x_16)? (18.0 + x_12) : (11.0 + x_16))) > ((15.0 + x_20) > ((14.0 + x_21) > (5.0 + x_22)? (14.0 + x_21) : (5.0 + x_22))? (15.0 + x_20) : ((14.0 + x_21) > (5.0 + x_22)? (14.0 + x_21) : (5.0 + x_22)))? ((11.0 + x_9) > ((18.0 + x_12) > (11.0 + x_16)? (18.0 + x_12) : (11.0 + x_16))? (11.0 + x_9) : ((18.0 + x_12) > (11.0 + x_16)? (18.0 + x_12) : (11.0 + x_16))) : ((15.0 + x_20) > ((14.0 + x_21) > (5.0 + x_22)? (14.0 + x_21) : (5.0 + x_22))? (15.0 + x_20) : ((14.0 + x_21) > (5.0 + x_22)? (14.0 + x_21) : (5.0 + x_22)))));
x_10_ = ((((9.0 + x_1) > ((20.0 + x_3) > (16.0 + x_8)? (20.0 + x_3) : (16.0 + x_8))? (9.0 + x_1) : ((20.0 + x_3) > (16.0 + x_8)? (20.0 + x_3) : (16.0 + x_8))) > ((2.0 + x_9) > ((16.0 + x_10) > (14.0 + x_11)? (16.0 + x_10) : (14.0 + x_11))? (2.0 + x_9) : ((16.0 + x_10) > (14.0 + x_11)? (16.0 + x_10) : (14.0 + x_11)))? ((9.0 + x_1) > ((20.0 + x_3) > (16.0 + x_8)? (20.0 + x_3) : (16.0 + x_8))? (9.0 + x_1) : ((20.0 + x_3) > (16.0 + x_8)? (20.0 + x_3) : (16.0 + x_8))) : ((2.0 + x_9) > ((16.0 + x_10) > (14.0 + x_11)? (16.0 + x_10) : (14.0 + x_11))? (2.0 + x_9) : ((16.0 + x_10) > (14.0 + x_11)? (16.0 + x_10) : (14.0 + x_11)))) > (((9.0 + x_12) > ((19.0 + x_16) > (7.0 + x_18)? (19.0 + x_16) : (7.0 + x_18))? (9.0 + x_12) : ((19.0 + x_16) > (7.0 + x_18)? (19.0 + x_16) : (7.0 + x_18))) > ((15.0 + x_19) > ((5.0 + x_21) > (8.0 + x_22)? (5.0 + x_21) : (8.0 + x_22))? (15.0 + x_19) : ((5.0 + x_21) > (8.0 + x_22)? (5.0 + x_21) : (8.0 + x_22)))? ((9.0 + x_12) > ((19.0 + x_16) > (7.0 + x_18)? (19.0 + x_16) : (7.0 + x_18))? (9.0 + x_12) : ((19.0 + x_16) > (7.0 + x_18)? (19.0 + x_16) : (7.0 + x_18))) : ((15.0 + x_19) > ((5.0 + x_21) > (8.0 + x_22)? (5.0 + x_21) : (8.0 + x_22))? (15.0 + x_19) : ((5.0 + x_21) > (8.0 + x_22)? (5.0 + x_21) : (8.0 + x_22))))? (((9.0 + x_1) > ((20.0 + x_3) > (16.0 + x_8)? (20.0 + x_3) : (16.0 + x_8))? (9.0 + x_1) : ((20.0 + x_3) > (16.0 + x_8)? (20.0 + x_3) : (16.0 + x_8))) > ((2.0 + x_9) > ((16.0 + x_10) > (14.0 + x_11)? (16.0 + x_10) : (14.0 + x_11))? (2.0 + x_9) : ((16.0 + x_10) > (14.0 + x_11)? (16.0 + x_10) : (14.0 + x_11)))? ((9.0 + x_1) > ((20.0 + x_3) > (16.0 + x_8)? (20.0 + x_3) : (16.0 + x_8))? (9.0 + x_1) : ((20.0 + x_3) > (16.0 + x_8)? (20.0 + x_3) : (16.0 + x_8))) : ((2.0 + x_9) > ((16.0 + x_10) > (14.0 + x_11)? (16.0 + x_10) : (14.0 + x_11))? (2.0 + x_9) : ((16.0 + x_10) > (14.0 + x_11)? (16.0 + x_10) : (14.0 + x_11)))) : (((9.0 + x_12) > ((19.0 + x_16) > (7.0 + x_18)? (19.0 + x_16) : (7.0 + x_18))? (9.0 + x_12) : ((19.0 + x_16) > (7.0 + x_18)? (19.0 + x_16) : (7.0 + x_18))) > ((15.0 + x_19) > ((5.0 + x_21) > (8.0 + x_22)? (5.0 + x_21) : (8.0 + x_22))? (15.0 + x_19) : ((5.0 + x_21) > (8.0 + x_22)? (5.0 + x_21) : (8.0 + x_22)))? ((9.0 + x_12) > ((19.0 + x_16) > (7.0 + x_18)? (19.0 + x_16) : (7.0 + x_18))? (9.0 + x_12) : ((19.0 + x_16) > (7.0 + x_18)? (19.0 + x_16) : (7.0 + x_18))) : ((15.0 + x_19) > ((5.0 + x_21) > (8.0 + x_22)? (5.0 + x_21) : (8.0 + x_22))? (15.0 + x_19) : ((5.0 + x_21) > (8.0 + x_22)? (5.0 + x_21) : (8.0 + x_22)))));
x_11_ = ((((13.0 + x_0) > ((4.0 + x_3) > (7.0 + x_5)? (4.0 + x_3) : (7.0 + x_5))? (13.0 + x_0) : ((4.0 + x_3) > (7.0 + x_5)? (4.0 + x_3) : (7.0 + x_5))) > ((18.0 + x_6) > ((13.0 + x_7) > (20.0 + x_8)? (13.0 + x_7) : (20.0 + x_8))? (18.0 + x_6) : ((13.0 + x_7) > (20.0 + x_8)? (13.0 + x_7) : (20.0 + x_8)))? ((13.0 + x_0) > ((4.0 + x_3) > (7.0 + x_5)? (4.0 + x_3) : (7.0 + x_5))? (13.0 + x_0) : ((4.0 + x_3) > (7.0 + x_5)? (4.0 + x_3) : (7.0 + x_5))) : ((18.0 + x_6) > ((13.0 + x_7) > (20.0 + x_8)? (13.0 + x_7) : (20.0 + x_8))? (18.0 + x_6) : ((13.0 + x_7) > (20.0 + x_8)? (13.0 + x_7) : (20.0 + x_8)))) > (((18.0 + x_10) > ((3.0 + x_16) > (5.0 + x_17)? (3.0 + x_16) : (5.0 + x_17))? (18.0 + x_10) : ((3.0 + x_16) > (5.0 + x_17)? (3.0 + x_16) : (5.0 + x_17))) > ((18.0 + x_18) > ((17.0 + x_20) > (20.0 + x_21)? (17.0 + x_20) : (20.0 + x_21))? (18.0 + x_18) : ((17.0 + x_20) > (20.0 + x_21)? (17.0 + x_20) : (20.0 + x_21)))? ((18.0 + x_10) > ((3.0 + x_16) > (5.0 + x_17)? (3.0 + x_16) : (5.0 + x_17))? (18.0 + x_10) : ((3.0 + x_16) > (5.0 + x_17)? (3.0 + x_16) : (5.0 + x_17))) : ((18.0 + x_18) > ((17.0 + x_20) > (20.0 + x_21)? (17.0 + x_20) : (20.0 + x_21))? (18.0 + x_18) : ((17.0 + x_20) > (20.0 + x_21)? (17.0 + x_20) : (20.0 + x_21))))? (((13.0 + x_0) > ((4.0 + x_3) > (7.0 + x_5)? (4.0 + x_3) : (7.0 + x_5))? (13.0 + x_0) : ((4.0 + x_3) > (7.0 + x_5)? (4.0 + x_3) : (7.0 + x_5))) > ((18.0 + x_6) > ((13.0 + x_7) > (20.0 + x_8)? (13.0 + x_7) : (20.0 + x_8))? (18.0 + x_6) : ((13.0 + x_7) > (20.0 + x_8)? (13.0 + x_7) : (20.0 + x_8)))? ((13.0 + x_0) > ((4.0 + x_3) > (7.0 + x_5)? (4.0 + x_3) : (7.0 + x_5))? (13.0 + x_0) : ((4.0 + x_3) > (7.0 + x_5)? (4.0 + x_3) : (7.0 + x_5))) : ((18.0 + x_6) > ((13.0 + x_7) > (20.0 + x_8)? (13.0 + x_7) : (20.0 + x_8))? (18.0 + x_6) : ((13.0 + x_7) > (20.0 + x_8)? (13.0 + x_7) : (20.0 + x_8)))) : (((18.0 + x_10) > ((3.0 + x_16) > (5.0 + x_17)? (3.0 + x_16) : (5.0 + x_17))? (18.0 + x_10) : ((3.0 + x_16) > (5.0 + x_17)? (3.0 + x_16) : (5.0 + x_17))) > ((18.0 + x_18) > ((17.0 + x_20) > (20.0 + x_21)? (17.0 + x_20) : (20.0 + x_21))? (18.0 + x_18) : ((17.0 + x_20) > (20.0 + x_21)? (17.0 + x_20) : (20.0 + x_21)))? ((18.0 + x_10) > ((3.0 + x_16) > (5.0 + x_17)? (3.0 + x_16) : (5.0 + x_17))? (18.0 + x_10) : ((3.0 + x_16) > (5.0 + x_17)? (3.0 + x_16) : (5.0 + x_17))) : ((18.0 + x_18) > ((17.0 + x_20) > (20.0 + x_21)? (17.0 + x_20) : (20.0 + x_21))? (18.0 + x_18) : ((17.0 + x_20) > (20.0 + x_21)? (17.0 + x_20) : (20.0 + x_21)))));
x_12_ = ((((19.0 + x_1) > ((4.0 + x_3) > (15.0 + x_7)? (4.0 + x_3) : (15.0 + x_7))? (19.0 + x_1) : ((4.0 + x_3) > (15.0 + x_7)? (4.0 + x_3) : (15.0 + x_7))) > ((19.0 + x_9) > ((6.0 + x_10) > (9.0 + x_11)? (6.0 + x_10) : (9.0 + x_11))? (19.0 + x_9) : ((6.0 + x_10) > (9.0 + x_11)? (6.0 + x_10) : (9.0 + x_11)))? ((19.0 + x_1) > ((4.0 + x_3) > (15.0 + x_7)? (4.0 + x_3) : (15.0 + x_7))? (19.0 + x_1) : ((4.0 + x_3) > (15.0 + x_7)? (4.0 + x_3) : (15.0 + x_7))) : ((19.0 + x_9) > ((6.0 + x_10) > (9.0 + x_11)? (6.0 + x_10) : (9.0 + x_11))? (19.0 + x_9) : ((6.0 + x_10) > (9.0 + x_11)? (6.0 + x_10) : (9.0 + x_11)))) > (((16.0 + x_12) > ((17.0 + x_13) > (6.0 + x_15)? (17.0 + x_13) : (6.0 + x_15))? (16.0 + x_12) : ((17.0 + x_13) > (6.0 + x_15)? (17.0 + x_13) : (6.0 + x_15))) > ((6.0 + x_16) > ((6.0 + x_20) > (4.0 + x_22)? (6.0 + x_20) : (4.0 + x_22))? (6.0 + x_16) : ((6.0 + x_20) > (4.0 + x_22)? (6.0 + x_20) : (4.0 + x_22)))? ((16.0 + x_12) > ((17.0 + x_13) > (6.0 + x_15)? (17.0 + x_13) : (6.0 + x_15))? (16.0 + x_12) : ((17.0 + x_13) > (6.0 + x_15)? (17.0 + x_13) : (6.0 + x_15))) : ((6.0 + x_16) > ((6.0 + x_20) > (4.0 + x_22)? (6.0 + x_20) : (4.0 + x_22))? (6.0 + x_16) : ((6.0 + x_20) > (4.0 + x_22)? (6.0 + x_20) : (4.0 + x_22))))? (((19.0 + x_1) > ((4.0 + x_3) > (15.0 + x_7)? (4.0 + x_3) : (15.0 + x_7))? (19.0 + x_1) : ((4.0 + x_3) > (15.0 + x_7)? (4.0 + x_3) : (15.0 + x_7))) > ((19.0 + x_9) > ((6.0 + x_10) > (9.0 + x_11)? (6.0 + x_10) : (9.0 + x_11))? (19.0 + x_9) : ((6.0 + x_10) > (9.0 + x_11)? (6.0 + x_10) : (9.0 + x_11)))? ((19.0 + x_1) > ((4.0 + x_3) > (15.0 + x_7)? (4.0 + x_3) : (15.0 + x_7))? (19.0 + x_1) : ((4.0 + x_3) > (15.0 + x_7)? (4.0 + x_3) : (15.0 + x_7))) : ((19.0 + x_9) > ((6.0 + x_10) > (9.0 + x_11)? (6.0 + x_10) : (9.0 + x_11))? (19.0 + x_9) : ((6.0 + x_10) > (9.0 + x_11)? (6.0 + x_10) : (9.0 + x_11)))) : (((16.0 + x_12) > ((17.0 + x_13) > (6.0 + x_15)? (17.0 + x_13) : (6.0 + x_15))? (16.0 + x_12) : ((17.0 + x_13) > (6.0 + x_15)? (17.0 + x_13) : (6.0 + x_15))) > ((6.0 + x_16) > ((6.0 + x_20) > (4.0 + x_22)? (6.0 + x_20) : (4.0 + x_22))? (6.0 + x_16) : ((6.0 + x_20) > (4.0 + x_22)? (6.0 + x_20) : (4.0 + x_22)))? ((16.0 + x_12) > ((17.0 + x_13) > (6.0 + x_15)? (17.0 + x_13) : (6.0 + x_15))? (16.0 + x_12) : ((17.0 + x_13) > (6.0 + x_15)? (17.0 + x_13) : (6.0 + x_15))) : ((6.0 + x_16) > ((6.0 + x_20) > (4.0 + x_22)? (6.0 + x_20) : (4.0 + x_22))? (6.0 + x_16) : ((6.0 + x_20) > (4.0 + x_22)? (6.0 + x_20) : (4.0 + x_22)))));
x_13_ = ((((13.0 + x_0) > ((11.0 + x_3) > (3.0 + x_6)? (11.0 + x_3) : (3.0 + x_6))? (13.0 + x_0) : ((11.0 + x_3) > (3.0 + x_6)? (11.0 + x_3) : (3.0 + x_6))) > ((5.0 + x_8) > ((4.0 + x_9) > (10.0 + x_10)? (4.0 + x_9) : (10.0 + x_10))? (5.0 + x_8) : ((4.0 + x_9) > (10.0 + x_10)? (4.0 + x_9) : (10.0 + x_10)))? ((13.0 + x_0) > ((11.0 + x_3) > (3.0 + x_6)? (11.0 + x_3) : (3.0 + x_6))? (13.0 + x_0) : ((11.0 + x_3) > (3.0 + x_6)? (11.0 + x_3) : (3.0 + x_6))) : ((5.0 + x_8) > ((4.0 + x_9) > (10.0 + x_10)? (4.0 + x_9) : (10.0 + x_10))? (5.0 + x_8) : ((4.0 + x_9) > (10.0 + x_10)? (4.0 + x_9) : (10.0 + x_10)))) > (((13.0 + x_11) > ((3.0 + x_16) > (20.0 + x_18)? (3.0 + x_16) : (20.0 + x_18))? (13.0 + x_11) : ((3.0 + x_16) > (20.0 + x_18)? (3.0 + x_16) : (20.0 + x_18))) > ((3.0 + x_20) > ((7.0 + x_21) > (6.0 + x_22)? (7.0 + x_21) : (6.0 + x_22))? (3.0 + x_20) : ((7.0 + x_21) > (6.0 + x_22)? (7.0 + x_21) : (6.0 + x_22)))? ((13.0 + x_11) > ((3.0 + x_16) > (20.0 + x_18)? (3.0 + x_16) : (20.0 + x_18))? (13.0 + x_11) : ((3.0 + x_16) > (20.0 + x_18)? (3.0 + x_16) : (20.0 + x_18))) : ((3.0 + x_20) > ((7.0 + x_21) > (6.0 + x_22)? (7.0 + x_21) : (6.0 + x_22))? (3.0 + x_20) : ((7.0 + x_21) > (6.0 + x_22)? (7.0 + x_21) : (6.0 + x_22))))? (((13.0 + x_0) > ((11.0 + x_3) > (3.0 + x_6)? (11.0 + x_3) : (3.0 + x_6))? (13.0 + x_0) : ((11.0 + x_3) > (3.0 + x_6)? (11.0 + x_3) : (3.0 + x_6))) > ((5.0 + x_8) > ((4.0 + x_9) > (10.0 + x_10)? (4.0 + x_9) : (10.0 + x_10))? (5.0 + x_8) : ((4.0 + x_9) > (10.0 + x_10)? (4.0 + x_9) : (10.0 + x_10)))? ((13.0 + x_0) > ((11.0 + x_3) > (3.0 + x_6)? (11.0 + x_3) : (3.0 + x_6))? (13.0 + x_0) : ((11.0 + x_3) > (3.0 + x_6)? (11.0 + x_3) : (3.0 + x_6))) : ((5.0 + x_8) > ((4.0 + x_9) > (10.0 + x_10)? (4.0 + x_9) : (10.0 + x_10))? (5.0 + x_8) : ((4.0 + x_9) > (10.0 + x_10)? (4.0 + x_9) : (10.0 + x_10)))) : (((13.0 + x_11) > ((3.0 + x_16) > (20.0 + x_18)? (3.0 + x_16) : (20.0 + x_18))? (13.0 + x_11) : ((3.0 + x_16) > (20.0 + x_18)? (3.0 + x_16) : (20.0 + x_18))) > ((3.0 + x_20) > ((7.0 + x_21) > (6.0 + x_22)? (7.0 + x_21) : (6.0 + x_22))? (3.0 + x_20) : ((7.0 + x_21) > (6.0 + x_22)? (7.0 + x_21) : (6.0 + x_22)))? ((13.0 + x_11) > ((3.0 + x_16) > (20.0 + x_18)? (3.0 + x_16) : (20.0 + x_18))? (13.0 + x_11) : ((3.0 + x_16) > (20.0 + x_18)? (3.0 + x_16) : (20.0 + x_18))) : ((3.0 + x_20) > ((7.0 + x_21) > (6.0 + x_22)? (7.0 + x_21) : (6.0 + x_22))? (3.0 + x_20) : ((7.0 + x_21) > (6.0 + x_22)? (7.0 + x_21) : (6.0 + x_22)))));
x_14_ = ((((20.0 + x_0) > ((9.0 + x_3) > (7.0 + x_4)? (9.0 + x_3) : (7.0 + x_4))? (20.0 + x_0) : ((9.0 + x_3) > (7.0 + x_4)? (9.0 + x_3) : (7.0 + x_4))) > ((5.0 + x_6) > ((2.0 + x_10) > (16.0 + x_11)? (2.0 + x_10) : (16.0 + x_11))? (5.0 + x_6) : ((2.0 + x_10) > (16.0 + x_11)? (2.0 + x_10) : (16.0 + x_11)))? ((20.0 + x_0) > ((9.0 + x_3) > (7.0 + x_4)? (9.0 + x_3) : (7.0 + x_4))? (20.0 + x_0) : ((9.0 + x_3) > (7.0 + x_4)? (9.0 + x_3) : (7.0 + x_4))) : ((5.0 + x_6) > ((2.0 + x_10) > (16.0 + x_11)? (2.0 + x_10) : (16.0 + x_11))? (5.0 + x_6) : ((2.0 + x_10) > (16.0 + x_11)? (2.0 + x_10) : (16.0 + x_11)))) > (((12.0 + x_13) > ((12.0 + x_15) > (7.0 + x_17)? (12.0 + x_15) : (7.0 + x_17))? (12.0 + x_13) : ((12.0 + x_15) > (7.0 + x_17)? (12.0 + x_15) : (7.0 + x_17))) > ((15.0 + x_18) > ((12.0 + x_19) > (18.0 + x_22)? (12.0 + x_19) : (18.0 + x_22))? (15.0 + x_18) : ((12.0 + x_19) > (18.0 + x_22)? (12.0 + x_19) : (18.0 + x_22)))? ((12.0 + x_13) > ((12.0 + x_15) > (7.0 + x_17)? (12.0 + x_15) : (7.0 + x_17))? (12.0 + x_13) : ((12.0 + x_15) > (7.0 + x_17)? (12.0 + x_15) : (7.0 + x_17))) : ((15.0 + x_18) > ((12.0 + x_19) > (18.0 + x_22)? (12.0 + x_19) : (18.0 + x_22))? (15.0 + x_18) : ((12.0 + x_19) > (18.0 + x_22)? (12.0 + x_19) : (18.0 + x_22))))? (((20.0 + x_0) > ((9.0 + x_3) > (7.0 + x_4)? (9.0 + x_3) : (7.0 + x_4))? (20.0 + x_0) : ((9.0 + x_3) > (7.0 + x_4)? (9.0 + x_3) : (7.0 + x_4))) > ((5.0 + x_6) > ((2.0 + x_10) > (16.0 + x_11)? (2.0 + x_10) : (16.0 + x_11))? (5.0 + x_6) : ((2.0 + x_10) > (16.0 + x_11)? (2.0 + x_10) : (16.0 + x_11)))? ((20.0 + x_0) > ((9.0 + x_3) > (7.0 + x_4)? (9.0 + x_3) : (7.0 + x_4))? (20.0 + x_0) : ((9.0 + x_3) > (7.0 + x_4)? (9.0 + x_3) : (7.0 + x_4))) : ((5.0 + x_6) > ((2.0 + x_10) > (16.0 + x_11)? (2.0 + x_10) : (16.0 + x_11))? (5.0 + x_6) : ((2.0 + x_10) > (16.0 + x_11)? (2.0 + x_10) : (16.0 + x_11)))) : (((12.0 + x_13) > ((12.0 + x_15) > (7.0 + x_17)? (12.0 + x_15) : (7.0 + x_17))? (12.0 + x_13) : ((12.0 + x_15) > (7.0 + x_17)? (12.0 + x_15) : (7.0 + x_17))) > ((15.0 + x_18) > ((12.0 + x_19) > (18.0 + x_22)? (12.0 + x_19) : (18.0 + x_22))? (15.0 + x_18) : ((12.0 + x_19) > (18.0 + x_22)? (12.0 + x_19) : (18.0 + x_22)))? ((12.0 + x_13) > ((12.0 + x_15) > (7.0 + x_17)? (12.0 + x_15) : (7.0 + x_17))? (12.0 + x_13) : ((12.0 + x_15) > (7.0 + x_17)? (12.0 + x_15) : (7.0 + x_17))) : ((15.0 + x_18) > ((12.0 + x_19) > (18.0 + x_22)? (12.0 + x_19) : (18.0 + x_22))? (15.0 + x_18) : ((12.0 + x_19) > (18.0 + x_22)? (12.0 + x_19) : (18.0 + x_22)))));
x_15_ = ((((18.0 + x_1) > ((19.0 + x_2) > (14.0 + x_9)? (19.0 + x_2) : (14.0 + x_9))? (18.0 + x_1) : ((19.0 + x_2) > (14.0 + x_9)? (19.0 + x_2) : (14.0 + x_9))) > ((12.0 + x_10) > ((15.0 + x_11) > (19.0 + x_12)? (15.0 + x_11) : (19.0 + x_12))? (12.0 + x_10) : ((15.0 + x_11) > (19.0 + x_12)? (15.0 + x_11) : (19.0 + x_12)))? ((18.0 + x_1) > ((19.0 + x_2) > (14.0 + x_9)? (19.0 + x_2) : (14.0 + x_9))? (18.0 + x_1) : ((19.0 + x_2) > (14.0 + x_9)? (19.0 + x_2) : (14.0 + x_9))) : ((12.0 + x_10) > ((15.0 + x_11) > (19.0 + x_12)? (15.0 + x_11) : (19.0 + x_12))? (12.0 + x_10) : ((15.0 + x_11) > (19.0 + x_12)? (15.0 + x_11) : (19.0 + x_12)))) > (((4.0 + x_13) > ((6.0 + x_14) > (15.0 + x_16)? (6.0 + x_14) : (15.0 + x_16))? (4.0 + x_13) : ((6.0 + x_14) > (15.0 + x_16)? (6.0 + x_14) : (15.0 + x_16))) > ((16.0 + x_18) > ((5.0 + x_22) > (17.0 + x_23)? (5.0 + x_22) : (17.0 + x_23))? (16.0 + x_18) : ((5.0 + x_22) > (17.0 + x_23)? (5.0 + x_22) : (17.0 + x_23)))? ((4.0 + x_13) > ((6.0 + x_14) > (15.0 + x_16)? (6.0 + x_14) : (15.0 + x_16))? (4.0 + x_13) : ((6.0 + x_14) > (15.0 + x_16)? (6.0 + x_14) : (15.0 + x_16))) : ((16.0 + x_18) > ((5.0 + x_22) > (17.0 + x_23)? (5.0 + x_22) : (17.0 + x_23))? (16.0 + x_18) : ((5.0 + x_22) > (17.0 + x_23)? (5.0 + x_22) : (17.0 + x_23))))? (((18.0 + x_1) > ((19.0 + x_2) > (14.0 + x_9)? (19.0 + x_2) : (14.0 + x_9))? (18.0 + x_1) : ((19.0 + x_2) > (14.0 + x_9)? (19.0 + x_2) : (14.0 + x_9))) > ((12.0 + x_10) > ((15.0 + x_11) > (19.0 + x_12)? (15.0 + x_11) : (19.0 + x_12))? (12.0 + x_10) : ((15.0 + x_11) > (19.0 + x_12)? (15.0 + x_11) : (19.0 + x_12)))? ((18.0 + x_1) > ((19.0 + x_2) > (14.0 + x_9)? (19.0 + x_2) : (14.0 + x_9))? (18.0 + x_1) : ((19.0 + x_2) > (14.0 + x_9)? (19.0 + x_2) : (14.0 + x_9))) : ((12.0 + x_10) > ((15.0 + x_11) > (19.0 + x_12)? (15.0 + x_11) : (19.0 + x_12))? (12.0 + x_10) : ((15.0 + x_11) > (19.0 + x_12)? (15.0 + x_11) : (19.0 + x_12)))) : (((4.0 + x_13) > ((6.0 + x_14) > (15.0 + x_16)? (6.0 + x_14) : (15.0 + x_16))? (4.0 + x_13) : ((6.0 + x_14) > (15.0 + x_16)? (6.0 + x_14) : (15.0 + x_16))) > ((16.0 + x_18) > ((5.0 + x_22) > (17.0 + x_23)? (5.0 + x_22) : (17.0 + x_23))? (16.0 + x_18) : ((5.0 + x_22) > (17.0 + x_23)? (5.0 + x_22) : (17.0 + x_23)))? ((4.0 + x_13) > ((6.0 + x_14) > (15.0 + x_16)? (6.0 + x_14) : (15.0 + x_16))? (4.0 + x_13) : ((6.0 + x_14) > (15.0 + x_16)? (6.0 + x_14) : (15.0 + x_16))) : ((16.0 + x_18) > ((5.0 + x_22) > (17.0 + x_23)? (5.0 + x_22) : (17.0 + x_23))? (16.0 + x_18) : ((5.0 + x_22) > (17.0 + x_23)? (5.0 + x_22) : (17.0 + x_23)))));
x_16_ = ((((9.0 + x_0) > ((9.0 + x_1) > (7.0 + x_3)? (9.0 + x_1) : (7.0 + x_3))? (9.0 + x_0) : ((9.0 + x_1) > (7.0 + x_3)? (9.0 + x_1) : (7.0 + x_3))) > ((6.0 + x_4) > ((2.0 + x_5) > (13.0 + x_7)? (2.0 + x_5) : (13.0 + x_7))? (6.0 + x_4) : ((2.0 + x_5) > (13.0 + x_7)? (2.0 + x_5) : (13.0 + x_7)))? ((9.0 + x_0) > ((9.0 + x_1) > (7.0 + x_3)? (9.0 + x_1) : (7.0 + x_3))? (9.0 + x_0) : ((9.0 + x_1) > (7.0 + x_3)? (9.0 + x_1) : (7.0 + x_3))) : ((6.0 + x_4) > ((2.0 + x_5) > (13.0 + x_7)? (2.0 + x_5) : (13.0 + x_7))? (6.0 + x_4) : ((2.0 + x_5) > (13.0 + x_7)? (2.0 + x_5) : (13.0 + x_7)))) > (((17.0 + x_8) > ((9.0 + x_13) > (17.0 + x_14)? (9.0 + x_13) : (17.0 + x_14))? (17.0 + x_8) : ((9.0 + x_13) > (17.0 + x_14)? (9.0 + x_13) : (17.0 + x_14))) > ((7.0 + x_15) > ((3.0 + x_19) > (20.0 + x_21)? (3.0 + x_19) : (20.0 + x_21))? (7.0 + x_15) : ((3.0 + x_19) > (20.0 + x_21)? (3.0 + x_19) : (20.0 + x_21)))? ((17.0 + x_8) > ((9.0 + x_13) > (17.0 + x_14)? (9.0 + x_13) : (17.0 + x_14))? (17.0 + x_8) : ((9.0 + x_13) > (17.0 + x_14)? (9.0 + x_13) : (17.0 + x_14))) : ((7.0 + x_15) > ((3.0 + x_19) > (20.0 + x_21)? (3.0 + x_19) : (20.0 + x_21))? (7.0 + x_15) : ((3.0 + x_19) > (20.0 + x_21)? (3.0 + x_19) : (20.0 + x_21))))? (((9.0 + x_0) > ((9.0 + x_1) > (7.0 + x_3)? (9.0 + x_1) : (7.0 + x_3))? (9.0 + x_0) : ((9.0 + x_1) > (7.0 + x_3)? (9.0 + x_1) : (7.0 + x_3))) > ((6.0 + x_4) > ((2.0 + x_5) > (13.0 + x_7)? (2.0 + x_5) : (13.0 + x_7))? (6.0 + x_4) : ((2.0 + x_5) > (13.0 + x_7)? (2.0 + x_5) : (13.0 + x_7)))? ((9.0 + x_0) > ((9.0 + x_1) > (7.0 + x_3)? (9.0 + x_1) : (7.0 + x_3))? (9.0 + x_0) : ((9.0 + x_1) > (7.0 + x_3)? (9.0 + x_1) : (7.0 + x_3))) : ((6.0 + x_4) > ((2.0 + x_5) > (13.0 + x_7)? (2.0 + x_5) : (13.0 + x_7))? (6.0 + x_4) : ((2.0 + x_5) > (13.0 + x_7)? (2.0 + x_5) : (13.0 + x_7)))) : (((17.0 + x_8) > ((9.0 + x_13) > (17.0 + x_14)? (9.0 + x_13) : (17.0 + x_14))? (17.0 + x_8) : ((9.0 + x_13) > (17.0 + x_14)? (9.0 + x_13) : (17.0 + x_14))) > ((7.0 + x_15) > ((3.0 + x_19) > (20.0 + x_21)? (3.0 + x_19) : (20.0 + x_21))? (7.0 + x_15) : ((3.0 + x_19) > (20.0 + x_21)? (3.0 + x_19) : (20.0 + x_21)))? ((17.0 + x_8) > ((9.0 + x_13) > (17.0 + x_14)? (9.0 + x_13) : (17.0 + x_14))? (17.0 + x_8) : ((9.0 + x_13) > (17.0 + x_14)? (9.0 + x_13) : (17.0 + x_14))) : ((7.0 + x_15) > ((3.0 + x_19) > (20.0 + x_21)? (3.0 + x_19) : (20.0 + x_21))? (7.0 + x_15) : ((3.0 + x_19) > (20.0 + x_21)? (3.0 + x_19) : (20.0 + x_21)))));
x_17_ = ((((12.0 + x_2) > ((11.0 + x_5) > (8.0 + x_6)? (11.0 + x_5) : (8.0 + x_6))? (12.0 + x_2) : ((11.0 + x_5) > (8.0 + x_6)? (11.0 + x_5) : (8.0 + x_6))) > ((13.0 + x_8) > ((6.0 + x_11) > (3.0 + x_12)? (6.0 + x_11) : (3.0 + x_12))? (13.0 + x_8) : ((6.0 + x_11) > (3.0 + x_12)? (6.0 + x_11) : (3.0 + x_12)))? ((12.0 + x_2) > ((11.0 + x_5) > (8.0 + x_6)? (11.0 + x_5) : (8.0 + x_6))? (12.0 + x_2) : ((11.0 + x_5) > (8.0 + x_6)? (11.0 + x_5) : (8.0 + x_6))) : ((13.0 + x_8) > ((6.0 + x_11) > (3.0 + x_12)? (6.0 + x_11) : (3.0 + x_12))? (13.0 + x_8) : ((6.0 + x_11) > (3.0 + x_12)? (6.0 + x_11) : (3.0 + x_12)))) > (((15.0 + x_13) > ((11.0 + x_16) > (9.0 + x_18)? (11.0 + x_16) : (9.0 + x_18))? (15.0 + x_13) : ((11.0 + x_16) > (9.0 + x_18)? (11.0 + x_16) : (9.0 + x_18))) > ((4.0 + x_20) > ((17.0 + x_22) > (20.0 + x_23)? (17.0 + x_22) : (20.0 + x_23))? (4.0 + x_20) : ((17.0 + x_22) > (20.0 + x_23)? (17.0 + x_22) : (20.0 + x_23)))? ((15.0 + x_13) > ((11.0 + x_16) > (9.0 + x_18)? (11.0 + x_16) : (9.0 + x_18))? (15.0 + x_13) : ((11.0 + x_16) > (9.0 + x_18)? (11.0 + x_16) : (9.0 + x_18))) : ((4.0 + x_20) > ((17.0 + x_22) > (20.0 + x_23)? (17.0 + x_22) : (20.0 + x_23))? (4.0 + x_20) : ((17.0 + x_22) > (20.0 + x_23)? (17.0 + x_22) : (20.0 + x_23))))? (((12.0 + x_2) > ((11.0 + x_5) > (8.0 + x_6)? (11.0 + x_5) : (8.0 + x_6))? (12.0 + x_2) : ((11.0 + x_5) > (8.0 + x_6)? (11.0 + x_5) : (8.0 + x_6))) > ((13.0 + x_8) > ((6.0 + x_11) > (3.0 + x_12)? (6.0 + x_11) : (3.0 + x_12))? (13.0 + x_8) : ((6.0 + x_11) > (3.0 + x_12)? (6.0 + x_11) : (3.0 + x_12)))? ((12.0 + x_2) > ((11.0 + x_5) > (8.0 + x_6)? (11.0 + x_5) : (8.0 + x_6))? (12.0 + x_2) : ((11.0 + x_5) > (8.0 + x_6)? (11.0 + x_5) : (8.0 + x_6))) : ((13.0 + x_8) > ((6.0 + x_11) > (3.0 + x_12)? (6.0 + x_11) : (3.0 + x_12))? (13.0 + x_8) : ((6.0 + x_11) > (3.0 + x_12)? (6.0 + x_11) : (3.0 + x_12)))) : (((15.0 + x_13) > ((11.0 + x_16) > (9.0 + x_18)? (11.0 + x_16) : (9.0 + x_18))? (15.0 + x_13) : ((11.0 + x_16) > (9.0 + x_18)? (11.0 + x_16) : (9.0 + x_18))) > ((4.0 + x_20) > ((17.0 + x_22) > (20.0 + x_23)? (17.0 + x_22) : (20.0 + x_23))? (4.0 + x_20) : ((17.0 + x_22) > (20.0 + x_23)? (17.0 + x_22) : (20.0 + x_23)))? ((15.0 + x_13) > ((11.0 + x_16) > (9.0 + x_18)? (11.0 + x_16) : (9.0 + x_18))? (15.0 + x_13) : ((11.0 + x_16) > (9.0 + x_18)? (11.0 + x_16) : (9.0 + x_18))) : ((4.0 + x_20) > ((17.0 + x_22) > (20.0 + x_23)? (17.0 + x_22) : (20.0 + x_23))? (4.0 + x_20) : ((17.0 + x_22) > (20.0 + x_23)? (17.0 + x_22) : (20.0 + x_23)))));
x_18_ = ((((5.0 + x_0) > ((13.0 + x_1) > (2.0 + x_4)? (13.0 + x_1) : (2.0 + x_4))? (5.0 + x_0) : ((13.0 + x_1) > (2.0 + x_4)? (13.0 + x_1) : (2.0 + x_4))) > ((9.0 + x_5) > ((15.0 + x_6) > (3.0 + x_9)? (15.0 + x_6) : (3.0 + x_9))? (9.0 + x_5) : ((15.0 + x_6) > (3.0 + x_9)? (15.0 + x_6) : (3.0 + x_9)))? ((5.0 + x_0) > ((13.0 + x_1) > (2.0 + x_4)? (13.0 + x_1) : (2.0 + x_4))? (5.0 + x_0) : ((13.0 + x_1) > (2.0 + x_4)? (13.0 + x_1) : (2.0 + x_4))) : ((9.0 + x_5) > ((15.0 + x_6) > (3.0 + x_9)? (15.0 + x_6) : (3.0 + x_9))? (9.0 + x_5) : ((15.0 + x_6) > (3.0 + x_9)? (15.0 + x_6) : (3.0 + x_9)))) > (((9.0 + x_12) > ((4.0 + x_14) > (8.0 + x_15)? (4.0 + x_14) : (8.0 + x_15))? (9.0 + x_12) : ((4.0 + x_14) > (8.0 + x_15)? (4.0 + x_14) : (8.0 + x_15))) > ((12.0 + x_16) > ((5.0 + x_20) > (12.0 + x_21)? (5.0 + x_20) : (12.0 + x_21))? (12.0 + x_16) : ((5.0 + x_20) > (12.0 + x_21)? (5.0 + x_20) : (12.0 + x_21)))? ((9.0 + x_12) > ((4.0 + x_14) > (8.0 + x_15)? (4.0 + x_14) : (8.0 + x_15))? (9.0 + x_12) : ((4.0 + x_14) > (8.0 + x_15)? (4.0 + x_14) : (8.0 + x_15))) : ((12.0 + x_16) > ((5.0 + x_20) > (12.0 + x_21)? (5.0 + x_20) : (12.0 + x_21))? (12.0 + x_16) : ((5.0 + x_20) > (12.0 + x_21)? (5.0 + x_20) : (12.0 + x_21))))? (((5.0 + x_0) > ((13.0 + x_1) > (2.0 + x_4)? (13.0 + x_1) : (2.0 + x_4))? (5.0 + x_0) : ((13.0 + x_1) > (2.0 + x_4)? (13.0 + x_1) : (2.0 + x_4))) > ((9.0 + x_5) > ((15.0 + x_6) > (3.0 + x_9)? (15.0 + x_6) : (3.0 + x_9))? (9.0 + x_5) : ((15.0 + x_6) > (3.0 + x_9)? (15.0 + x_6) : (3.0 + x_9)))? ((5.0 + x_0) > ((13.0 + x_1) > (2.0 + x_4)? (13.0 + x_1) : (2.0 + x_4))? (5.0 + x_0) : ((13.0 + x_1) > (2.0 + x_4)? (13.0 + x_1) : (2.0 + x_4))) : ((9.0 + x_5) > ((15.0 + x_6) > (3.0 + x_9)? (15.0 + x_6) : (3.0 + x_9))? (9.0 + x_5) : ((15.0 + x_6) > (3.0 + x_9)? (15.0 + x_6) : (3.0 + x_9)))) : (((9.0 + x_12) > ((4.0 + x_14) > (8.0 + x_15)? (4.0 + x_14) : (8.0 + x_15))? (9.0 + x_12) : ((4.0 + x_14) > (8.0 + x_15)? (4.0 + x_14) : (8.0 + x_15))) > ((12.0 + x_16) > ((5.0 + x_20) > (12.0 + x_21)? (5.0 + x_20) : (12.0 + x_21))? (12.0 + x_16) : ((5.0 + x_20) > (12.0 + x_21)? (5.0 + x_20) : (12.0 + x_21)))? ((9.0 + x_12) > ((4.0 + x_14) > (8.0 + x_15)? (4.0 + x_14) : (8.0 + x_15))? (9.0 + x_12) : ((4.0 + x_14) > (8.0 + x_15)? (4.0 + x_14) : (8.0 + x_15))) : ((12.0 + x_16) > ((5.0 + x_20) > (12.0 + x_21)? (5.0 + x_20) : (12.0 + x_21))? (12.0 + x_16) : ((5.0 + x_20) > (12.0 + x_21)? (5.0 + x_20) : (12.0 + x_21)))));
x_19_ = ((((2.0 + x_3) > ((19.0 + x_7) > (9.0 + x_9)? (19.0 + x_7) : (9.0 + x_9))? (2.0 + x_3) : ((19.0 + x_7) > (9.0 + x_9)? (19.0 + x_7) : (9.0 + x_9))) > ((5.0 + x_13) > ((4.0 + x_14) > (15.0 + x_16)? (4.0 + x_14) : (15.0 + x_16))? (5.0 + x_13) : ((4.0 + x_14) > (15.0 + x_16)? (4.0 + x_14) : (15.0 + x_16)))? ((2.0 + x_3) > ((19.0 + x_7) > (9.0 + x_9)? (19.0 + x_7) : (9.0 + x_9))? (2.0 + x_3) : ((19.0 + x_7) > (9.0 + x_9)? (19.0 + x_7) : (9.0 + x_9))) : ((5.0 + x_13) > ((4.0 + x_14) > (15.0 + x_16)? (4.0 + x_14) : (15.0 + x_16))? (5.0 + x_13) : ((4.0 + x_14) > (15.0 + x_16)? (4.0 + x_14) : (15.0 + x_16)))) > (((2.0 + x_18) > ((2.0 + x_19) > (19.0 + x_20)? (2.0 + x_19) : (19.0 + x_20))? (2.0 + x_18) : ((2.0 + x_19) > (19.0 + x_20)? (2.0 + x_19) : (19.0 + x_20))) > ((15.0 + x_21) > ((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23))? (15.0 + x_21) : ((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23)))? ((2.0 + x_18) > ((2.0 + x_19) > (19.0 + x_20)? (2.0 + x_19) : (19.0 + x_20))? (2.0 + x_18) : ((2.0 + x_19) > (19.0 + x_20)? (2.0 + x_19) : (19.0 + x_20))) : ((15.0 + x_21) > ((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23))? (15.0 + x_21) : ((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23))))? (((2.0 + x_3) > ((19.0 + x_7) > (9.0 + x_9)? (19.0 + x_7) : (9.0 + x_9))? (2.0 + x_3) : ((19.0 + x_7) > (9.0 + x_9)? (19.0 + x_7) : (9.0 + x_9))) > ((5.0 + x_13) > ((4.0 + x_14) > (15.0 + x_16)? (4.0 + x_14) : (15.0 + x_16))? (5.0 + x_13) : ((4.0 + x_14) > (15.0 + x_16)? (4.0 + x_14) : (15.0 + x_16)))? ((2.0 + x_3) > ((19.0 + x_7) > (9.0 + x_9)? (19.0 + x_7) : (9.0 + x_9))? (2.0 + x_3) : ((19.0 + x_7) > (9.0 + x_9)? (19.0 + x_7) : (9.0 + x_9))) : ((5.0 + x_13) > ((4.0 + x_14) > (15.0 + x_16)? (4.0 + x_14) : (15.0 + x_16))? (5.0 + x_13) : ((4.0 + x_14) > (15.0 + x_16)? (4.0 + x_14) : (15.0 + x_16)))) : (((2.0 + x_18) > ((2.0 + x_19) > (19.0 + x_20)? (2.0 + x_19) : (19.0 + x_20))? (2.0 + x_18) : ((2.0 + x_19) > (19.0 + x_20)? (2.0 + x_19) : (19.0 + x_20))) > ((15.0 + x_21) > ((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23))? (15.0 + x_21) : ((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23)))? ((2.0 + x_18) > ((2.0 + x_19) > (19.0 + x_20)? (2.0 + x_19) : (19.0 + x_20))? (2.0 + x_18) : ((2.0 + x_19) > (19.0 + x_20)? (2.0 + x_19) : (19.0 + x_20))) : ((15.0 + x_21) > ((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23))? (15.0 + x_21) : ((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23)))));
x_20_ = ((((11.0 + x_0) > ((8.0 + x_3) > (3.0 + x_4)? (8.0 + x_3) : (3.0 + x_4))? (11.0 + x_0) : ((8.0 + x_3) > (3.0 + x_4)? (8.0 + x_3) : (3.0 + x_4))) > ((4.0 + x_5) > ((14.0 + x_7) > (14.0 + x_8)? (14.0 + x_7) : (14.0 + x_8))? (4.0 + x_5) : ((14.0 + x_7) > (14.0 + x_8)? (14.0 + x_7) : (14.0 + x_8)))? ((11.0 + x_0) > ((8.0 + x_3) > (3.0 + x_4)? (8.0 + x_3) : (3.0 + x_4))? (11.0 + x_0) : ((8.0 + x_3) > (3.0 + x_4)? (8.0 + x_3) : (3.0 + x_4))) : ((4.0 + x_5) > ((14.0 + x_7) > (14.0 + x_8)? (14.0 + x_7) : (14.0 + x_8))? (4.0 + x_5) : ((14.0 + x_7) > (14.0 + x_8)? (14.0 + x_7) : (14.0 + x_8)))) > (((9.0 + x_9) > ((13.0 + x_17) > (18.0 + x_18)? (13.0 + x_17) : (18.0 + x_18))? (9.0 + x_9) : ((13.0 + x_17) > (18.0 + x_18)? (13.0 + x_17) : (18.0 + x_18))) > ((4.0 + x_19) > ((8.0 + x_21) > (17.0 + x_23)? (8.0 + x_21) : (17.0 + x_23))? (4.0 + x_19) : ((8.0 + x_21) > (17.0 + x_23)? (8.0 + x_21) : (17.0 + x_23)))? ((9.0 + x_9) > ((13.0 + x_17) > (18.0 + x_18)? (13.0 + x_17) : (18.0 + x_18))? (9.0 + x_9) : ((13.0 + x_17) > (18.0 + x_18)? (13.0 + x_17) : (18.0 + x_18))) : ((4.0 + x_19) > ((8.0 + x_21) > (17.0 + x_23)? (8.0 + x_21) : (17.0 + x_23))? (4.0 + x_19) : ((8.0 + x_21) > (17.0 + x_23)? (8.0 + x_21) : (17.0 + x_23))))? (((11.0 + x_0) > ((8.0 + x_3) > (3.0 + x_4)? (8.0 + x_3) : (3.0 + x_4))? (11.0 + x_0) : ((8.0 + x_3) > (3.0 + x_4)? (8.0 + x_3) : (3.0 + x_4))) > ((4.0 + x_5) > ((14.0 + x_7) > (14.0 + x_8)? (14.0 + x_7) : (14.0 + x_8))? (4.0 + x_5) : ((14.0 + x_7) > (14.0 + x_8)? (14.0 + x_7) : (14.0 + x_8)))? ((11.0 + x_0) > ((8.0 + x_3) > (3.0 + x_4)? (8.0 + x_3) : (3.0 + x_4))? (11.0 + x_0) : ((8.0 + x_3) > (3.0 + x_4)? (8.0 + x_3) : (3.0 + x_4))) : ((4.0 + x_5) > ((14.0 + x_7) > (14.0 + x_8)? (14.0 + x_7) : (14.0 + x_8))? (4.0 + x_5) : ((14.0 + x_7) > (14.0 + x_8)? (14.0 + x_7) : (14.0 + x_8)))) : (((9.0 + x_9) > ((13.0 + x_17) > (18.0 + x_18)? (13.0 + x_17) : (18.0 + x_18))? (9.0 + x_9) : ((13.0 + x_17) > (18.0 + x_18)? (13.0 + x_17) : (18.0 + x_18))) > ((4.0 + x_19) > ((8.0 + x_21) > (17.0 + x_23)? (8.0 + x_21) : (17.0 + x_23))? (4.0 + x_19) : ((8.0 + x_21) > (17.0 + x_23)? (8.0 + x_21) : (17.0 + x_23)))? ((9.0 + x_9) > ((13.0 + x_17) > (18.0 + x_18)? (13.0 + x_17) : (18.0 + x_18))? (9.0 + x_9) : ((13.0 + x_17) > (18.0 + x_18)? (13.0 + x_17) : (18.0 + x_18))) : ((4.0 + x_19) > ((8.0 + x_21) > (17.0 + x_23)? (8.0 + x_21) : (17.0 + x_23))? (4.0 + x_19) : ((8.0 + x_21) > (17.0 + x_23)? (8.0 + x_21) : (17.0 + x_23)))));
x_21_ = ((((8.0 + x_2) > ((5.0 + x_5) > (18.0 + x_7)? (5.0 + x_5) : (18.0 + x_7))? (8.0 + x_2) : ((5.0 + x_5) > (18.0 + x_7)? (5.0 + x_5) : (18.0 + x_7))) > ((4.0 + x_11) > ((13.0 + x_13) > (16.0 + x_14)? (13.0 + x_13) : (16.0 + x_14))? (4.0 + x_11) : ((13.0 + x_13) > (16.0 + x_14)? (13.0 + x_13) : (16.0 + x_14)))? ((8.0 + x_2) > ((5.0 + x_5) > (18.0 + x_7)? (5.0 + x_5) : (18.0 + x_7))? (8.0 + x_2) : ((5.0 + x_5) > (18.0 + x_7)? (5.0 + x_5) : (18.0 + x_7))) : ((4.0 + x_11) > ((13.0 + x_13) > (16.0 + x_14)? (13.0 + x_13) : (16.0 + x_14))? (4.0 + x_11) : ((13.0 + x_13) > (16.0 + x_14)? (13.0 + x_13) : (16.0 + x_14)))) > (((14.0 + x_16) > ((20.0 + x_17) > (16.0 + x_20)? (20.0 + x_17) : (16.0 + x_20))? (14.0 + x_16) : ((20.0 + x_17) > (16.0 + x_20)? (20.0 + x_17) : (16.0 + x_20))) > ((10.0 + x_21) > ((3.0 + x_22) > (3.0 + x_23)? (3.0 + x_22) : (3.0 + x_23))? (10.0 + x_21) : ((3.0 + x_22) > (3.0 + x_23)? (3.0 + x_22) : (3.0 + x_23)))? ((14.0 + x_16) > ((20.0 + x_17) > (16.0 + x_20)? (20.0 + x_17) : (16.0 + x_20))? (14.0 + x_16) : ((20.0 + x_17) > (16.0 + x_20)? (20.0 + x_17) : (16.0 + x_20))) : ((10.0 + x_21) > ((3.0 + x_22) > (3.0 + x_23)? (3.0 + x_22) : (3.0 + x_23))? (10.0 + x_21) : ((3.0 + x_22) > (3.0 + x_23)? (3.0 + x_22) : (3.0 + x_23))))? (((8.0 + x_2) > ((5.0 + x_5) > (18.0 + x_7)? (5.0 + x_5) : (18.0 + x_7))? (8.0 + x_2) : ((5.0 + x_5) > (18.0 + x_7)? (5.0 + x_5) : (18.0 + x_7))) > ((4.0 + x_11) > ((13.0 + x_13) > (16.0 + x_14)? (13.0 + x_13) : (16.0 + x_14))? (4.0 + x_11) : ((13.0 + x_13) > (16.0 + x_14)? (13.0 + x_13) : (16.0 + x_14)))? ((8.0 + x_2) > ((5.0 + x_5) > (18.0 + x_7)? (5.0 + x_5) : (18.0 + x_7))? (8.0 + x_2) : ((5.0 + x_5) > (18.0 + x_7)? (5.0 + x_5) : (18.0 + x_7))) : ((4.0 + x_11) > ((13.0 + x_13) > (16.0 + x_14)? (13.0 + x_13) : (16.0 + x_14))? (4.0 + x_11) : ((13.0 + x_13) > (16.0 + x_14)? (13.0 + x_13) : (16.0 + x_14)))) : (((14.0 + x_16) > ((20.0 + x_17) > (16.0 + x_20)? (20.0 + x_17) : (16.0 + x_20))? (14.0 + x_16) : ((20.0 + x_17) > (16.0 + x_20)? (20.0 + x_17) : (16.0 + x_20))) > ((10.0 + x_21) > ((3.0 + x_22) > (3.0 + x_23)? (3.0 + x_22) : (3.0 + x_23))? (10.0 + x_21) : ((3.0 + x_22) > (3.0 + x_23)? (3.0 + x_22) : (3.0 + x_23)))? ((14.0 + x_16) > ((20.0 + x_17) > (16.0 + x_20)? (20.0 + x_17) : (16.0 + x_20))? (14.0 + x_16) : ((20.0 + x_17) > (16.0 + x_20)? (20.0 + x_17) : (16.0 + x_20))) : ((10.0 + x_21) > ((3.0 + x_22) > (3.0 + x_23)? (3.0 + x_22) : (3.0 + x_23))? (10.0 + x_21) : ((3.0 + x_22) > (3.0 + x_23)? (3.0 + x_22) : (3.0 + x_23)))));
x_22_ = ((((20.0 + x_0) > ((12.0 + x_2) > (9.0 + x_3)? (12.0 + x_2) : (9.0 + x_3))? (20.0 + x_0) : ((12.0 + x_2) > (9.0 + x_3)? (12.0 + x_2) : (9.0 + x_3))) > ((3.0 + x_5) > ((13.0 + x_6) > (9.0 + x_8)? (13.0 + x_6) : (9.0 + x_8))? (3.0 + x_5) : ((13.0 + x_6) > (9.0 + x_8)? (13.0 + x_6) : (9.0 + x_8)))? ((20.0 + x_0) > ((12.0 + x_2) > (9.0 + x_3)? (12.0 + x_2) : (9.0 + x_3))? (20.0 + x_0) : ((12.0 + x_2) > (9.0 + x_3)? (12.0 + x_2) : (9.0 + x_3))) : ((3.0 + x_5) > ((13.0 + x_6) > (9.0 + x_8)? (13.0 + x_6) : (9.0 + x_8))? (3.0 + x_5) : ((13.0 + x_6) > (9.0 + x_8)? (13.0 + x_6) : (9.0 + x_8)))) > (((10.0 + x_9) > ((18.0 + x_10) > (12.0 + x_11)? (18.0 + x_10) : (12.0 + x_11))? (10.0 + x_9) : ((18.0 + x_10) > (12.0 + x_11)? (18.0 + x_10) : (12.0 + x_11))) > ((13.0 + x_17) > ((1.0 + x_19) > (15.0 + x_23)? (1.0 + x_19) : (15.0 + x_23))? (13.0 + x_17) : ((1.0 + x_19) > (15.0 + x_23)? (1.0 + x_19) : (15.0 + x_23)))? ((10.0 + x_9) > ((18.0 + x_10) > (12.0 + x_11)? (18.0 + x_10) : (12.0 + x_11))? (10.0 + x_9) : ((18.0 + x_10) > (12.0 + x_11)? (18.0 + x_10) : (12.0 + x_11))) : ((13.0 + x_17) > ((1.0 + x_19) > (15.0 + x_23)? (1.0 + x_19) : (15.0 + x_23))? (13.0 + x_17) : ((1.0 + x_19) > (15.0 + x_23)? (1.0 + x_19) : (15.0 + x_23))))? (((20.0 + x_0) > ((12.0 + x_2) > (9.0 + x_3)? (12.0 + x_2) : (9.0 + x_3))? (20.0 + x_0) : ((12.0 + x_2) > (9.0 + x_3)? (12.0 + x_2) : (9.0 + x_3))) > ((3.0 + x_5) > ((13.0 + x_6) > (9.0 + x_8)? (13.0 + x_6) : (9.0 + x_8))? (3.0 + x_5) : ((13.0 + x_6) > (9.0 + x_8)? (13.0 + x_6) : (9.0 + x_8)))? ((20.0 + x_0) > ((12.0 + x_2) > (9.0 + x_3)? (12.0 + x_2) : (9.0 + x_3))? (20.0 + x_0) : ((12.0 + x_2) > (9.0 + x_3)? (12.0 + x_2) : (9.0 + x_3))) : ((3.0 + x_5) > ((13.0 + x_6) > (9.0 + x_8)? (13.0 + x_6) : (9.0 + x_8))? (3.0 + x_5) : ((13.0 + x_6) > (9.0 + x_8)? (13.0 + x_6) : (9.0 + x_8)))) : (((10.0 + x_9) > ((18.0 + x_10) > (12.0 + x_11)? (18.0 + x_10) : (12.0 + x_11))? (10.0 + x_9) : ((18.0 + x_10) > (12.0 + x_11)? (18.0 + x_10) : (12.0 + x_11))) > ((13.0 + x_17) > ((1.0 + x_19) > (15.0 + x_23)? (1.0 + x_19) : (15.0 + x_23))? (13.0 + x_17) : ((1.0 + x_19) > (15.0 + x_23)? (1.0 + x_19) : (15.0 + x_23)))? ((10.0 + x_9) > ((18.0 + x_10) > (12.0 + x_11)? (18.0 + x_10) : (12.0 + x_11))? (10.0 + x_9) : ((18.0 + x_10) > (12.0 + x_11)? (18.0 + x_10) : (12.0 + x_11))) : ((13.0 + x_17) > ((1.0 + x_19) > (15.0 + x_23)? (1.0 + x_19) : (15.0 + x_23))? (13.0 + x_17) : ((1.0 + x_19) > (15.0 + x_23)? (1.0 + x_19) : (15.0 + x_23)))));
x_23_ = ((((11.0 + x_1) > ((12.0 + x_2) > (2.0 + x_5)? (12.0 + x_2) : (2.0 + x_5))? (11.0 + x_1) : ((12.0 + x_2) > (2.0 + x_5)? (12.0 + x_2) : (2.0 + x_5))) > ((13.0 + x_8) > ((3.0 + x_13) > (2.0 + x_15)? (3.0 + x_13) : (2.0 + x_15))? (13.0 + x_8) : ((3.0 + x_13) > (2.0 + x_15)? (3.0 + x_13) : (2.0 + x_15)))? ((11.0 + x_1) > ((12.0 + x_2) > (2.0 + x_5)? (12.0 + x_2) : (2.0 + x_5))? (11.0 + x_1) : ((12.0 + x_2) > (2.0 + x_5)? (12.0 + x_2) : (2.0 + x_5))) : ((13.0 + x_8) > ((3.0 + x_13) > (2.0 + x_15)? (3.0 + x_13) : (2.0 + x_15))? (13.0 + x_8) : ((3.0 + x_13) > (2.0 + x_15)? (3.0 + x_13) : (2.0 + x_15)))) > (((7.0 + x_16) > ((15.0 + x_18) > (15.0 + x_20)? (15.0 + x_18) : (15.0 + x_20))? (7.0 + x_16) : ((15.0 + x_18) > (15.0 + x_20)? (15.0 + x_18) : (15.0 + x_20))) > ((15.0 + x_21) > ((19.0 + x_22) > (10.0 + x_23)? (19.0 + x_22) : (10.0 + x_23))? (15.0 + x_21) : ((19.0 + x_22) > (10.0 + x_23)? (19.0 + x_22) : (10.0 + x_23)))? ((7.0 + x_16) > ((15.0 + x_18) > (15.0 + x_20)? (15.0 + x_18) : (15.0 + x_20))? (7.0 + x_16) : ((15.0 + x_18) > (15.0 + x_20)? (15.0 + x_18) : (15.0 + x_20))) : ((15.0 + x_21) > ((19.0 + x_22) > (10.0 + x_23)? (19.0 + x_22) : (10.0 + x_23))? (15.0 + x_21) : ((19.0 + x_22) > (10.0 + x_23)? (19.0 + x_22) : (10.0 + x_23))))? (((11.0 + x_1) > ((12.0 + x_2) > (2.0 + x_5)? (12.0 + x_2) : (2.0 + x_5))? (11.0 + x_1) : ((12.0 + x_2) > (2.0 + x_5)? (12.0 + x_2) : (2.0 + x_5))) > ((13.0 + x_8) > ((3.0 + x_13) > (2.0 + x_15)? (3.0 + x_13) : (2.0 + x_15))? (13.0 + x_8) : ((3.0 + x_13) > (2.0 + x_15)? (3.0 + x_13) : (2.0 + x_15)))? ((11.0 + x_1) > ((12.0 + x_2) > (2.0 + x_5)? (12.0 + x_2) : (2.0 + x_5))? (11.0 + x_1) : ((12.0 + x_2) > (2.0 + x_5)? (12.0 + x_2) : (2.0 + x_5))) : ((13.0 + x_8) > ((3.0 + x_13) > (2.0 + x_15)? (3.0 + x_13) : (2.0 + x_15))? (13.0 + x_8) : ((3.0 + x_13) > (2.0 + x_15)? (3.0 + x_13) : (2.0 + x_15)))) : (((7.0 + x_16) > ((15.0 + x_18) > (15.0 + x_20)? (15.0 + x_18) : (15.0 + x_20))? (7.0 + x_16) : ((15.0 + x_18) > (15.0 + x_20)? (15.0 + x_18) : (15.0 + x_20))) > ((15.0 + x_21) > ((19.0 + x_22) > (10.0 + x_23)? (19.0 + x_22) : (10.0 + x_23))? (15.0 + x_21) : ((19.0 + x_22) > (10.0 + x_23)? (19.0 + x_22) : (10.0 + x_23)))? ((7.0 + x_16) > ((15.0 + x_18) > (15.0 + x_20)? (15.0 + x_18) : (15.0 + x_20))? (7.0 + x_16) : ((15.0 + x_18) > (15.0 + x_20)? (15.0 + x_18) : (15.0 + x_20))) : ((15.0 + x_21) > ((19.0 + x_22) > (10.0 + x_23)? (19.0 + x_22) : (10.0 + x_23))? (15.0 + x_21) : ((19.0 + x_22) > (10.0 + x_23)? (19.0 + x_22) : (10.0 + x_23)))));
x_0 = x_0_;
x_1 = x_1_;
x_2 = x_2_;
x_3 = x_3_;
x_4 = x_4_;
x_5 = x_5_;
x_6 = x_6_;
x_7 = x_7_;
x_8 = x_8_;
x_9 = x_9_;
x_10 = x_10_;
x_11 = x_11_;
x_12 = x_12_;
x_13 = x_13_;
x_14 = x_14_;
x_15 = x_15_;
x_16 = x_16_;
x_17 = x_17_;
x_18 = x_18_;
x_19 = x_19_;
x_20 = x_20_;
x_21 = x_21_;
x_22 = x_22_;
x_23 = x_23_;
}
return 0;
}
|
the_stack_data/20449644.c | /* Example hwloc API program.
*
* See other examples under doc/examples/ in the source tree
* for more details.
*
* Copyright © 2009-2016 Inria. All rights reserved.
* Copyright © 2009-2011,2017 Université Bordeaux
* Copyright © 2009-2010 Cisco Systems, Inc. All rights reserved.
* See COPYING in top-level directory.
*
* hwloc-hello.c
*/
#include <hwloc.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
int main(void)
{
hwloc_topology_t topology;
hwloc_obj_t obj;
unsigned n, i;
int devid, platformid;
const char *dev;
/* Allocate, initialize and load topology object. */
hwloc_topology_init(&topology);
hwloc_topology_set_io_types_filter(topology, HWLOC_TYPE_FILTER_KEEP_IMPORTANT);
hwloc_topology_load(topology);
/* Find CUDA devices through the corresponding OS devices */
n = hwloc_get_nbobjs_by_type(topology, HWLOC_OBJ_OS_DEVICE);
for (i = 0; i < n ; i++) {
const char *s;
obj = hwloc_get_obj_by_type(topology, HWLOC_OBJ_OS_DEVICE, i);
printf("%s:\n", obj->name);
s = hwloc_obj_get_info_by_name(obj, "Backend");
if (s && !strcmp(s, "CUDA")) {
/* This is a CUDA device */
assert(!strncmp(obj->name, "cuda", 4));
devid = atoi(obj->name + 4);
printf("CUDA device %d\n", devid);
s = hwloc_obj_get_info_by_name(obj, "GPUModel");
if (s)
printf("Model: %s\n", s);
s = hwloc_obj_get_info_by_name(obj, "CUDAGlobalMemorySize");
if (s)
printf("Memory: %s\n", s);
s = hwloc_obj_get_info_by_name(obj, "CUDAMultiProcessors");
if (s)
{
int mp = atoi(s);
s = hwloc_obj_get_info_by_name(obj, "CUDACoresPerMP");
if (s) {
int mp_cores = atoi(s);
printf("Cores: %d\n", mp * mp_cores);
}
}
}
if (s && !strcmp(s, "OpenCL")) {
/* This is an OpenCL device */
assert(!strncmp(obj->name, "opencl", 6));
platformid = atoi(obj->name + 6);
printf("OpenCL platform %d\n", platformid);
dev = strchr(obj->name + 6, 'd');
devid = atoi(dev + 1);
printf("OpenCL device %d\n", devid);
s = hwloc_obj_get_info_by_name(obj, "GPUModel");
if (s)
printf("Model: %s\n", s);
s = hwloc_obj_get_info_by_name(obj, "OpenCLGlobalMemorySize");
if (s)
printf("Memory: %s\n", s);
}
/* One can also use helpers from hwloc/cuda.h, hwloc/cudart.h,
* hwloc/opencl.h */
/* Find out cpuset this is connected to */
while (obj && (!obj->cpuset || hwloc_bitmap_iszero(obj->cpuset)))
obj = obj->parent;
if (obj) {
char *cpuset_string;
char name[16];
hwloc_obj_type_snprintf(name, sizeof(name), obj, 0);
hwloc_bitmap_asprintf(&cpuset_string, obj->cpuset);
printf("Location: %s P#%d\n", name, obj->os_index);
printf("Cpuset: %s\n", cpuset_string);
}
printf("\n");
}
/* Destroy topology object. */
hwloc_topology_destroy(topology);
return 0;
}
|
the_stack_data/48134.c | int main(void) {
unsigned int x = 0;
while (x < 0x0fffffff) {
if (x < 0xfff0) {
x++;
} else {
x += 2;
}
}
__VERIFIER_assert(!(x % 2));
}
|
the_stack_data/140485.c | // Program to SWAP values of two numbers without the temp variable
#include <stdio.h>
int main()
{
int a= 10,b = 20;
a = a + b;
b = a - b;
a = a - b;
printf("a = %d, b = %d",a,b);
return 0;
}
|
the_stack_data/148577998.c | /* Getopt for GNU.
NOTE: getopt is now part of the C library, so if you don't know what
"Keep this file name-space clean" means, talk to [email protected]
before changing it!
Copyright (C) 1987, 88, 89, 90, 91, 92, 1993
Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2, or (at your option) any
later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#ifndef __STDC__
# ifndef const
# define const
# endif
#endif
/* This tells Alpha OSF/1 not to define a getopt prototype in <stdio.h>. */
#ifndef _NO_PROTO
#define _NO_PROTO
#endif
#include <stdio.h>
#include <string.h>
/* Comment out all this code if we are using the GNU C Library, and are not
actually compiling the library itself. This code is part of the GNU C
Library, but also included in many other GNU distributions. Compiling
and linking in this code is a waste when using the GNU C library
(especially if it is a shared library). Rather than having every GNU
program understand `configure --with-gnu-libc' and omit the object files,
it is simpler to just do this in the source for each such file. */
#if defined (_LIBC) || !defined (__GNU_LIBRARY__)
/* This needs to come after some library #include
to get __GNU_LIBRARY__ defined. */
#ifdef __GNU_LIBRARY__
/* Don't include stdlib.h for non-GNU C libraries because some of them
contain conflicting prototypes for getopt. */
#include <stdlib.h>
#endif /* GNU C library. */
/* If GETOPT_COMPAT is defined, `+' as well as `--' can introduce a
long-named option. Because this is not POSIX.2 compliant, it is
being phased out. */
/* #define GETOPT_COMPAT */
/* This version of `getopt' appears to the caller like standard Unix `getopt'
but it behaves differently for the user, since it allows the user
to intersperse the options with the other arguments.
As `getopt' works, it permutes the elements of ARGV so that,
when it is done, all the options precede everything else. Thus
all application programs are extended to handle flexible argument order.
Setting the environment variable POSIXLY_CORRECT disables permutation.
Then the behavior is completely standard.
GNU application programs can use a third alternative mode in which
they can distinguish the relative order of options and other arguments. */
#include "getopt.h"
/* For communication from `getopt' to the caller.
When `getopt' finds an option that takes an argument,
the argument value is returned here.
Also, when `ordering' is RETURN_IN_ORDER,
each non-option ARGV-element is returned here. */
char *optarg = 0;
/* Index in ARGV of the next element to be scanned.
This is used for communication to and from the caller
and for communication between successive calls to `getopt'.
On entry to `getopt', zero means this is the first call; initialize.
When `getopt' returns EOF, this is the index of the first of the
non-option elements that the caller should itself scan.
Otherwise, `optind' communicates from one call to the next
how much of ARGV has been scanned so far. */
/* XXX 1003.2 says this must be 1 before any call. */
int optind = 0;
/* The next char to be scanned in the option-element
in which the last option character we returned was found.
This allows us to pick up the scan where we left off.
If this is zero, or a null string, it means resume the scan
by advancing to the next ARGV-element. */
static char *nextchar;
/* Callers store zero here to inhibit the error message
for unrecognized options. */
int opterr = 1;
/* Set to an option character which was unrecognized.
This must be initialized on some systems to avoid linking in the
system's own getopt implementation. */
#define BAD_OPTION '\0'
int optopt = BAD_OPTION;
/* Describe how to deal with options that follow non-option ARGV-elements.
If the caller did not specify anything,
the default is REQUIRE_ORDER if the environment variable
POSIXLY_CORRECT is defined, PERMUTE otherwise.
REQUIRE_ORDER means don't recognize them as options;
stop option processing when the first non-option is seen.
This is what Unix does.
This mode of operation is selected by either setting the environment
variable POSIXLY_CORRECT, or using `+' as the first character
of the list of option characters.
PERMUTE is the default. We permute the contents of ARGV as we scan,
so that eventually all the non-options are at the end. This allows options
to be given in any order, even with programs that were not written to
expect this.
RETURN_IN_ORDER is an option available to programs that were written
to expect options and other ARGV-elements in any order and that care about
the ordering of the two. We describe each non-option ARGV-element
as if it were the argument of an option with character code 1.
Using `-' as the first character of the list of option characters
selects this mode of operation.
The special argument `--' forces an end of option-scanning regardless
of the value of `ordering'. In the case of RETURN_IN_ORDER, only
`--' can cause `getopt' to return EOF with `optind' != ARGC. */
static enum {
REQUIRE_ORDER, PERMUTE, RETURN_IN_ORDER
} ordering;
#ifdef __GNU_LIBRARY__
/* We want to avoid inclusion of string.h with non-GNU libraries
because there are many ways it can cause trouble.
On some systems, it contains special magic macros that don't work
in GCC. */
#include <string.h>
#define my_index strchr
#define my_strlen strlen
#else
/* Avoid depending on library functions or files
whose names are inconsistent. */
#if __STDC__ || defined(PROTO)
extern char *getenv(const char *name);
extern int strcmp(const char *s1, const char *s2);
extern int strncmp(const char *s1, const char *s2, int n);
static int my_strlen(const char *s);
static char *my_index(const char *str, int chr);
#else
extern char *getenv();
#endif
static int my_strlen(const char *str)
{
int n = 0;
while (*str++)
n++;
return n;
}
static char *my_index(const char *str, int chr)
{
while (*str) {
if (*str == chr)
return (char *) str;
str++;
}
return 0;
}
#endif /* GNU C library. */
/* Handle permutation of arguments. */
/* Describe the part of ARGV that contains non-options that have
been skipped. `first_nonopt' is the index in ARGV of the first of them;
`last_nonopt' is the index after the last of them. */
static int first_nonopt;
static int last_nonopt;
/* Exchange two adjacent subsequences of ARGV.
One subsequence is elements [first_nonopt,last_nonopt)
which contains all the non-options that have been skipped so far.
The other is elements [last_nonopt,optind), which contains all
the options processed since those non-options were skipped.
`first_nonopt' and `last_nonopt' are relocated so that they describe
the new indices of the non-options in ARGV after they are moved.
To perform the swap, we first reverse the order of all elements. So
all options now come before all non options, but they are in the
wrong order. So we put back the options and non options in original
order by reversing them again. For example:
original input: a b c -x -y
reverse all: -y -x c b a
reverse options: -x -y c b a
reverse non options: -x -y a b c
*/
#if __STDC__ || defined(PROTO)
static void exchange(char **argv);
#endif
static void exchange(char **argv)
{
char *temp, **first, **last;
/* Reverse all the elements [first_nonopt, optind) */
first = &argv[first_nonopt];
last = &argv[optind - 1];
while (first < last) {
temp = *first;
*first = *last;
*last = temp;
first++;
last--;
}
/* Put back the options in order */
first = &argv[first_nonopt];
first_nonopt += (optind - last_nonopt);
last = &argv[first_nonopt - 1];
while (first < last) {
temp = *first;
*first = *last;
*last = temp;
first++;
last--;
}
/* Put back the non options in order */
first = &argv[first_nonopt];
last_nonopt = optind;
last = &argv[last_nonopt - 1];
while (first < last) {
temp = *first;
*first = *last;
*last = temp;
first++;
last--;
}
}
/* Scan elements of ARGV (whose length is ARGC) for option characters
given in OPTSTRING.
If an element of ARGV starts with '-', and is not exactly "-" or "--",
then it is an option element. The characters of this element
(aside from the initial '-') are option characters. If `getopt'
is called repeatedly, it returns successively each of the option characters
from each of the option elements.
If `getopt' finds another option character, it returns that character,
updating `optind' and `nextchar' so that the next call to `getopt' can
resume the scan with the following option character or ARGV-element.
If there are no more option characters, `getopt' returns `EOF'.
Then `optind' is the index in ARGV of the first ARGV-element
that is not an option. (The ARGV-elements have been permuted
so that those that are not options now come last.)
OPTSTRING is a string containing the legitimate option characters.
If an option character is seen that is not listed in OPTSTRING,
return BAD_OPTION after printing an error message. If you set `opterr' to
zero, the error message is suppressed but we still return BAD_OPTION.
If a char in OPTSTRING is followed by a colon, that means it wants an arg,
so the following text in the same ARGV-element, or the text of the following
ARGV-element, is returned in `optarg'. Two colons mean an option that
wants an optional arg; if there is text in the current ARGV-element,
it is returned in `optarg', otherwise `optarg' is set to zero.
If OPTSTRING starts with `-' or `+', it requests different methods of
handling the non-option ARGV-elements.
See the comments about RETURN_IN_ORDER and REQUIRE_ORDER, above.
Long-named options begin with `--' instead of `-'.
Their names may be abbreviated as long as the abbreviation is unique
or is an exact match for some defined option. If they have an
argument, it follows the option name in the same ARGV-element, separated
from the option name by a `=', or else the in next ARGV-element.
When `getopt' finds a long-named option, it returns 0 if that option's
`flag' field is nonzero, the value of the option's `val' field
if the `flag' field is zero.
The elements of ARGV aren't really const, because we permute them.
But we pretend they're const in the prototype to be compatible
with other systems.
LONGOPTS is a vector of `struct option' terminated by an
element containing a name which is zero.
LONGIND returns the index in LONGOPT of the long-named option found.
It is only valid when a long-named option has been found by the most
recent call.
If LONG_ONLY is nonzero, '-' as well as '--' can introduce
long-named options. */
int _getopt_internal(int argc, char *const *argv, const char *optstring,
const struct option *longopts, int *longind, int long_only)
{
int option_index;
optarg = 0;
/* Initialize the internal data when the first call is made.
Start processing options with ARGV-element 1 (since ARGV-element 0
is the program name); the sequence of previously skipped
non-option ARGV-elements is empty. */
if (optind == 0) {
first_nonopt = last_nonopt = optind = 1;
nextchar = NULL;
/* Determine how to handle the ordering of options and nonoptions. */
if (optstring[0] == '-') {
ordering = RETURN_IN_ORDER;
++optstring;
} else if (optstring[0] == '+') {
ordering = REQUIRE_ORDER;
++optstring;
} else if (getenv("POSIXLY_CORRECT") != NULL)
ordering = REQUIRE_ORDER;
else
ordering = PERMUTE;
}
if (nextchar == NULL || *nextchar == '\0') {
if (ordering == PERMUTE) {
/* If we have just processed some options following some non-options,
exchange them so that the options come first. */
if (first_nonopt != last_nonopt && last_nonopt != optind)
exchange((char **) argv);
else if (last_nonopt != optind)
first_nonopt = optind;
/* Now skip any additional non-options
and extend the range of non-options previously skipped. */
while (optind < argc && (argv[optind][0] != '-' || argv[optind][1] == '\0')
#ifdef GETOPT_COMPAT
&& (longopts == NULL
|| argv[optind][0] != '+' || argv[optind][1] == '\0')
#endif /* GETOPT_COMPAT */
)
optind++;
last_nonopt = optind;
}
/* Special ARGV-element `--' means premature end of options.
Skip it like a null option,
then exchange with previous non-options as if it were an option,
then skip everything else like a non-option. */
if (optind != argc && !strcmp(argv[optind], "--")) {
optind++;
if (first_nonopt != last_nonopt && last_nonopt != optind)
exchange((char **) argv);
else if (first_nonopt == last_nonopt)
first_nonopt = optind;
last_nonopt = argc;
optind = argc;
}
/* If we have done all the ARGV-elements, stop the scan
and back over any non-options that we skipped and permuted. */
if (optind == argc) {
/* Set the next-arg-index to point at the non-options
that we previously skipped, so the caller will digest them. */
if (first_nonopt != last_nonopt)
optind = first_nonopt;
return EOF;
}
/* If we have come to a non-option and did not permute it,
either stop the scan or describe it to the caller and pass it by. */
if ((argv[optind][0] != '-' || argv[optind][1] == '\0')
#ifdef GETOPT_COMPAT
&& (longopts == NULL || argv[optind][0] != '+' || argv[optind][1] == '\0')
#endif /* GETOPT_COMPAT */
) {
if (ordering == REQUIRE_ORDER)
return EOF;
optarg = argv[optind++];
return 1;
}
/* We have found another option-ARGV-element.
Start decoding its characters. */
nextchar = (argv[optind] + 1 + (longopts != NULL && argv[optind][1] == '-'));
}
if (longopts != NULL && ((argv[optind][0] == '-' && (argv[optind][1] == '-' || long_only))
#ifdef GETOPT_COMPAT
|| argv[optind][0] == '+'
#endif /* GETOPT_COMPAT */
)) {
const struct option *p;
char *s = nextchar;
int exact = 0;
int ambig = 0;
const struct option *pfound = NULL;
int indfound = 0;
while (*s && *s != '=')
s++;
/* Test all options for either exact match or abbreviated matches. */
for (p = longopts, option_index = 0; p->name; p++, option_index++)
if (!strncmp(p->name, nextchar, s - nextchar)) {
if (s - nextchar == my_strlen(p->name)) {
/* Exact match found. */
pfound = p;
indfound = option_index;
exact = 1;
break;
} else if (pfound == NULL) {
/* First nonexact match found. */
pfound = p;
indfound = option_index;
} else
/* Second nonexact match found. */
ambig = 1;
}
if (ambig && !exact) {
if (opterr)
fprintf(stderr, "%s: option `%s' is ambiguous\n",
argv[0], argv[optind]);
nextchar += my_strlen(nextchar);
optind++;
return BAD_OPTION;
}
if (pfound != NULL) {
option_index = indfound;
optind++;
if (*s) {
/* Don't test has_arg with >, because some C compilers don't
allow it to be used on enums. */
if (pfound->has_arg)
optarg = s + 1;
else {
if (opterr) {
if (argv[optind - 1][1] == '-')
/* --option */
fprintf(stderr,
"%s: option `--%s' doesn't allow an argument\n",
argv[0], pfound->name);
else
/* +option or -option */
fprintf(stderr,
"%s: option `%c%s' doesn't allow an argument\n",
argv[0], argv[optind - 1][0],
pfound->name);
}
nextchar += my_strlen(nextchar);
return BAD_OPTION;
}
} else if (pfound->has_arg == 1) {
if (optind < argc)
optarg = argv[optind++];
else {
if (opterr)
fprintf(stderr,
"%s: option `%s' requires an argument\n",
argv[0], argv[optind - 1]);
nextchar += my_strlen(nextchar);
return optstring[0] == ':' ? ':' : BAD_OPTION;
}
}
nextchar += my_strlen(nextchar);
if (longind != NULL)
*longind = option_index;
if (pfound->flag) {
*(pfound->flag) = pfound->val;
return 0;
}
return pfound->val;
}
/* Can't find it as a long option. If this is not getopt_long_only,
or the option starts with '--' or is not a valid short
option, then it's an error.
Otherwise interpret it as a short option. */
if (!long_only || argv[optind][1] == '-'
#ifdef GETOPT_COMPAT
|| argv[optind][0] == '+'
#endif /* GETOPT_COMPAT */
|| my_index(optstring, *nextchar) == NULL) {
if (opterr) {
if (argv[optind][1] == '-')
/* --option */
fprintf(stderr, "%s: unrecognized option `--%s'\n",
argv[0], nextchar);
else
/* +option or -option */
fprintf(stderr, "%s: unrecognized option `%c%s'\n",
argv[0], argv[optind][0], nextchar);
}
nextchar = (char *) "";
optind++;
return BAD_OPTION;
}
}
/* Look at and handle the next option-character. */
{
char c = *nextchar++;
char *temp = my_index(optstring, c);
/* Increment `optind' when we start to process its last character. */
if (*nextchar == '\0')
++optind;
if (temp == NULL || c == ':') {
if (opterr) {
#if 0
if (c < 040 || c >= 0177)
fprintf(stderr,
"%s: unrecognized option, character code 0%o\n",
argv[0], c);
else
fprintf(stderr, "%s: unrecognized option `-%c'\n", argv[0],
c);
#else
/* 1003.2 specifies the format of this message. */
fprintf(stderr, "%s: illegal option -- %c\n", argv[0], c);
#endif
}
optopt = c;
return BAD_OPTION;
}
if (temp[1] == ':') {
if (temp[2] == ':') {
/* This is an option that accepts an argument optionally. */
if (*nextchar != '\0') {
optarg = nextchar;
optind++;
} else
optarg = 0;
nextchar = NULL;
} else {
/* This is an option that requires an argument. */
if (*nextchar != '\0') {
optarg = nextchar;
/* If we end this ARGV-element by taking the rest as an arg,
we must advance to the next element now. */
optind++;
} else if (optind == argc) {
if (opterr) {
#if 0
fprintf(stderr,
"%s: option `-%c' requires an argument\n",
argv[0], c);
#else
/* 1003.2 specifies the format of this message. */
fprintf(stderr,
"%s: option requires an argument -- %c\n",
argv[0], c);
#endif
}
optopt = c;
if (optstring[0] == ':')
c = ':';
else
c = BAD_OPTION;
} else
/* We already incremented `optind' once;
increment it again when taking next ARGV-elt as argument. */
optarg = argv[optind++];
nextchar = NULL;
}
}
return c;
}
}
int getopt(int argc, char *const *argv, const char *optstring)
{
return _getopt_internal(argc, argv, optstring, (const struct option *) 0, (int *) 0, 0);
}
int getopt_long(int argc, char *const *argv, const char *options, const struct option long_options, int *opt_index)
{
return _getopt_internal(argc, argv, options, long_options, opt_index, 0);
}
#endif /* _LIBC or not __GNU_LIBRARY__. */
#ifdef TEST
/* Compile with -DTEST to make an executable for use in testing
the above definition of `getopt'. */
int main(int argc, char **argv)
{
int c;
int digit_optind = 0;
while (1) {
int this_option_optind = optind ? optind : 1;
c = getopt(argc, argv, "abc:d:0123456789");
if (c == EOF)
break;
switch (c) {
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
if (digit_optind != 0 && digit_optind != this_option_optind)
printf("digits occur in two different argv-elements.\n");
digit_optind = this_option_optind;
printf("option %c\n", c);
break;
case 'a':
printf("option a\n");
break;
case 'b':
printf("option b\n");
break;
case 'c':
printf("option c with value `%s'\n", optarg);
break;
case BAD_OPTION:
break;
default:
printf("?? getopt returned character code 0%o ??\n", c);
}
}
if (optind < argc) {
printf("non-option ARGV-elements: ");
while (optind < argc)
printf("%s ", argv[optind++]);
printf("\n");
}
exit(0);
}
#endif /* TEST */
|
the_stack_data/22013274.c | #include <stdint.h>
#include <stdio.h>
void main() {
int32_t a;
a = 1 + 2;
}
|
the_stack_data/913928.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();
typedef struct SinglyLinkedListNode SinglyLinkedListNode;
typedef struct SinglyLinkedList SinglyLinkedList;
struct SinglyLinkedListNode {
int data;
SinglyLinkedListNode* next;
};
struct SinglyLinkedList {
SinglyLinkedListNode* head;
SinglyLinkedListNode* tail;
};
SinglyLinkedListNode* create_singly_linked_list_node(int node_data) {
SinglyLinkedListNode* node = malloc(sizeof(SinglyLinkedListNode));
node->data = node_data;
node->next = NULL;
return node;
}
void insert_node_into_singly_linked_list(SinglyLinkedList** singly_linked_list, int node_data) {
SinglyLinkedListNode* node = create_singly_linked_list_node(node_data);
if (!(*singly_linked_list)->head) {
(*singly_linked_list)->head = node;
} else {
(*singly_linked_list)->tail->next = node;
}
(*singly_linked_list)->tail = node;
}
void print_singly_linked_list(SinglyLinkedListNode* node, char* sep, FILE* fptr) {
while (node) {
fprintf(fptr, "%d", node->data);
node = node->next;
if (node) {
fprintf(fptr, "%s", sep);
}
}
}
void free_singly_linked_list(SinglyLinkedListNode* node) {
while (node) {
SinglyLinkedListNode* temp = node;
node = node->next;
free(temp);
}
}
SinglyLinkedListNode* mergeLists(SinglyLinkedListNode* head1, SinglyLinkedListNode* head2) {
}
int main()
{
FILE* fptr = fopen(getenv("OUTPUT_PATH"), "w");
char* tests_endptr;
char* tests_str = readline();
int tests = strtol(tests_str, &tests_endptr, 10);
if (tests_endptr == tests_str || *tests_endptr != '\0') { exit(EXIT_FAILURE); }
for (int tests_itr = 0; tests_itr < tests; tests_itr++) {
SinglyLinkedList* llist1 = malloc(sizeof(SinglyLinkedList));
llist1->head = NULL;
llist1->tail = NULL;
char* llist1_count_endptr;
char* llist1_count_str = readline();
int llist1_count = strtol(llist1_count_str, &llist1_count_endptr, 10);
if (llist1_count_endptr == llist1_count_str || *llist1_count_endptr != '\0') { exit(EXIT_FAILURE); }
for (int i = 0; i < llist1_count; i++) {
char* llist1_item_endptr;
char* llist1_item_str = readline();
int llist1_item = strtol(llist1_item_str, &llist1_item_endptr, 10);
if (llist1_item_endptr == llist1_item_str || *llist1_item_endptr != '\0') { exit(EXIT_FAILURE); }
insert_node_into_singly_linked_list(&llist1, llist1_item);
}
SinglyLinkedList* llist2 = malloc(sizeof(SinglyLinkedList));
llist2->head = NULL;
llist2->tail = NULL;
char* llist2_count_endptr;
char* llist2_count_str = readline();
int llist2_count = strtol(llist2_count_str, &llist2_count_endptr, 10);
if (llist2_count_endptr == llist2_count_str || *llist2_count_endptr != '\0') { exit(EXIT_FAILURE); }
for (int i = 0; i < llist2_count; i++) {
char* llist2_item_endptr;
char* llist2_item_str = readline();
int llist2_item = strtol(llist2_item_str, &llist2_item_endptr, 10);
if (llist2_item_endptr == llist2_item_str || *llist2_item_endptr != '\0') { exit(EXIT_FAILURE); }
insert_node_into_singly_linked_list(&llist2, llist2_item);
}
SinglyLinkedListNode* llist3 = mergeLists(llist1->head, llist2->head);
char *sep = " ";
print_singly_linked_list(llist3, sep, fptr);
fprintf(fptr, "\n");
free_singly_linked_list(llist3);
}
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; }
size_t new_length = alloc_length << 1;
data = realloc(data, new_length);
if (!data) { break; }
alloc_length = new_length;
}
if (data[data_length - 1] == '\n') {
data[data_length - 1] = '\0';
}
data = realloc(data, data_length);
return data;
}
|
the_stack_data/190766913.c | #include<stdio.h>
void main()
{
int arr[10],i,flag=-1,ele;
printf("Enter the 10 elements:\n");
for(i=0;i<10;i++)
scanf("%d",&arr[i]);
printf("Enter the element to be deleted: ");
scanf("%d",&ele);
for(i=0;i<10;i++)
{
if(ele==arr[i])
{flag=i; break;}
}
if(flag==-1)
{printf("Element not found\n");
printf("Elements present:\n");
for(i=0;i<10;i++)
printf("%d ",arr[i]);
}
else
{
for(i=flag;i<9;i++)
arr[i]=arr[i+1];
printf("Elements left:\n");
for(i=0;i<9;i++)
printf("%d ",arr[i]);
}
printf("\n");
}
|
the_stack_data/125139926.c | // general protection fault in ax25cmp
// https://syzkaller.appspot.com/bug?id=fd0b0b00fc26abb4b35663a0e2f1c91d8e6e5725
// status:fixed
// 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 <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.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>
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 long syz_init_net_socket(long domain, long type, long proto)
{
return syscall(__NR_socket, domain, type, proto);
}
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) {
}
}
#define SYZ_HAVE_SETUP_TEST 1
static void setup_test()
{
prctl(PR_SET_PDEATHSIG, SIGKILL, 0, 0, 0);
setpgrp();
}
#define SYZ_HAVE_RESET_TEST 1
static void reset_test()
{
int fd;
for (fd = 3; fd < 30; fd++)
close(fd);
}
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();
reset_test();
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[1] = {0xffffffffffffffff};
void execute_one(void)
{
long res = 0;
res = syz_init_net_socket(0xb, 5, 0);
if (res != -1)
r[0] = res;
memcpy((void*)0x20000080, "rose0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00",
16);
*(uint16_t*)0x20000090 = 0x1f;
*(uint8_t*)0x20000092 = 0;
*(uint8_t*)0x20000093 = 0;
*(uint8_t*)0x20000094 = 0;
*(uint8_t*)0x20000095 = 0;
*(uint8_t*)0x20000096 = 0;
*(uint8_t*)0x20000097 = 0;
*(uint8_t*)0x20000098 = 0;
syscall(__NR_ioctl, r[0], 0x8914, 0x20000080);
}
int main(void)
{
syscall(__NR_mmap, 0x20000000, 0x1000000, 3, 0x32, -1, 0);
loop();
return 0;
}
|
the_stack_data/401242.c | /* -*- compile-command: "gcc -Wall -Werror harmless_setuid.c -o harmless_setuid" -*- */
#define _GNU_SOURCE
#include <unistd.h>
#include <stdio.h>
int main (int argc, char **argv)
{
uid_t a, b, c = 0;
getresuid(&a, &b, &c);
printf("I'm #%d/%d/%d\n", a, b, c);
return 0;
}
|
the_stack_data/100997.c | /*
Packages
*/
//T// Contents
//T// Packages
//T// Libraries
//T// Libraries
//T// calling functions from a user made library
//T// this program just calls functions in libS2_04_Aux02.so library. To find out how to compile .so files, and executables that use them see S2_02_GCC_compiler.c, but as a summary, execute for each of the source files of the library
// gcc -fPIC -c libraryFuncsN.c
//T// then execute this to create the library
// gcc -shared -o libS2_04_Aux02.so libraryFuncsN.o
//T// create a header file S2_04_Aux01.h with declarations for the library functions
// int S2_04_LibFun1(int, int);
// int S2_04_LibFun2(int, int);
// #include "S2_04_Aux01.h"
#include <stdio.h>
int main()
{
int val1 = 0;
int val2 = 0;
//T// calling custom library functions
val1 = S2_04_LibFun1(3,10);
val2 = S2_04_LibFun2(2,4);
printf("val1 is: %d\nval2 is: %d\n",val1,val2);
return 0;
} |
the_stack_data/80322.c | #include <stdio.h>
int main() {
int N, alc=0, gas=0, die=0, fim;
do{
scanf("%d", &N);
if(N==1){
alc++;
} else if(N==2){
gas++;
} else if(N==3){
die++;
} else if(N==4){
break;
}
} while(N!=4);
printf("MUITO OBRIGADO\n");
printf("Alcool: %d\n", alc);
printf("Gasolina: %d\n", gas);
printf("Diesel: %d\n", die);
return 0;
}
|
the_stack_data/122014320.c | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <errno.h>
#include <signal.h>
void signalHandled(int signum){
printf("Recibi sennal %d\n",signum);
}
int main(int argc, char **argv){
struct sigaction sa;
sa.sa_handler = signalHandled;
sa.sa_flags = 0; // or SA_RESTART
sigemptyset(&sa.sa_mask);
if (sigaction(SIGINT, &sa, NULL) == -1) {
perror("sigaction");
exit(1);
}
for(;;){
//printf("Ciclo infinito\n");
}
}
|
the_stack_data/211081474.c | /*
Copyright (c) 2004-2019 Microsemi Corporation "Microsemi".
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 <sys/types.h>
#include <sys/stat.h>
#include <stdarg.h>
#include <unistd.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdio.h>
#include <fcntl.h>
#include <zlib.h>
static const char minusone = -1; // sign extending does not work on BBB!!!
static char base64_decoder[256] = {
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, -1, -1, 63,
52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -1, -1, -1,
-1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1,
-1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1
};
int write_block(int fd, const char *b, size_t s)
{
int c = 0, res = 0;
while (s) {
res = write(fd, b, s);
if (res < 0) {
perror("write");
return -1;
} else {
b += res;
c += res;
s -= res;
}
}
return c;
}
int base64_decode_inplace(char *buf, int src_len)
{
int i, j, k;
uint32_t x[4], xx;
if (buf == 0 || src_len == 0) {
return 0;
}
// Compact input buffer
for (i = 0, j = 0; i < src_len; ++i) {
if (buf[i] == '=' || base64_decoder[(int) buf[i]] != minusone) {
//dprintf(2, "%d: i=%d j=%d in: %hhd out: %hhd\n", __LINE__, i, j,
// buf[i], base64_decoder[(int) buf[i]]);
buf[j++] = buf[i];
}
}
src_len = j;
if (src_len % 4) {
dprintf(2, "%d: Unexpected input size: %d\n >", __LINE__, src_len);
for (i = 0; i < src_len; ++i) {
dprintf(2, "%c", buf[i]);
}
dprintf(2, "<\n");
return -1;
}
for (i = 0, j = 0; i < src_len;) {
int short1 = 0, short2 = 0;
for (k = 0; k < 4; ++k)
x[k] = base64_decoder[(int) buf[i++]];
// Handle padding
if (i == src_len) {
if (buf[src_len - 1] == '=') {
short1 = 1;
x[3] = 0;
if (buf[src_len - 2] == '=') {
short2 = 1;
x[2] = 0;
}
}
}
xx = (x[0] << 18) + (x[1] << 12) + (x[2] << 6) + x[3];
buf[j++] = (xx >> 16) & 0xFF;
if (!short1) {
buf[j++] = (xx >> 8) & 0xFF;
}
if (!short2) {
buf[j++] = xx & 0xFF;
}
}
return j;
}
int main(int argc, char * const argv[])
{
int buf_size = 1024;
int buf_valid = 0;
char *b = malloc(1024);
int res = -1, fd = -1;
if (argc != 2) {
dprintf(2, "Usage: base64decode <outout-file>\n");
dprintf(2, "\n");
goto EXIT;
}
while (1) {
if (buf_size - buf_valid == 0) {
buf_size += 1024;
b = realloc(b, buf_size);
}
if (!b) {
dprintf(2, "%d: Alloc error\n", __LINE__);
goto EXIT;
}
res = read(0, b + buf_valid, buf_size - buf_valid);
if (res > 0) {
buf_valid += res;
} else if (res == 0) {
break;
} else {
dprintf(2, "%d: read error\n", __LINE__);
perror("read");
goto EXIT;
}
if (buf_valid >= 2 &&
((b[buf_valid - 1] == '\n' && b[buf_valid - 2] == '\n') ||
(b[buf_valid - 1] == '\r' && b[buf_valid - 2] == '\r'))) {
break;
}
}
fd = open(argv[1], O_WRONLY | O_CREAT | O_TRUNC, 0600);
if (fd < 0) {
perror("open");
goto EXIT;
}
buf_valid = base64_decode_inplace(b, buf_valid);
if (buf_valid > 0) {
write_block(fd, b, buf_valid);
goto EXIT;
}
res = 0;
EXIT:
if (b) {
free(b);
}
if (fd != -1) {
close(fd);
}
return res;
}
|
the_stack_data/90761847.c | /*
*
* This license is set out in https://raw.githubusercontent.com/Broadcom-Network-Switching-Software/OpenBCM/master/Legal/LICENSE file.
*
* Copyright 2007-2020 Broadcom Inc. All rights reserved.
*
* File: phy8747_ucode.c
* Purpose: Firmware used by BCM8747 device's micro-Controller. Revision 0x0511
*/
#if defined(INCLUDE_PHY_8706)
unsigned char phy8747_ucode_bin[] = {
0x12, 0xfc, 0x2a, 0x12, 0xfe, 0x00, 0x7d, 0x03, 0x7c, 0xc8, 0x7f, 0x01,
0x12, 0xfb, 0xf6, 0xef, 0x13, 0x92, 0x00, 0x20, 0x00, 0x0b, 0xe4, 0xfb,
0xfa, 0x7d, 0x96, 0xfc, 0x7f, 0x01, 0x12, 0xfc, 0x90, 0x7d, 0x01, 0x7c,
0xc8, 0x7f, 0x01, 0x12, 0xfb, 0xf6, 0x90, 0x02, 0x37, 0xee, 0xf0, 0xa3,
0xef, 0xf0, 0x7f, 0x11, 0x7e, 0x05, 0x12, 0xfd, 0x0c, 0x90, 0x94, 0x34,
0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x7b, 0x11, 0x7a, 0x05, 0x7d, 0x5c, 0x7c,
0x80, 0x7f, 0x07, 0x12, 0xfc, 0x90, 0x30, 0x00, 0x05, 0x12, 0xfd, 0x6c,
0x80, 0x03, 0x12, 0xe7, 0xff, 0x12, 0xe2, 0x59, 0x80, 0xfb, 0x22, 0xe4,
0x90, 0x01, 0xbb, 0xf0, 0x90, 0x01, 0xc2, 0xf0, 0x90, 0x01, 0xe8, 0xf0,
0x90, 0x01, 0x85, 0xf0, 0x90, 0x94, 0x21, 0xe0, 0x44, 0x01, 0xf0, 0x90,
0x94, 0x52, 0x74, 0x48, 0xf0, 0xa3, 0x74, 0x04, 0xf0, 0x90, 0xe0, 0x02,
0x74, 0x5f, 0xf0, 0x90, 0x94, 0x52, 0x74, 0x48, 0xf0, 0xa3, 0xe4, 0xf0,
0x90, 0xe0, 0x03, 0x74, 0x20, 0xf0, 0x90, 0x94, 0x31, 0xe4, 0xf0, 0x12,
0xed, 0x57, 0x90, 0x01, 0xc2, 0xe0, 0x60, 0x0a, 0xe4, 0x90, 0x01, 0x46,
0xf0, 0x90, 0x01, 0x1c, 0x04, 0xf0, 0x90, 0x01, 0x7d, 0x74, 0x01, 0xf0,
0xe4, 0x90, 0x01, 0x94, 0xf0, 0x90, 0x01, 0x96, 0xf0, 0x90, 0x01, 0xc8,
0x74, 0x03, 0xf0, 0x90, 0x95, 0x15, 0xe0, 0xb4, 0x01, 0x08, 0x90, 0x95,
0x14, 0xe0, 0x90, 0x01, 0xc8, 0xf0, 0x7b, 0x01, 0x7a, 0x95, 0x79, 0x02,
0x90, 0x01, 0xce, 0x74, 0x0c, 0xf0, 0x90, 0x01, 0xc8, 0xe0, 0xff, 0x90,
0x01, 0xcf, 0xe4, 0xf0, 0xa3, 0xef, 0xf0, 0x7d, 0x0e, 0x12, 0xec, 0x1d,
0x7b, 0x01, 0x7a, 0x94, 0x79, 0xca, 0x90, 0x01, 0xce, 0x74, 0x0c, 0xf0,
0x90, 0x01, 0xc8, 0xe0, 0xff, 0x90, 0x01, 0xcf, 0xe4, 0xf0, 0xa3, 0xef,
0xf0, 0x7d, 0x0e, 0x12, 0xec, 0x1d, 0x90, 0x94, 0x34, 0xe0, 0x90, 0x01,
0xb9, 0xf0, 0xe4, 0x90, 0x01, 0x98, 0xf0, 0x90, 0x01, 0xc3, 0xf0, 0xa3,
0xf0, 0xa3, 0xf0, 0x90, 0x01, 0xc7, 0xf0, 0x90, 0x01, 0xc6, 0xf0, 0x90,
0x01, 0x98, 0xe0, 0x60, 0x03, 0x02, 0xda, 0x14, 0x12, 0xfd, 0x6a, 0x7d,
0x20, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfb, 0xf6, 0x90, 0x01, 0xbe, 0xee,
0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0xbe, 0xe0, 0xfe, 0xa3, 0xe0, 0xff,
0xa3, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x7f, 0x20, 0x7e, 0xc8, 0x12, 0xfc,
0xed, 0x90, 0x01, 0xbe, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0xa3, 0xe0, 0xfe,
0xa3, 0xe0, 0xff, 0x90, 0x01, 0xbe, 0xe0, 0xfc, 0xa3, 0xe0, 0xb5, 0x07,
0xd3, 0xec, 0xb5, 0x06, 0xcf, 0x90, 0x01, 0xbe, 0xa3, 0xe0, 0x30, 0xe2,
0x0d, 0x7d, 0xe4, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xf9, 0x55, 0xef, 0x30,
0xe4, 0x0a, 0xe4, 0x90, 0x01, 0x85, 0xf0, 0x90, 0x01, 0x98, 0x04, 0xf0,
0x7d, 0x2b, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfb, 0xf6, 0xee, 0x30, 0xe2,
0x03, 0x12, 0xda, 0x2d, 0x12, 0xf6, 0x29, 0x90, 0x94, 0x34, 0xe0, 0xb4,
0x44, 0x18, 0x90, 0x01, 0x0e, 0x74, 0x01, 0xf0, 0x90, 0x01, 0x07, 0xf0,
0x90, 0x01, 0x0e, 0x74, 0x03, 0xf0, 0x90, 0x01, 0x07, 0x74, 0x01, 0xf0,
0x80, 0x0c, 0x90, 0x01, 0x0e, 0x74, 0x14, 0xf0, 0x90, 0x01, 0x07, 0x74,
0x04, 0xf0, 0x90, 0x01, 0x85, 0xe0, 0x90, 0x01, 0x84, 0xf0, 0xe0, 0xc3,
0x94, 0x08, 0x50, 0x21, 0x90, 0x95, 0x10, 0xc0, 0x83, 0xc0, 0x82, 0xe0,
0xff, 0x90, 0x01, 0x84, 0xe0, 0xfe, 0x74, 0x01, 0xa8, 0x06, 0x08, 0x80,
0x02, 0xc3, 0x33, 0xd8, 0xfc, 0x4f, 0xd0, 0x82, 0xd0, 0x83, 0xf0, 0x80,
0x21, 0x90, 0x95, 0x11, 0xc0, 0x83, 0xc0, 0x82, 0xe0, 0xff, 0x90, 0x01,
0x84, 0xe0, 0x24, 0xf8, 0xfe, 0x74, 0x01, 0xa8, 0x06, 0x08, 0x80, 0x02,
0xc3, 0x33, 0xd8, 0xfc, 0x4f, 0xd0, 0x82, 0xd0, 0x83, 0xf0, 0xe4, 0xfd,
0xfc, 0x7f, 0x03, 0x12, 0xfb, 0xf6, 0xee, 0x30, 0xe6, 0x06, 0x7f, 0x01,
0xc0, 0x07, 0x80, 0x04, 0x7f, 0x00, 0xc0, 0x07, 0xe4, 0xfd, 0xfc, 0x7f,
0x01, 0x12, 0xfb, 0xf6, 0xef, 0x30, 0xe0, 0x04, 0x7e, 0x01, 0x80, 0x02,
0x7e, 0x00, 0xd0, 0x07, 0xee, 0x4f, 0x60, 0x04, 0x7f, 0x01, 0x80, 0x02,
0x7f, 0x00, 0x90, 0x02, 0x0a, 0xef, 0xf0, 0x7d, 0x42, 0x7c, 0xc8, 0x7f,
0x01, 0x12, 0xfb, 0xf6, 0x90, 0x01, 0xbe, 0xee, 0xf0, 0xa3, 0xef, 0xf0,
0x90, 0x01, 0xbe, 0xe0, 0xfe, 0xa3, 0xe0, 0xee, 0x54, 0x18, 0xfe, 0xe4,
0xee, 0xb4, 0x10, 0x04, 0x7f, 0x01, 0x80, 0x02, 0x7f, 0x00, 0x90, 0x02,
0x08, 0xef, 0xf0, 0x90, 0x01, 0xbe, 0xe0, 0xfe, 0xa3, 0xe0, 0xee, 0x54,
0x18, 0xfe, 0xe4, 0xee, 0xb4, 0x08, 0x04, 0x7f, 0x01, 0x80, 0x02, 0x7f,
0x00, 0x90, 0x02, 0x0d, 0xef, 0xf0, 0x90, 0x02, 0x08, 0xe0, 0xb4, 0x01,
0x23, 0x90, 0x02, 0x0a, 0xe0, 0x70, 0x1d, 0x90, 0xe0, 0x03, 0xe0, 0x64,
0x18, 0x60, 0x15, 0x90, 0x02, 0x05, 0x74, 0x01, 0xf0, 0x7b, 0x00, 0x7a,
0x08, 0x7d, 0x0e, 0x7c, 0x80, 0x7f, 0x04, 0x12, 0xfa, 0x4c, 0x80, 0x19,
0x90, 0x02, 0x05, 0xe0, 0xb4, 0x01, 0x0d, 0x7b, 0xff, 0x7a, 0xf7, 0x7d,
0x0e, 0x7c, 0x80, 0x7f, 0x04, 0x12, 0xfa, 0x8d, 0xe4, 0x90, 0x02, 0x05,
0xf0, 0x90, 0x02, 0x0d, 0xe0, 0xb4, 0x01, 0x22, 0x90, 0x02, 0x0a, 0xe0,
0x70, 0x1c, 0x90, 0xe0, 0x03, 0xe0, 0x64, 0x18, 0x60, 0x14, 0x90, 0x02,
0x0e, 0x74, 0x01, 0xf0, 0x7b, 0xfe, 0x7a, 0xff, 0x7d, 0x60, 0x7c, 0xc8,
0xff, 0x12, 0xfa, 0x8d, 0x80, 0x19, 0x90, 0x02, 0x0e, 0xe0, 0xb4, 0x01,
0x12, 0x7b, 0x01, 0x7a, 0x00, 0x7d, 0x60, 0x7c, 0xc8, 0x7f, 0x01, 0x12,
0xfa, 0x4c, 0xe4, 0x90, 0x02, 0x0e, 0xf0, 0x90, 0x01, 0x84, 0xe0, 0x12,
0xf0, 0x4b, 0xc3, 0x5d, 0x00, 0xc7, 0x65, 0x02, 0xc7, 0xd9, 0x03, 0xc8,
0x0c, 0x04, 0xc8, 0x93, 0x05, 0xcc, 0x9c, 0x08, 0xcd, 0x23, 0x09, 0xcd,
0xb5, 0x0a, 0xcf, 0xf8, 0x0b, 0xd0, 0x59, 0x0c, 0xd1, 0xbf, 0x0d, 0xc6,
0x35, 0x0e, 0xcb, 0xed, 0x0f, 0x00, 0x00, 0xc1, 0x2b, 0x90, 0x94, 0x34,
0xe0, 0xb4, 0x44, 0x17, 0x90, 0x94, 0xa4, 0x74, 0x01, 0xf0, 0xa3, 0xe4,
0xf0, 0x90, 0x01, 0x0e, 0x74, 0x03, 0xf0, 0x90, 0x01, 0x07, 0x74, 0x01,
0xf0, 0x80, 0x15, 0x90, 0x94, 0xa4, 0x74, 0x75, 0xf0, 0xa3, 0xe4, 0xf0,
0x90, 0x01, 0x0e, 0x74, 0x14, 0xf0, 0x90, 0x01, 0x07, 0x74, 0x04, 0xf0,
0x90, 0x94, 0x34, 0xe0, 0x64, 0x55, 0x70, 0x67, 0x90, 0x01, 0xc8, 0x74,
0x04, 0xf0, 0x7b, 0x01, 0x7a, 0x95, 0x79, 0x02, 0x90, 0x01, 0xce, 0x74,
0x0c, 0xf0, 0x90, 0x01, 0xc8, 0xe0, 0xff, 0x90, 0x01, 0xcf, 0xe4, 0xf0,
0xa3, 0xef, 0xf0, 0x7d, 0x0e, 0x12, 0xec, 0x1d, 0x7b, 0x01, 0x7a, 0x94,
0x79, 0xca, 0x90, 0x01, 0xce, 0x74, 0x0c, 0xf0, 0x90, 0x01, 0xc8, 0xe0,
0xff, 0x90, 0x01, 0xcf, 0xe4, 0xf0, 0xa3, 0xef, 0xf0, 0x7d, 0x0e, 0x12,
0xec, 0x1d, 0x90, 0x94, 0x5a, 0x74, 0x1a, 0xf0, 0xa3, 0x04, 0xf0, 0x90,
0x94, 0x58, 0x74, 0x0d, 0xf0, 0xa3, 0xe4, 0xf0, 0x90, 0x94, 0x56, 0x74,
0x0d, 0xf0, 0xa3, 0xe4, 0xf0, 0x90, 0x94, 0x54, 0xf0, 0xa3, 0x74, 0x40,
0xf0, 0x80, 0x42, 0x90, 0x01, 0xc8, 0x74, 0x03, 0xf0, 0x7b, 0x01, 0x7a,
0x95, 0x79, 0x02, 0x90, 0x01, 0xce, 0x74, 0x0c, 0xf0, 0x90, 0x01, 0xc8,
0xe0, 0xff, 0x90, 0x01, 0xcf, 0xe4, 0xf0, 0xa3, 0xef, 0xf0, 0x7d, 0x0e,
0x12, 0xec, 0x1d, 0x7b, 0x01, 0x7a, 0x94, 0x79, 0xca, 0x90, 0x01, 0xce,
0x74, 0x0c, 0xf0, 0x90, 0x01, 0xc8, 0xe0, 0xff, 0x90, 0x01, 0xcf, 0xe4,
0xf0, 0xa3, 0xef, 0xf0, 0x7d, 0x0e, 0x12, 0xec, 0x1d, 0x90, 0x94, 0x34,
0xe0, 0xb4, 0x44, 0x0c, 0x90, 0x94, 0x8c, 0x74, 0x47, 0xf0, 0xa3, 0x74,
0x64, 0xf0, 0x80, 0x0a, 0x90, 0x94, 0x8c, 0x74, 0x37, 0xf0, 0xa3, 0x74,
0x63, 0xf0, 0x90, 0x94, 0x52, 0x74, 0x48, 0xf0, 0x90, 0xe0, 0x02, 0x74,
0x5f, 0xf0, 0x12, 0xf3, 0x0c, 0x90, 0x94, 0xc4, 0xe4, 0xf0, 0xa3, 0xf0,
0x90, 0x94, 0x21, 0xe0, 0x44, 0x01, 0xf0, 0x90, 0x94, 0xcb, 0xe0, 0x44,
0x02, 0xf0, 0xa3, 0xe0, 0x44, 0x22, 0xf0, 0xe4, 0x90, 0x01, 0x89, 0xf0,
0xa3, 0xf0, 0x90, 0x01, 0x87, 0xf0, 0x90, 0x01, 0x86, 0x74, 0x02, 0xf0,
0xe4, 0x90, 0x01, 0x8b, 0xf0, 0x90, 0x01, 0x95, 0xf0, 0x90, 0x01, 0x92,
0x74, 0x02, 0xf0, 0xa3, 0x74, 0x8c, 0xf0, 0xe4, 0x90, 0x01, 0x8d, 0xf0,
0xa3, 0xf0, 0xa3, 0xf0, 0xa3, 0x74, 0x02, 0xf0, 0xe4, 0xa3, 0xf0, 0x90,
0x01, 0x97, 0xf0, 0x90, 0x94, 0x20, 0xe0, 0x54, 0xc0, 0x90, 0x01, 0x88,
0xf0, 0xe0, 0x70, 0x73, 0x90, 0x01, 0x9c, 0x74, 0x2a, 0xf0, 0xe4, 0xa3,
0xf0, 0x90, 0x01, 0xa0, 0x04, 0xf0, 0x90, 0x01, 0x9f, 0x74, 0x69, 0xf0,
0xe4, 0x90, 0x01, 0x9e, 0xf0, 0x90, 0x01, 0xa2, 0xf0, 0x90, 0x01, 0xa1,
0x74, 0x15, 0xf0, 0x90, 0x01, 0xa3, 0x74, 0x0a, 0xf0, 0xa3, 0x74, 0x80,
0xf0, 0xe4, 0xa3, 0xf0, 0xa3, 0x74, 0x69, 0xf0, 0xa3, 0x74, 0x01, 0xf0,
0xa3, 0x74, 0xab, 0xf0, 0xa3, 0x74, 0x05, 0xf0, 0xa3, 0x74, 0x29, 0xf0,
0xa3, 0x74, 0x04, 0xf0, 0xa3, 0x74, 0xac, 0xf0, 0xa3, 0x74, 0x02, 0xf0,
0xa3, 0x74, 0x0d, 0xf0, 0xa3, 0x74, 0x08, 0xf0, 0xa3, 0x74, 0x44, 0xf0,
0xa3, 0x74, 0x68, 0xf0, 0xa3, 0x74, 0x10, 0xf0, 0xa3, 0x74, 0x1a, 0xf0,
0xa3, 0x74, 0x93, 0xf0, 0xa3, 0x74, 0x01, 0xf0, 0x02, 0xc6, 0x2c, 0x90,
0x01, 0x88, 0xe0, 0x64, 0x40, 0x70, 0x71, 0x90, 0x01, 0x9c, 0x74, 0x54,
0xf0, 0xe4, 0xa3, 0xf0, 0x90, 0x01, 0xa0, 0x74, 0x02, 0xf0, 0x90, 0x01,
0x9f, 0x74, 0xd2, 0xf0, 0xe4, 0x90, 0x01, 0x9e, 0xf0, 0x90, 0x01, 0xa2,
0xf0, 0x90, 0x01, 0xa1, 0x74, 0x2a, 0xf0, 0x90, 0x01, 0xa3, 0x74, 0x14,
0xf0, 0xe4, 0xa3, 0xf0, 0xa3, 0xf0, 0xa3, 0x74, 0xd2, 0xf0, 0xa3, 0x74,
0x02, 0xf0, 0xa3, 0x74, 0x56, 0xf0, 0xa3, 0x74, 0x0a, 0xf0, 0xa3, 0x74,
0x52, 0xf0, 0xa3, 0x74, 0x08, 0xf0, 0xa3, 0x74, 0x58, 0xf0, 0xa3, 0x74,
0x04, 0xf0, 0xa3, 0x74, 0x1a, 0xf0, 0xa3, 0x74, 0x10, 0xf0, 0xa3, 0x74,
0x88, 0xf0, 0xa3, 0x74, 0xd0, 0xf0, 0xa3, 0x74, 0x20, 0xf0, 0xa3, 0x74,
0x34, 0xf0, 0xa3, 0x74, 0x26, 0xf0, 0xa3, 0x74, 0x03, 0xf0, 0x80, 0x74,
0x90, 0x01, 0x9c, 0x74, 0x7e, 0xf0, 0xa3, 0x74, 0x02, 0xf0, 0x90, 0x01,
0xa0, 0x74, 0x05, 0xf0, 0x90, 0x01, 0x9f, 0x74, 0x3b, 0xf0, 0x90, 0x01,
0x9e, 0x74, 0x01, 0xf0, 0x90, 0x01, 0xa2, 0xf0, 0x90, 0x01, 0xa1, 0x74,
0x3f, 0xf0, 0x90, 0x01, 0xa3, 0x74, 0x1f, 0xf0, 0xa3, 0x74, 0x80, 0xf0,
0xa3, 0x74, 0x01, 0xf0, 0xa3, 0x74, 0x3b, 0xf0, 0xa3, 0x74, 0x05, 0xf0,
0xa3, 0x74, 0x02, 0xf0, 0xa3, 0x74, 0x11, 0xf0, 0xa3, 0x74, 0x7b, 0xf0,
0xa3, 0x74, 0x0e, 0xf0, 0xa3, 0x74, 0x04, 0xf0, 0xa3, 0x74, 0x06, 0xf0,
0xa3, 0x74, 0x27, 0xf0, 0xa3, 0x74, 0x19, 0xf0, 0xa3, 0x74, 0xce, 0xf0,
0xa3, 0x74, 0x38, 0xf0, 0xa3, 0x74, 0x31, 0xf0, 0xa3, 0x74, 0x50, 0xf0,
0xa3, 0x74, 0xb9, 0xf0, 0xa3, 0x74, 0x04, 0xf0, 0x90, 0x01, 0x85, 0x74,
0x0e, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0x94, 0x34, 0xe0, 0x64, 0x55, 0x70,
0x65, 0x90, 0x01, 0xc8, 0x74, 0x04, 0xf0, 0x7b, 0x01, 0x7a, 0x95, 0x79,
0x02, 0x90, 0x01, 0xce, 0x74, 0x0c, 0xf0, 0x90, 0x01, 0xc8, 0xe0, 0xff,
0x90, 0x01, 0xcf, 0xe4, 0xf0, 0xa3, 0xef, 0xf0, 0x7d, 0x0e, 0x12, 0xec,
0x1d, 0x7b, 0x01, 0x7a, 0x94, 0x79, 0xca, 0x90, 0x01, 0xce, 0x74, 0x0c,
0xf0, 0x90, 0x01, 0xc8, 0xe0, 0xff, 0x90, 0x01, 0xcf, 0xe4, 0xf0, 0xa3,
0xef, 0xf0, 0x7d, 0x0e, 0x12, 0xec, 0x1d, 0x90, 0x94, 0x5a, 0x74, 0x1a,
0xf0, 0xa3, 0x04, 0xf0, 0x90, 0x94, 0x58, 0x74, 0x0d, 0xf0, 0xa3, 0xe4,
0xf0, 0x90, 0x94, 0x56, 0x74, 0x0d, 0xf0, 0xa3, 0xe4, 0xf0, 0x90, 0x94,
0x54, 0xf0, 0xa3, 0x74, 0x40, 0xf0, 0x90, 0x94, 0x34, 0xe0, 0xb4, 0x44,
0x0c, 0x90, 0x94, 0x8c, 0x74, 0x47, 0xf0, 0xa3, 0x74, 0x64, 0xf0, 0x80,
0x0a, 0x90, 0x94, 0x8c, 0x74, 0x37, 0xf0, 0xa3, 0x74, 0x63, 0xf0, 0x90,
0xe0, 0x00, 0xe0, 0x54, 0x80, 0x44, 0x40, 0x64, 0xc0, 0x60, 0x03, 0x02,
0xc1, 0x2b, 0x90, 0x94, 0x21, 0xe0, 0x54, 0xfe, 0xf0, 0x90, 0x01, 0x9c,
0xe0, 0x90, 0xe0, 0x17, 0xf0, 0x90, 0x01, 0x9d, 0xe0, 0x90, 0xe0, 0x18,
0xf0, 0x90, 0xe0, 0x04, 0x74, 0xe0, 0xf0, 0x90, 0x94, 0x85, 0xe0, 0x54,
0xfe, 0xf0, 0x90, 0x94, 0x84, 0xe0, 0x44, 0x80, 0xf0, 0x90, 0x94, 0xe2,
0xe4, 0xf0, 0xa3, 0x74, 0xf7, 0xf0, 0xa3, 0x74, 0x08, 0xf0, 0xa3, 0x74,
0x48, 0xf0, 0xa3, 0x74, 0x0b, 0xf0, 0xa3, 0x74, 0x13, 0xf0, 0x90, 0x94,
0xd0, 0x74, 0x83, 0xf0, 0xa3, 0x74, 0x02, 0xf0, 0xa3, 0xe4, 0xf0, 0xa3,
0x74, 0xc0, 0xf0, 0xa3, 0x74, 0x03, 0xf0, 0xa3, 0xe4, 0xf0, 0xa3, 0x74,
0xa3, 0xf0, 0xa3, 0xe4, 0xf0, 0xa3, 0xf0, 0xa3, 0xe0, 0x54, 0xf7, 0xf0,
0x90, 0x01, 0xaf, 0xe0, 0x90, 0xe0, 0x22, 0xf0, 0x90, 0x01, 0xae, 0xe0,
0x90, 0xe0, 0x2b, 0xf0, 0x90, 0x01, 0xad, 0xe0, 0x90, 0xe0, 0x21, 0xf0,
0x90, 0xe0, 0x04, 0x74, 0x10, 0xf0, 0x90, 0xe0, 0x03, 0x74, 0x22, 0xf0,
0x90, 0x01, 0x85, 0x74, 0x02, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0xe0, 0x00,
0xe0, 0x90, 0x01, 0xb6, 0xf0, 0xe0, 0x54, 0xc0, 0x64, 0xc0, 0x60, 0x0e,
0x90, 0xe0, 0x03, 0x74, 0x20, 0xf0, 0xe4, 0x90, 0x01, 0x85, 0xf0, 0x02,
0xc1, 0x2b, 0x90, 0x01, 0xb6, 0xe0, 0x20, 0xe3, 0x03, 0x02, 0xc1, 0x2b,
0x90, 0x94, 0x34, 0xe0, 0xb4, 0x55, 0x37, 0x7f, 0x80, 0x7e, 0x38, 0x7d,
0x01, 0x7c, 0x00, 0x12, 0xfd, 0x43, 0x7f, 0x80, 0x7e, 0x38, 0x7d, 0x01,
0x7c, 0x00, 0x12, 0xfd, 0x43, 0x7f, 0x80, 0x7e, 0x38, 0x7d, 0x01, 0x7c,
0x00, 0x12, 0xfd, 0x43, 0x7f, 0x80, 0x7e, 0x38, 0x7d, 0x01, 0x7c, 0x00,
0x12, 0xfd, 0x43, 0x7f, 0x80, 0x7e, 0x38, 0x7d, 0x01, 0x7c, 0x00, 0x12,
0xfd, 0x43, 0x90, 0xe0, 0x03, 0x74, 0x23, 0xf0, 0x90, 0x01, 0x85, 0x74,
0x03, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0xe0, 0x00, 0xe0, 0x90, 0x01, 0xb6,
0xf0, 0xe0, 0x54, 0xc0, 0x64, 0xc0, 0x60, 0x0e, 0x90, 0xe0, 0x03, 0x74,
0x20, 0xf0, 0xe4, 0x90, 0x01, 0x85, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0x94,
0x72, 0xe0, 0x54, 0xfd, 0xf0, 0x90, 0xe0, 0x03, 0x74, 0x36, 0xf0, 0x90,
0x01, 0x85, 0x74, 0x04, 0xf0, 0x02, 0xc1, 0x2b, 0xe4, 0x90, 0x01, 0xf3,
0xf0, 0x90, 0x01, 0xbb, 0xf0, 0x90, 0xe0, 0x00, 0xe0, 0x90, 0x01, 0xb6,
0xf0, 0xe0, 0x54, 0xc0, 0x64, 0xc0, 0x60, 0x0e, 0x90, 0xe0, 0x03, 0x74,
0x20, 0xf0, 0xe4, 0x90, 0x01, 0x85, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0x94,
0x80, 0xe0, 0x30, 0xe0, 0x08, 0x90, 0x94, 0x34, 0xe0, 0x64, 0x55, 0x60,
0x0f, 0x90, 0x94, 0x35, 0xe0, 0x64, 0xdd, 0x60, 0x1c, 0x90, 0x94, 0x80,
0xe0, 0x30, 0xe2, 0x15, 0x90, 0x01, 0x97, 0x74, 0x01, 0xf0, 0x90, 0xe0,
0x03, 0x74, 0x36, 0xf0, 0x90, 0x01, 0x85, 0x74, 0x04, 0xf0, 0x02, 0xc1,
0x2b, 0x90, 0x01, 0x97, 0xe0, 0x70, 0x0f, 0x90, 0xe0, 0x03, 0x74, 0x25,
0xf0, 0x90, 0x01, 0x85, 0x74, 0x05, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0x01,
0x97, 0xe0, 0x64, 0x01, 0x60, 0x03, 0x02, 0xc1, 0x2b, 0x90, 0xe0, 0x03,
0x74, 0x20, 0xf0, 0xe4, 0x90, 0x01, 0x85, 0xf0, 0x02, 0xc1, 0x2b, 0x90,
0xe0, 0x00, 0xe0, 0x90, 0x01, 0xb6, 0xf0, 0xe0, 0x54, 0xc0, 0x64, 0xc0,
0x70, 0x1e, 0x90, 0x94, 0x80, 0xe0, 0x30, 0xe0, 0x08, 0x90, 0x94, 0x34,
0xe0, 0x64, 0x55, 0x60, 0x0f, 0x90, 0x94, 0x35, 0xe0, 0x64, 0xdd, 0x60,
0x15, 0x90, 0x94, 0x80, 0xe0, 0x30, 0xe2, 0x0e, 0x90, 0xe0, 0x03, 0x74,
0x20, 0xf0, 0xe4, 0x90, 0x01, 0x85, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0x94,
0xe2, 0xe4, 0xf0, 0xa3, 0x74, 0xf7, 0xf0, 0x12, 0xf3, 0x0c, 0x90, 0x94,
0x85, 0x74, 0x06, 0xf0, 0x90, 0x94, 0xcc, 0xe0, 0x44, 0x22, 0xf0, 0xe0,
0x54, 0xdd, 0xf0, 0x90, 0x94, 0xc4, 0xe0, 0x44, 0x04, 0xf0, 0xe0, 0x54,
0xfb, 0xf0, 0xa3, 0xe0, 0x44, 0x40, 0xf0, 0xe0, 0x54, 0xbf, 0xf0, 0x90,
0x94, 0xcd, 0x74, 0x03, 0xf0, 0xa3, 0xe4, 0xf0, 0xa3, 0xf0, 0x90, 0x01,
0xc8, 0xe0, 0x14, 0x90, 0x94, 0xcd, 0xf0, 0x90, 0x01, 0x89, 0xe0, 0x24,
0x3f, 0xf5, 0x82, 0xe4, 0x34, 0x01, 0xf5, 0x83, 0xe0, 0x90, 0x94, 0xce,
0xf0, 0x90, 0x01, 0x89, 0xe0, 0x24, 0x15, 0xf5, 0x82, 0xe4, 0x34, 0x01,
0xf5, 0x83, 0xe0, 0x90, 0x94, 0xcf, 0xf0, 0x90, 0x94, 0x80, 0xe0, 0x30,
0xe0, 0x2e, 0x90, 0x01, 0xc8, 0xe0, 0x24, 0xfe, 0x90, 0x94, 0xcd, 0xf0,
0x90, 0x01, 0x89, 0xe0, 0x24, 0x33, 0xf5, 0x82, 0xe4, 0x34, 0x01, 0xf5,
0x83, 0xe0, 0x90, 0x94, 0xce, 0xf0, 0x90, 0x01, 0x89, 0xe0, 0x24, 0x0f,
0xf5, 0x82, 0xe4, 0x34, 0x01, 0xf5, 0x83, 0xe0, 0x90, 0x94, 0xcf, 0xf0,
0x90, 0x94, 0x80, 0xe0, 0x30, 0xe0, 0x58, 0x90, 0x01, 0xc8, 0xe0, 0x90,
0x94, 0xcd, 0xf0, 0x90, 0x01, 0x89, 0xe0, 0x24, 0x1b, 0xf5, 0x82, 0xe4,
0x34, 0x01, 0xf5, 0x83, 0xe0, 0x7d, 0x00, 0x25, 0xe0, 0xfc, 0x90, 0x01,
0x89, 0xe0, 0x24, 0x45, 0xf5, 0x82, 0xe4, 0x34, 0x01, 0xf5, 0x83, 0xe0,
0x25, 0xe0, 0xff, 0xe4, 0x33, 0xfe, 0xed, 0x2f, 0xff, 0xee, 0x3c, 0x90,
0x01, 0xef, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0xef, 0xe0, 0xa3, 0xe0,
0x90, 0x94, 0xce, 0xf0, 0x90, 0x01, 0xef, 0xe0, 0xfe, 0xa3, 0xe0, 0xee,
0xff, 0x33, 0x95, 0xe0, 0x90, 0x94, 0xcf, 0xef, 0xf0, 0x80, 0x2c, 0x90,
0x01, 0xc8, 0xe0, 0x90, 0x94, 0xcd, 0xf0, 0x90, 0x01, 0x89, 0xe0, 0x24,
0x45, 0xf5, 0x82, 0xe4, 0x34, 0x01, 0xf5, 0x83, 0xe0, 0x90, 0x94, 0xce,
0xf0, 0x90, 0x01, 0x89, 0xe0, 0x24, 0x1b, 0xf5, 0x82, 0xe4, 0x34, 0x01,
0xf5, 0x83, 0xe0, 0x90, 0x94, 0xcf, 0xf0, 0x90, 0x01, 0xc8, 0xe0, 0x04,
0x90, 0x94, 0xcd, 0xf0, 0x90, 0x01, 0x89, 0xe0, 0x24, 0x4b, 0xf5, 0x82,
0xe4, 0x34, 0x01, 0xf5, 0x83, 0xe0, 0x90, 0x94, 0xce, 0xf0, 0x90, 0x01,
0x89, 0xe0, 0x24, 0x21, 0xf5, 0x82, 0xe4, 0x34, 0x01, 0xf5, 0x83, 0xe0,
0x90, 0x94, 0xcf, 0xf0, 0x90, 0x01, 0x8a, 0xe0, 0x70, 0x73, 0x90, 0x01,
0x9a, 0xf0, 0x90, 0x01, 0x9a, 0xe0, 0xc3, 0x94, 0x04, 0x40, 0x03, 0x02,
0xcb, 0x81, 0xe4, 0x90, 0x01, 0x99, 0xf0, 0x90, 0x01, 0x99, 0xe0, 0xc3,
0x94, 0x08, 0x50, 0x1f, 0xa3, 0xe0, 0xff, 0xc4, 0x54, 0xf0, 0x44, 0x80,
0xff, 0x90, 0x01, 0x99, 0xe0, 0x4f, 0x90, 0x94, 0xcd, 0xf0, 0xa3, 0xe4,
0xf0, 0xa3, 0xf0, 0x90, 0x01, 0x99, 0xe0, 0x04, 0xf0, 0x80, 0xd8, 0x90,
0x01, 0x99, 0x74, 0x08, 0xf0, 0x90, 0x01, 0x99, 0xe0, 0xc3, 0x94, 0x10,
0x50, 0x1f, 0xa3, 0xe0, 0xff, 0xc4, 0x54, 0xf0, 0x44, 0x80, 0xff, 0x90,
0x01, 0x99, 0xe0, 0x4f, 0x90, 0x94, 0xcd, 0xf0, 0xa3, 0xe4, 0xf0, 0xa3,
0xf0, 0x90, 0x01, 0x99, 0xe0, 0x04, 0xf0, 0x80, 0xd8, 0x90, 0x01, 0x9a,
0xe0, 0x04, 0xf0, 0x80, 0x91, 0x90, 0x01, 0x8a, 0xe0, 0x64, 0x01, 0x60,
0x03, 0x02, 0xcb, 0x81, 0x90, 0x01, 0x9a, 0xf0, 0x90, 0x01, 0x9a, 0xe0,
0xc3, 0x94, 0x04, 0x40, 0x03, 0x02, 0xcb, 0x81, 0xe4, 0x90, 0x01, 0x99,
0xf0, 0x90, 0x01, 0x99, 0xe0, 0xc3, 0x94, 0x08, 0x50, 0x51, 0xa3, 0xe0,
0xff, 0xc4, 0x54, 0xf0, 0x44, 0x80, 0xff, 0x90, 0x01, 0x99, 0xe0, 0x4f,
0x90, 0x94, 0xcd, 0xf0, 0xa3, 0x74, 0x40, 0xf0, 0xa3, 0xe4, 0xf0, 0x90,
0x01, 0x99, 0xe0, 0x25, 0xe0, 0x24, 0x5d, 0xf5, 0x82, 0xe4, 0x34, 0x01,
0xf5, 0x83, 0xe0, 0xa3, 0xe0, 0x90, 0x94, 0xce, 0xf0, 0x90, 0x01, 0x99,
0xe0, 0x25, 0xe0, 0x24, 0x5d, 0xf5, 0x82, 0xe4, 0x34, 0x01, 0xf5, 0x83,
0xe0, 0xfe, 0xa3, 0xe0, 0xee, 0x54, 0x0f, 0x90, 0x94, 0xcf, 0xf0, 0x90,
0x01, 0x99, 0xe0, 0x04, 0xf0, 0x80, 0xa6, 0x90, 0x01, 0x99, 0x74, 0x08,
0xf0, 0x90, 0x01, 0x99, 0xe0, 0xc3, 0x94, 0x10, 0x50, 0x52, 0xa3, 0xe0,
0xff, 0xc4, 0x54, 0xf0, 0x44, 0x80, 0xff, 0x90, 0x01, 0x99, 0xe0, 0x4f,
0x90, 0x94, 0xcd, 0xf0, 0xa3, 0x74, 0xc0, 0xf0, 0xa3, 0x74, 0x0f, 0xf0,
0x90, 0x01, 0x99, 0xe0, 0x25, 0xe0, 0x24, 0x5d, 0xf5, 0x82, 0xe4, 0x34,
0x01, 0xf5, 0x83, 0xe0, 0xa3, 0xe0, 0x90, 0x94, 0xce, 0xf0, 0x90, 0x01,
0x99, 0xe0, 0x25, 0xe0, 0x24, 0x5d, 0xf5, 0x82, 0xe4, 0x34, 0x01, 0xf5,
0x83, 0xe0, 0xfe, 0xa3, 0xe0, 0xee, 0x54, 0x0f, 0x90, 0x94, 0xcf, 0xf0,
0x90, 0x01, 0x99, 0xe0, 0x04, 0xf0, 0x80, 0xa5, 0x90, 0x01, 0x9a, 0xe0,
0x04, 0xf0, 0x02, 0xca, 0xac, 0x90, 0x01, 0x86, 0xe0, 0x90, 0x94, 0xa2,
0xf0, 0x90, 0x01, 0x87, 0xe0, 0x90, 0x94, 0xa3, 0xf0, 0x90, 0x94, 0x86,
0x74, 0x01, 0xf0, 0xa3, 0x74, 0x22, 0xf0, 0x90, 0x94, 0x84, 0x74, 0x80,
0xf0, 0xa3, 0x74, 0x06, 0xf0, 0x90, 0x94, 0x84, 0x74, 0x80, 0xf0, 0xa3,
0x74, 0x04, 0xf0, 0x90, 0x01, 0x8b, 0xe0, 0x70, 0x08, 0x90, 0xe0, 0x02,
0x74, 0x0e, 0xf0, 0x80, 0x0d, 0x90, 0x01, 0x8b, 0xe0, 0xb4, 0x01, 0x06,
0x90, 0xe0, 0x02, 0x74, 0x4e, 0xf0, 0x90, 0x01, 0xa1, 0xe0, 0x25, 0xe0,
0x90, 0xe0, 0x17, 0xf0, 0x90, 0x01, 0xa2, 0xe0, 0x25, 0xe0, 0x90, 0xe0,
0x18, 0xf0, 0x90, 0xe0, 0x04, 0x74, 0xe0, 0xf0, 0x90, 0x01, 0x85, 0x74,
0x0f, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0xe0, 0x00, 0xe0, 0x90, 0x01, 0xb6,
0xf0, 0xe0, 0x54, 0xc0, 0x64, 0xc0, 0x70, 0x1e, 0x90, 0x94, 0x80, 0xe0,
0x30, 0xe0, 0x08, 0x90, 0x94, 0x34, 0xe0, 0x64, 0x55, 0x60, 0x0f, 0x90,
0x94, 0x35, 0xe0, 0x64, 0xdd, 0x60, 0x15, 0x90, 0x94, 0x80, 0xe0, 0x30,
0xe2, 0x0e, 0x90, 0xe0, 0x03, 0x74, 0x20, 0xf0, 0xe4, 0x90, 0x01, 0x85,
0xf0, 0x02, 0xc1, 0x2b, 0x90, 0x01, 0xb6, 0xe0, 0x20, 0xe4, 0x03, 0x02,
0xc1, 0x2b, 0x90, 0x01, 0x8b, 0xe0, 0xb4, 0x01, 0x06, 0x90, 0xe0, 0x02,
0x74, 0x0e, 0xf0, 0x90, 0x01, 0xa1, 0xe0, 0x25, 0xe0, 0x90, 0xe0, 0x17,
0xf0, 0x90, 0x01, 0xa2, 0xe0, 0x25, 0xe0, 0x90, 0xe0, 0x18, 0xf0, 0x90,
0xe0, 0x04, 0x74, 0xe0, 0xf0, 0x90, 0x01, 0xa1, 0xe0, 0x25, 0xe0, 0x90,
0xe0, 0x17, 0xf0, 0x90, 0x01, 0xa2, 0xe0, 0x25, 0xe0, 0x90, 0xe0, 0x18,
0xf0, 0x90, 0xe0, 0x04, 0x74, 0xe0, 0xf0, 0x90, 0x01, 0xa1, 0xe0, 0x25,
0xe0, 0x90, 0xe0, 0x17, 0xf0, 0x90, 0x01, 0xa2, 0xe0, 0x25, 0xe0, 0x90,
0xe0, 0x18, 0xf0, 0x90, 0xe0, 0x04, 0x74, 0xe0, 0xf0, 0x90, 0xe0, 0x03,
0x74, 0x27, 0xf0, 0x90, 0x01, 0x85, 0x74, 0x08, 0xf0, 0x02, 0xc1, 0x2b,
0x90, 0xe0, 0x00, 0xe0, 0x90, 0x01, 0xb6, 0xf0, 0xe0, 0x54, 0xc0, 0x64,
0xc0, 0x70, 0x1e, 0x90, 0x94, 0x80, 0xe0, 0x30, 0xe0, 0x08, 0x90, 0x94,
0x34, 0xe0, 0x64, 0x55, 0x60, 0x0f, 0x90, 0x94, 0x35, 0xe0, 0x64, 0xdd,
0x60, 0x15, 0x90, 0x94, 0x80, 0xe0, 0x30, 0xe2, 0x0e, 0x90, 0xe0, 0x03,
0x74, 0x20, 0xf0, 0xe4, 0x90, 0x01, 0x85, 0xf0, 0x02, 0xc1, 0x2b, 0x90,
0x01, 0xb6, 0xe0, 0x20, 0xe4, 0x03, 0x02, 0xc1, 0x2b, 0x90, 0x94, 0x85,
0xe0, 0x44, 0x40, 0xf0, 0x90, 0x01, 0xa1, 0xe0, 0x90, 0xe0, 0x17, 0xf0,
0x90, 0x01, 0xa2, 0xe0, 0x90, 0xe0, 0x18, 0xf0, 0x90, 0xe0, 0x04, 0x74,
0xe0, 0xf0, 0x90, 0x01, 0xa1, 0xe0, 0x90, 0xe0, 0x17, 0xf0, 0x90, 0x01,
0xa2, 0xe0, 0x90, 0xe0, 0x18, 0xf0, 0x90, 0xe0, 0x04, 0x74, 0xe0, 0xf0,
0x90, 0xe0, 0x03, 0x74, 0x2a, 0xf0, 0x90, 0x01, 0x85, 0x74, 0x09, 0xf0,
0x02, 0xc1, 0x2b, 0x90, 0xe0, 0x00, 0xe0, 0x90, 0x01, 0xb6, 0xf0, 0xe0,
0x54, 0xc0, 0x64, 0xc0, 0x70, 0x1e, 0x90, 0x94, 0x80, 0xe0, 0x30, 0xe0,
0x08, 0x90, 0x94, 0x34, 0xe0, 0x64, 0x55, 0x60, 0x0f, 0x90, 0x94, 0x35,
0xe0, 0x64, 0xdd, 0x60, 0x15, 0x90, 0x94, 0x80, 0xe0, 0x30, 0xe2, 0x0e,
0x90, 0xe0, 0x03, 0x74, 0x20, 0xf0, 0xe4, 0x90, 0x01, 0x85, 0xf0, 0x02,
0xc1, 0x2b, 0x90, 0x01, 0xb6, 0xe0, 0x20, 0xe4, 0x03, 0x02, 0xc1, 0x2b,
0x90, 0xe0, 0x02, 0x74, 0x08, 0xf0, 0x90, 0x94, 0xd9, 0xe0, 0x44, 0x01,
0xf0, 0xe0, 0x54, 0xfe, 0xf0, 0x90, 0x94, 0xc8, 0x74, 0x04, 0xf0, 0xa3,
0xe4, 0xf0, 0xa3, 0xf0, 0xa3, 0xe0, 0x54, 0xfd, 0xf0, 0x90, 0x94, 0x21,
0xe0, 0x54, 0xf7, 0xf0, 0x90, 0x01, 0xa1, 0xe0, 0x90, 0xe0, 0x17, 0xf0,
0x90, 0x01, 0xa2, 0xe0, 0x90, 0xe0, 0x18, 0xf0, 0x90, 0xe0, 0x04, 0x74,
0xe0, 0xf0, 0x90, 0xe0, 0x03, 0x74, 0x33, 0xf0, 0x90, 0x01, 0x85, 0x74,
0x0a, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0xe0, 0x00, 0xe0, 0x90, 0x01, 0xb6,
0xf0, 0x90, 0x94, 0x85, 0xe0, 0x44, 0x40, 0xf0, 0x90, 0x01, 0xb6, 0xe0,
0x54, 0xc0, 0x64, 0xc0, 0x70, 0x1e, 0x90, 0x94, 0x80, 0xe0, 0x30, 0xe0,
0x08, 0x90, 0x94, 0x34, 0xe0, 0x64, 0x55, 0x60, 0x0f, 0x90, 0x94, 0x35,
0xe0, 0x64, 0xdd, 0x60, 0x15, 0x90, 0x94, 0x80, 0xe0, 0x30, 0xe2, 0x0e,
0x90, 0xe0, 0x03, 0x74, 0x20, 0xf0, 0xe4, 0x90, 0x01, 0x85, 0xf0, 0x02,
0xc1, 0x2b, 0x90, 0x01, 0xb6, 0xe0, 0x20, 0xe4, 0x03, 0x02, 0xce, 0xc9,
0x90, 0x01, 0x94, 0xe0, 0x64, 0x01, 0x60, 0x03, 0x02, 0xce, 0xc9, 0xa3,
0xe0, 0x64, 0x01, 0x60, 0x03, 0x02, 0xce, 0xc9, 0x90, 0x01, 0x8c, 0xf0,
0x90, 0x94, 0xfc, 0xe4, 0xf0, 0xf0, 0x90, 0x94, 0xff, 0xe0, 0x70, 0x15,
0x90, 0x94, 0xfe, 0xe0, 0x70, 0x0f, 0x90, 0x94, 0xfd, 0xe0, 0xd3, 0x94,
0x18, 0x50, 0x06, 0x90, 0x01, 0x8c, 0x74, 0x01, 0xf0, 0xe4, 0x90, 0x01,
0x00, 0xf0, 0x90, 0x01, 0x7d, 0xe0, 0xb4, 0x01, 0x03, 0x12, 0xf0, 0x71,
0x90, 0x94, 0xe0, 0xe0, 0x54, 0x03, 0x64, 0x03, 0x60, 0x1c, 0x90, 0x94,
0x30, 0xe0, 0xff, 0x90, 0x94, 0xa0, 0xe0, 0xd3, 0x9f, 0x50, 0x0f, 0x90,
0x01, 0x8c, 0xe0, 0x64, 0x01, 0x60, 0x07, 0x90, 0x01, 0x00, 0xe0, 0xb4,
0x01, 0x0e, 0x90, 0xe0, 0x03, 0x74, 0x20, 0xf0, 0xe4, 0x90, 0x01, 0x85,
0xf0, 0x02, 0xc1, 0x2b, 0x90, 0x01, 0x96, 0xe0, 0x64, 0x01, 0x70, 0x28,
0x90, 0x01, 0x8d, 0xe0, 0x90, 0x94, 0x33, 0xf0, 0x90, 0x01, 0x8e, 0xe0,
0x90, 0x94, 0x32, 0xf0, 0x90, 0x01, 0x8f, 0xe0, 0x90, 0x94, 0x35, 0xf0,
0x90, 0x01, 0x90, 0xe0, 0x90, 0x94, 0x34, 0xf0, 0x90, 0x01, 0x91, 0xe0,
0x90, 0x94, 0x37, 0xf0, 0x90, 0x94, 0xc5, 0xe4, 0xf0, 0x90, 0x94, 0xc4,
0xf0, 0x90, 0x94, 0xcb, 0xe0, 0x54, 0xfd, 0xf0, 0x90, 0x01, 0x85, 0x74,
0x0d, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0x01, 0xb6, 0xe0, 0x20, 0xe4, 0x03,
0x02, 0xc1, 0x2b, 0xe4, 0x90, 0x01, 0x8c, 0xf0, 0x90, 0x94, 0xfc, 0xe4,
0xf0, 0xf0, 0x90, 0x94, 0xff, 0xe0, 0x70, 0x15, 0x90, 0x94, 0xfe, 0xe0,
0x70, 0x0f, 0x90, 0x94, 0xfd, 0xe0, 0xd3, 0x94, 0x18, 0x50, 0x06, 0x90,
0x01, 0x8c, 0x74, 0x01, 0xf0, 0xe4, 0x90, 0x01, 0x00, 0xf0, 0x90, 0x01,
0x7d, 0xe0, 0xb4, 0x01, 0x03, 0x12, 0xf0, 0x71, 0x90, 0x94, 0xe0, 0xe0,
0x54, 0x03, 0x64, 0x03, 0x60, 0x20, 0x90, 0x94, 0x30, 0xe0, 0xff, 0x90,
0x94, 0xa0, 0xe0, 0xd3, 0x9f, 0x50, 0x13, 0x90, 0x01, 0x8c, 0xe0, 0x64,
0x01, 0x60, 0x0b, 0x90, 0x01, 0x00, 0xe0, 0x64, 0x01, 0x60, 0x03, 0x02,
0xcf, 0xe9, 0x90, 0x01, 0x94, 0xe0, 0x70, 0x0f, 0x90, 0xe0, 0x03, 0x74,
0x29, 0xf0, 0x90, 0x01, 0x85, 0x74, 0x0b, 0xf0, 0x02, 0xc1, 0x2b, 0x90,
0x01, 0x94, 0xe0, 0x64, 0x01, 0x70, 0x31, 0x90, 0x01, 0x07, 0xe0, 0xff,
0x90, 0x01, 0x89, 0xe0, 0x6f, 0x70, 0x25, 0xa3, 0xe0, 0xb4, 0x01, 0x20,
0x90, 0x01, 0x0e, 0xe0, 0xff, 0x90, 0x01, 0x87, 0xe0, 0xb5, 0x07, 0x14,
0x90, 0x01, 0x86, 0xe0, 0xb4, 0x02, 0x0d, 0x90, 0x01, 0x8b, 0xe0, 0xb4,
0x01, 0x06, 0x90, 0x01, 0x95, 0x74, 0x01, 0xf0, 0x90, 0x01, 0x94, 0xe0,
0xb4, 0x01, 0x13, 0xa3, 0xe0, 0x70, 0x0f, 0x90, 0xe0, 0x03, 0x74, 0x29,
0xf0, 0x90, 0x01, 0x85, 0x74, 0x0b, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0x01,
0x94, 0xe0, 0x64, 0x01, 0x60, 0x03, 0x02, 0xc1, 0x2b, 0xa3, 0xe0, 0x64,
0x01, 0x60, 0x03, 0x02, 0xc1, 0x2b, 0x90, 0x01, 0x8d, 0xe0, 0x90, 0x01,
0x89, 0xf0, 0x90, 0x01, 0x8e, 0xe0, 0x90, 0x01, 0x8a, 0xf0, 0x90, 0x01,
0x8f, 0xe0, 0x90, 0x01, 0x87, 0xf0, 0x90, 0x01, 0x90, 0xe0, 0x90, 0x01,
0x86, 0xf0, 0x90, 0x01, 0x91, 0xe0, 0x90, 0x01, 0x8b, 0xf0, 0x90, 0xe0,
0x02, 0x74, 0x5f, 0xf0, 0xa3, 0x74, 0x25, 0xf0, 0x90, 0x01, 0x85, 0x74,
0x05, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0xe0, 0x03, 0x74, 0x2c, 0xf0, 0x90,
0x01, 0x85, 0x74, 0x0c, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0x01, 0x87, 0xe0,
0x04, 0xf0, 0x90, 0x01, 0x0e, 0xe0, 0xff, 0x90, 0x01, 0x87, 0xe0, 0xd3,
0x9f, 0x40, 0x3b, 0xe4, 0xf0, 0x90, 0x01, 0x89, 0xe0, 0x04, 0xf0, 0x90,
0x01, 0x07, 0xe0, 0xff, 0x90, 0x01, 0x89, 0xe0, 0xd3, 0x9f, 0x40, 0x26,
0xe4, 0xf0, 0xa3, 0xe0, 0x04, 0xf0, 0xe0, 0xd3, 0x94, 0x01, 0x40, 0x1a,
0xe4, 0xf0, 0xa3, 0xe0, 0x04, 0xf0, 0xe0, 0xd3, 0x94, 0x01, 0x40, 0x0e,
0x90, 0xe0, 0x03, 0x74, 0x20, 0xf0, 0xe4, 0x90, 0x01, 0x85, 0xf0, 0x02,
0xc1, 0x2b, 0x90, 0xe0, 0x02, 0x74, 0x5f, 0xf0, 0xa3, 0x74, 0x25, 0xf0,
0x90, 0x01, 0x85, 0x74, 0x05, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0x01, 0x94,
0xe0, 0x70, 0x5e, 0x90, 0x01, 0x96, 0xe0, 0x64, 0x01, 0x70, 0x46, 0x90,
0x01, 0x89, 0xe0, 0x90, 0x94, 0x33, 0xf0, 0x90, 0x01, 0x8a, 0xe0, 0x90,
0x94, 0x32, 0xf0, 0x90, 0x01, 0x87, 0xe0, 0x90, 0x94, 0x35, 0xf0, 0x90,
0x01, 0x86, 0xe0, 0x90, 0x94, 0x34, 0xf0, 0x90, 0x01, 0x8b, 0xe0, 0x90,
0x94, 0x37, 0xf0, 0x90, 0x94, 0xfc, 0xe4, 0xf0, 0xf0, 0x90, 0x94, 0xfe,
0xe0, 0x90, 0x94, 0x36, 0xf0, 0x90, 0x94, 0xfd, 0xe0, 0x90, 0x94, 0x39,
0xf0, 0x90, 0x94, 0xfc, 0xe0, 0x90, 0x94, 0x38, 0xf0, 0x90, 0x94, 0xcb,
0xe0, 0x54, 0xfd, 0xf0, 0x90, 0x01, 0x85, 0x74, 0x0d, 0xf0, 0x02, 0xc1,
0x2b, 0x90, 0x01, 0x94, 0xe0, 0x64, 0x01, 0x60, 0x03, 0x02, 0xc1, 0x2b,
0x90, 0x94, 0xfc, 0xf0, 0xf0, 0x90, 0x94, 0xff, 0xe0, 0x70, 0x60, 0x90,
0x01, 0x92, 0xe0, 0xff, 0x90, 0x94, 0xfe, 0xe0, 0xc3, 0x9f, 0x40, 0x1b,
0xa3, 0xe0, 0x70, 0x4f, 0x90, 0x01, 0x92, 0xe0, 0x90, 0x94, 0xfe, 0xe0,
0x6f, 0x70, 0x44, 0x90, 0x01, 0x93, 0xe0, 0xff, 0x90, 0x94, 0xfd, 0xe0,
0x9f, 0x50, 0x38, 0x90, 0x94, 0xfe, 0xe0, 0x90, 0x01, 0x92, 0xf0, 0x90,
0x94, 0xfd, 0xe0, 0x90, 0x01, 0x93, 0xf0, 0x90, 0x01, 0x89, 0xe0, 0x90,
0x01, 0x8d, 0xf0, 0x90, 0x01, 0x8a, 0xe0, 0x90, 0x01, 0x8e, 0xf0, 0x90,
0x01, 0x87, 0xe0, 0x90, 0x01, 0x8f, 0xf0, 0x90, 0x01, 0x86, 0xe0, 0x90,
0x01, 0x90, 0xf0, 0x90, 0x01, 0x8b, 0xe0, 0x90, 0x01, 0x91, 0xf0, 0x90,
0x01, 0x07, 0xe0, 0xff, 0x90, 0x01, 0x89, 0xe0, 0x6f, 0x70, 0x25, 0xa3,
0xe0, 0xb4, 0x01, 0x20, 0x90, 0x01, 0x0e, 0xe0, 0xff, 0x90, 0x01, 0x87,
0xe0, 0xb5, 0x07, 0x14, 0x90, 0x01, 0x86, 0xe0, 0xb4, 0x02, 0x0d, 0x90,
0x01, 0x8b, 0xe0, 0xb4, 0x01, 0x06, 0x90, 0x01, 0x95, 0x74, 0x01, 0xf0,
0x90, 0x01, 0x95, 0xe0, 0x70, 0x0f, 0x90, 0xe0, 0x03, 0x74, 0x29, 0xf0,
0x90, 0x01, 0x85, 0x74, 0x0b, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0x01, 0x95,
0xe0, 0x64, 0x01, 0x60, 0x03, 0x02, 0xc1, 0x2b, 0x90, 0x01, 0x8d, 0xe0,
0x90, 0x01, 0x89, 0xf0, 0x90, 0x01, 0x8e, 0xe0, 0x90, 0x01, 0x8a, 0xf0,
0x90, 0x01, 0x8f, 0xe0, 0x90, 0x01, 0x87, 0xf0, 0x90, 0x01, 0x90, 0xe0,
0x90, 0x01, 0x86, 0xf0, 0x90, 0x01, 0x91, 0xe0, 0x90, 0x01, 0x8b, 0xf0,
0x90, 0xe0, 0x02, 0x74, 0x5f, 0xf0, 0xa3, 0x74, 0x25, 0xf0, 0x90, 0x01,
0x85, 0x74, 0x05, 0xf0, 0x02, 0xc1, 0x2b, 0x90, 0x01, 0xf3, 0xe0, 0x60,
0x03, 0x02, 0xd4, 0xbd, 0x7b, 0x01, 0x7a, 0x95, 0x79, 0x1e, 0x90, 0x01,
0xce, 0xf0, 0xa3, 0xf0, 0xa3, 0xf0, 0x7d, 0x09, 0x12, 0xec, 0x1d, 0x90,
0x01, 0xc2, 0xe0, 0x60, 0x2e, 0x7b, 0x01, 0x7a, 0x94, 0x79, 0xc4, 0xe4,
0x90, 0x01, 0xce, 0xf0, 0xa3, 0xf0, 0xa3, 0x74, 0x03, 0xf0, 0x7d, 0x01,
0x12, 0xec, 0x1d, 0x7b, 0x01, 0x7a, 0x94, 0x79, 0xc4, 0x90, 0x01, 0xce,
0x74, 0x0c, 0xf0, 0xa3, 0xe4, 0xf0, 0xa3, 0x74, 0x03, 0xf0, 0x7d, 0x0d,
0x12, 0xec, 0x1d, 0xe4, 0x90, 0x01, 0xbc, 0xf0, 0x90, 0x94, 0x84, 0x74,
0x80, 0xf0, 0xa3, 0x74, 0x04, 0xf0, 0xe4, 0x90, 0x01, 0x99, 0xf0, 0x90,
0x01, 0x99, 0xe0, 0xc3, 0x94, 0x32, 0x50, 0x2d, 0x90, 0x01, 0xa0, 0xe0,
0x90, 0xe0, 0x22, 0xf0, 0x90, 0x01, 0x9f, 0xe0, 0x90, 0xe0, 0x2b, 0xf0,
0x90, 0x01, 0x9e, 0xe0, 0x90, 0xe0, 0x21, 0xf0, 0x90, 0xe0, 0x04, 0x74,
0x10, 0xf0, 0x90, 0xe0, 0x00, 0xe0, 0x20, 0xe3, 0xf9, 0x90, 0x01, 0x99,
0xe0, 0x04, 0xf0, 0x80, 0xca, 0xe4, 0x90, 0x01, 0x99, 0xf0, 0x90, 0x01,
0x99, 0xe0, 0xc3, 0x94, 0x96, 0x50, 0x2d, 0x90, 0x01, 0xa0, 0xe0, 0x90,
0xe0, 0x22, 0xf0, 0x90, 0x01, 0x9f, 0xe0, 0x90, 0xe0, 0x2b, 0xf0, 0x90,
0x01, 0x9e, 0xe0, 0x90, 0xe0, 0x21, 0xf0, 0x90, 0xe0, 0x04, 0x74, 0x10,
0xf0, 0x90, 0xe0, 0x00, 0xe0, 0x20, 0xe3, 0xf9, 0x90, 0x01, 0x99, 0xe0,
0x04, 0xf0, 0x80, 0xca, 0x90, 0x94, 0xe2, 0x74, 0x03, 0xf0, 0xa3, 0x74,
0x37, 0xf0, 0xe4, 0x90, 0x01, 0x99, 0xf0, 0x90, 0x01, 0x99, 0xe0, 0xc3,
0x94, 0x50, 0x50, 0x2d, 0x90, 0x01, 0xa0, 0xe0, 0x90, 0xe0, 0x22, 0xf0,
0x90, 0x01, 0x9f, 0xe0, 0x90, 0xe0, 0x2b, 0xf0, 0x90, 0x01, 0x9e, 0xe0,
0x90, 0xe0, 0x21, 0xf0, 0x90, 0xe0, 0x04, 0x74, 0x10, 0xf0, 0x90, 0xe0,
0x00, 0xe0, 0x20, 0xe3, 0xf9, 0x90, 0x01, 0x99, 0xe0, 0x04, 0xf0, 0x80,
0xca, 0x90, 0x94, 0xa2, 0x74, 0x03, 0xf0, 0xa3, 0xe0, 0xf0, 0xe4, 0x90,
0x01, 0x9b, 0xf0, 0x90, 0x01, 0x9b, 0xe0, 0xc3, 0x94, 0x03, 0x50, 0x43,
0xe4, 0x90, 0x01, 0x99, 0xf0, 0x90, 0x01, 0x99, 0xe0, 0xc3, 0x94, 0x96,
0x50, 0x2d, 0x90, 0x01, 0xa0, 0xe0, 0x90, 0xe0, 0x22, 0xf0, 0x90, 0x01,
0x9f, 0xe0, 0x90, 0xe0, 0x2b, 0xf0, 0x90, 0x01, 0x9e, 0xe0, 0x90, 0xe0,
0x21, 0xf0, 0x90, 0xe0, 0x04, 0x74, 0x10, 0xf0, 0x90, 0xe0, 0x00, 0xe0,
0x20, 0xe3, 0xf9, 0x90, 0x01, 0x99, 0xe0, 0x04, 0xf0, 0x80, 0xca, 0x90,
0x01, 0x9b, 0xe0, 0x04, 0xf0, 0x80, 0xb4, 0x90, 0x94, 0x34, 0xe0, 0xb4,
0x44, 0x0c, 0x90, 0x94, 0x8c, 0x74, 0x47, 0xf0, 0xa3, 0x74, 0x64, 0xf0,
0x80, 0x0a, 0x90, 0x94, 0x8c, 0x74, 0x37, 0xf0, 0xa3, 0x74, 0x63, 0xf0,
0xe4, 0x90, 0x01, 0x99, 0xf0, 0x90, 0x01, 0x99, 0xe0, 0xc3, 0x94, 0x96,
0x50, 0x2d, 0x90, 0x01, 0xa0, 0xe0, 0x90, 0xe0, 0x22, 0xf0, 0x90, 0x01,
0x9f, 0xe0, 0x90, 0xe0, 0x2b, 0xf0, 0x90, 0x01, 0x9e, 0xe0, 0x90, 0xe0,
0x21, 0xf0, 0x90, 0xe0, 0x04, 0x74, 0x10, 0xf0, 0x90, 0xe0, 0x00, 0xe0,
0x20, 0xe3, 0xf9, 0x90, 0x01, 0x99, 0xe0, 0x04, 0xf0, 0x80, 0xca, 0xe4,
0x90, 0x01, 0x99, 0xf0, 0x90, 0x01, 0x99, 0xe0, 0xc3, 0x94, 0x96, 0x50,
0x2d, 0x90, 0x01, 0xa0, 0xe0, 0x90, 0xe0, 0x22, 0xf0, 0x90, 0x01, 0x9f,
0xe0, 0x90, 0xe0, 0x2b, 0xf0, 0x90, 0x01, 0x9e, 0xe0, 0x90, 0xe0, 0x21,
0xf0, 0x90, 0xe0, 0x04, 0x74, 0x10, 0xf0, 0x90, 0xe0, 0x00, 0xe0, 0x20,
0xe3, 0xf9, 0x90, 0x01, 0x99, 0xe0, 0x04, 0xf0, 0x80, 0xca, 0x90, 0x94,
0xe4, 0x74, 0x04, 0xf0, 0xa3, 0x74, 0x48, 0xf0, 0xe4, 0x90, 0x01, 0x9a,
0xf0, 0x90, 0x01, 0x9a, 0xe0, 0xc3, 0x94, 0x02, 0x50, 0x43, 0xe4, 0x90,
0x01, 0x99, 0xf0, 0x90, 0x01, 0x99, 0xe0, 0xc3, 0x94, 0x96, 0x50, 0x2d,
0x90, 0x01, 0xa0, 0xe0, 0x90, 0xe0, 0x22, 0xf0, 0x90, 0x01, 0x9f, 0xe0,
0x90, 0xe0, 0x2b, 0xf0, 0x90, 0x01, 0x9e, 0xe0, 0x90, 0xe0, 0x21, 0xf0,
0x90, 0xe0, 0x04, 0x74, 0x10, 0xf0, 0x90, 0xe0, 0x00, 0xe0, 0x20, 0xe3,
0xf9, 0x90, 0x01, 0x99, 0xe0, 0x04, 0xf0, 0x80, 0xca, 0x90, 0x01, 0x9a,
0xe0, 0x04, 0xf0, 0x80, 0xb4, 0x90, 0x94, 0xe2, 0x74, 0x0f, 0xf0, 0xa3,
0x74, 0x37, 0xf0, 0xe4, 0x90, 0x01, 0xe6, 0xf0, 0xa3, 0xf0, 0x90, 0x01,
0x99, 0xf0, 0x90, 0x01, 0x99, 0xe0, 0xc3, 0x94, 0x10, 0x50, 0x35, 0x90,
0x94, 0xe2, 0x74, 0x0f, 0xf0, 0xa3, 0x74, 0x37, 0xf0, 0x90, 0x94, 0xef,
0xe0, 0x54, 0x1f, 0x75, 0xf0, 0x10, 0xa4, 0xff, 0x90, 0x94, 0xee, 0xe0,
0xfd, 0xc4, 0x54, 0x0f, 0xfd, 0xe5, 0xf0, 0xef, 0x4d, 0xff, 0x90, 0x01,
0xe6, 0xe5, 0xf0, 0x8f, 0xf0, 0x12, 0xef, 0xf8, 0x90, 0x01, 0x99, 0xe0,
0x04, 0xf0, 0x80, 0xc2, 0x90, 0x01, 0xe6, 0xe0, 0xfe, 0xa3, 0xe0, 0x78,
0x04, 0xce, 0xa2, 0xe7, 0x13, 0xce, 0x13, 0xd8, 0xf8, 0xff, 0x90, 0x01,
0xe6, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0xe6, 0xe0, 0xa3, 0xe0,
0x54, 0x0f, 0xff, 0xc4, 0x54, 0xf0, 0x44, 0x08, 0x90, 0x94, 0xe4, 0xf0,
0x90, 0x01, 0xe6, 0xe0, 0xfe, 0xa3, 0xe0, 0x78, 0x04, 0xce, 0xa2, 0xe7,
0x13, 0xce, 0x13, 0xd8, 0xf8, 0x44, 0x40, 0x90, 0x94, 0xe5, 0xf0, 0x90,
0x01, 0xf3, 0x74, 0x01, 0xf0, 0x90, 0x01, 0xc2, 0xe0, 0x60, 0x03, 0x02,
0xd7, 0x81, 0x90, 0x94, 0x34, 0xe0, 0x64, 0x44, 0x70, 0x03, 0x02, 0xd7,
0x81, 0x90, 0x01, 0xbc, 0xe0, 0xc3, 0x94, 0x64, 0x50, 0x03, 0xe0, 0x04,
0xf0, 0x90, 0x01, 0xbc, 0xe0, 0x64, 0x64, 0x60, 0x03, 0x02, 0xd7, 0x81,
0x90, 0x01, 0xeb, 0xf0, 0xa3, 0xf0, 0x90, 0x94, 0x85, 0xe0, 0x44, 0x30,
0xf0, 0x90, 0x94, 0x9b, 0xe0, 0xfe, 0x90, 0x94, 0x9a, 0xe0, 0xfd, 0xee,
0xed, 0xff, 0x90, 0x01, 0xe9, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01,
0xe9, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x01, 0xf4, 0xee, 0xf0, 0xa3,
0xef, 0xf0, 0x90, 0x01, 0xe9, 0xe0, 0xa3, 0xe0, 0x90, 0x01, 0xf1, 0xee,
0xf0, 0xa3, 0xef, 0xf0, 0xe4, 0x90, 0x01, 0x99, 0xf0, 0x90, 0x01, 0x99,
0xe0, 0xc3, 0x94, 0x64, 0x50, 0x7a, 0x90, 0x94, 0x85, 0xe0, 0x44, 0x30,
0xf0, 0x90, 0x94, 0x9b, 0xe0, 0xfe, 0x90, 0x94, 0x9a, 0xe0, 0xfd, 0xee,
0xed, 0xff, 0x90, 0x01, 0xed, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01,
0xf4, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x01, 0xed, 0xe0, 0xfc, 0xa3,
0xe0, 0x9f, 0xee, 0x64, 0x80, 0xf8, 0xec, 0x64, 0x80, 0x98, 0x40, 0x10,
0x90, 0x01, 0xed, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x01, 0xf4, 0xee,
0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0xf1, 0xe0, 0xfe, 0xa3, 0xe0, 0xff,
0x90, 0x01, 0xed, 0xe0, 0xfc, 0xa3, 0xe0, 0xc3, 0x9f, 0xee, 0x64, 0x80,
0xf8, 0xec, 0x64, 0x80, 0x98, 0x50, 0x10, 0x90, 0x01, 0xed, 0xe0, 0xfe,
0xa3, 0xe0, 0xff, 0x90, 0x01, 0xf1, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90,
0x01, 0x99, 0xe0, 0x04, 0xf0, 0x02, 0xd5, 0x2d, 0x90, 0x01, 0xf1, 0xe0,
0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x01, 0xf4, 0xe0, 0xfc, 0xa3, 0xe0, 0xc3,
0x9f, 0xff, 0xec, 0x9e, 0xfe, 0xd3, 0xef, 0x94, 0x0e, 0xee, 0x64, 0x80,
0x94, 0x81, 0x40, 0x06, 0x90, 0x01, 0xeb, 0x74, 0x01, 0xf0, 0x90, 0x01,
0xf1, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x01, 0xf4, 0xe0, 0xfc, 0xa3,
0xe0, 0xc3, 0x9f, 0xec, 0x9e, 0xff, 0x33, 0x95, 0xe0, 0xef, 0x90, 0x95,
0x13, 0xf0, 0x90, 0x01, 0xf1, 0xe0, 0xa3, 0xe0, 0xff, 0x90, 0x01, 0xf4,
0xe0, 0xa3, 0xe0, 0xc3, 0x9f, 0x90, 0x95, 0x12, 0xf0, 0x90, 0x94, 0x85,
0xe0, 0x44, 0x30, 0xf0, 0x90, 0x94, 0x9b, 0xe0, 0xff, 0x90, 0x01, 0xe9,
0xe4, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x94, 0x9b, 0xe0, 0x24, 0xf9, 0x90,
0x94, 0x8a, 0xf0, 0x90, 0x94, 0x88, 0xe4, 0xf0, 0xa3, 0x74, 0x48, 0xf0,
0x90, 0x94, 0x8b, 0xe0, 0x44, 0x02, 0xf0, 0xa3, 0x74, 0x37, 0xf0, 0xa3,
0x74, 0x63, 0xf0, 0x90, 0x01, 0xbc, 0x74, 0x65, 0xf0, 0x90, 0x94, 0x34,
0xe0, 0xb4, 0x55, 0x05, 0xe4, 0x90, 0x01, 0xeb, 0xf0, 0x90, 0x01, 0xeb,
0xe0, 0x60, 0x4d, 0x90, 0x94, 0x8c, 0x74, 0x47, 0xf0, 0xa3, 0x74, 0x64,
0xf0, 0x90, 0x94, 0x84, 0x74, 0xc0, 0xf0, 0xa3, 0xe4, 0xf0, 0x7f, 0x40,
0x7e, 0x1f, 0xfd, 0xfc, 0x12, 0xfd, 0x43, 0x90, 0x94, 0xe2, 0x74, 0x03,
0xf0, 0xa3, 0x74, 0x77, 0xf0, 0x90, 0x94, 0x5a, 0x74, 0x1b, 0xf0, 0xa3,
0x04, 0xf0, 0x90, 0x94, 0x86, 0xe0, 0xf0, 0xa3, 0x74, 0x11, 0xf0, 0x90,
0x95, 0x96, 0x74, 0x07, 0xf0, 0xa3, 0xe4, 0xf0, 0x90, 0x95, 0x44, 0x74,
0x1f, 0xf0, 0xa3, 0x04, 0xf0, 0x02, 0xd7, 0x81, 0x90, 0x94, 0x8c, 0x74,
0x27, 0xf0, 0xa3, 0x74, 0x72, 0xf0, 0x90, 0x95, 0x96, 0x74, 0x07, 0xf0,
0xa3, 0xe4, 0xf0, 0x90, 0x95, 0x44, 0x74, 0x03, 0xf0, 0xa3, 0xe4, 0xf0,
0x90, 0x94, 0x34, 0xe0, 0x64, 0x55, 0x70, 0x7b, 0x90, 0x01, 0xc8, 0x74,
0x04, 0xf0, 0x7b, 0x01, 0x7a, 0x95, 0x79, 0x02, 0x90, 0x01, 0xce, 0x74,
0x0c, 0xf0, 0x90, 0x01, 0xc8, 0xe0, 0xff, 0x90, 0x01, 0xcf, 0xe4, 0xf0,
0xa3, 0xef, 0xf0, 0x7d, 0x0e, 0x12, 0xec, 0x1d, 0x7b, 0x01, 0x7a, 0x94,
0x79, 0xca, 0x90, 0x01, 0xce, 0x74, 0x0c, 0xf0, 0x90, 0x01, 0xc8, 0xe0,
0xff, 0x90, 0x01, 0xcf, 0xe4, 0xf0, 0xa3, 0xef, 0xf0, 0x7d, 0x0e, 0x12,
0xec, 0x1d, 0x90, 0x94, 0xe2, 0x74, 0x03, 0xf0, 0xa3, 0x74, 0x77, 0xf0,
0x90, 0x94, 0x8c, 0x74, 0x37, 0xf0, 0xa3, 0x74, 0x73, 0xf0, 0x90, 0x94,
0x5a, 0x74, 0x1a, 0xf0, 0xa3, 0x04, 0xf0, 0x90, 0x94, 0x58, 0x74, 0x1f,
0xf0, 0xa3, 0xe4, 0xf0, 0x90, 0x94, 0x56, 0x74, 0x1f, 0xf0, 0xa3, 0xe4,
0xf0, 0x90, 0x94, 0x54, 0xf0, 0xa3, 0x74, 0xc0, 0xf0, 0x80, 0x27, 0x90,
0x94, 0x5a, 0x74, 0x1a, 0xf0, 0xa3, 0x74, 0x1c, 0xf0, 0x90, 0x94, 0x58,
0x74, 0xff, 0xf0, 0xa3, 0x74, 0x0f, 0xf0, 0x90, 0x94, 0x56, 0x74, 0xff,
0xf0, 0xa3, 0x74, 0x0f, 0xf0, 0x90, 0x94, 0x54, 0xe4, 0xf0, 0xa3, 0x74,
0xff, 0xf0, 0x90, 0x94, 0x86, 0xe0, 0xf0, 0xa3, 0x74, 0x11, 0xf0, 0x90,
0x94, 0x84, 0x74, 0x80, 0xf0, 0xa3, 0xe4, 0xf0, 0x7f, 0x40, 0x7e, 0x1f,
0xfd, 0xfc, 0x12, 0xfd, 0x43, 0x90, 0x01, 0xc2, 0xe0, 0x60, 0x03, 0x02,
0xd8, 0x52, 0x90, 0x94, 0x34, 0xe0, 0x64, 0x44, 0x60, 0x03, 0x02, 0xd8,
0x52, 0x90, 0x01, 0xbb, 0xe0, 0x60, 0x03, 0x02, 0xd8, 0x52, 0x90, 0x94,
0x5a, 0x74, 0x1a, 0xf0, 0xa3, 0x74, 0x1c, 0xf0, 0x90, 0x94, 0x58, 0x74,
0xff, 0xf0, 0xa3, 0x74, 0x0f, 0xf0, 0x90, 0x94, 0x56, 0x74, 0xff, 0xf0,
0xa3, 0x74, 0x0f, 0xf0, 0x90, 0x94, 0x54, 0xe4, 0xf0, 0xa3, 0x74, 0xff,
0xf0, 0x90, 0x94, 0x8c, 0x74, 0x47, 0xf0, 0xa3, 0x74, 0x64, 0xf0, 0x90,
0x94, 0x84, 0x74, 0xc0, 0xf0, 0xa3, 0xe4, 0xf0, 0x90, 0x94, 0xe2, 0x74,
0x03, 0xf0, 0xa3, 0x74, 0x77, 0xf0, 0x90, 0x95, 0x96, 0x74, 0x0c, 0xf0,
0xa3, 0xe4, 0xf0, 0x90, 0x95, 0x44, 0x74, 0x1f, 0xf0, 0xa3, 0xe4, 0xf0,
0x90, 0x01, 0xa0, 0xe0, 0x90, 0xe0, 0x22, 0xf0, 0x90, 0x01, 0x9f, 0xe0,
0x90, 0xe0, 0x2b, 0xf0, 0x90, 0x01, 0x9e, 0xe0, 0x90, 0xe0, 0x21, 0xf0,
0x90, 0xe0, 0x04, 0x74, 0x10, 0xf0, 0x90, 0xe0, 0x00, 0xe0, 0x20, 0xe3,
0xf9, 0x90, 0x94, 0x35, 0xe0, 0x64, 0xdd, 0x60, 0x06, 0x90, 0x94, 0xcb,
0x74, 0x32, 0xf0, 0x90, 0x01, 0xa0, 0xe0, 0x90, 0xe0, 0x22, 0xf0, 0x90,
0x01, 0x9f, 0xe0, 0x90, 0xe0, 0x2b, 0xf0, 0x90, 0x01, 0x9e, 0xe0, 0x90,
0xe0, 0x21, 0xf0, 0x90, 0xe0, 0x04, 0x74, 0x10, 0xf0, 0x90, 0xe0, 0x00,
0xe0, 0x20, 0xe3, 0xf9, 0x90, 0x01, 0xbb, 0x74, 0x01, 0xf0, 0x90, 0x94,
0xd9, 0xe4, 0xf0, 0x90, 0x94, 0xd8, 0xf0, 0x90, 0x94, 0xd7, 0x04, 0xf0,
0x90, 0x94, 0xd6, 0x04, 0xf0, 0x90, 0x94, 0x85, 0xe0, 0x44, 0x40, 0xf0,
0x90, 0xe0, 0x00, 0xe0, 0x90, 0x01, 0xb6, 0xf0, 0x90, 0x94, 0xe0, 0xe0,
0x54, 0x03, 0x64, 0x03, 0x60, 0x50, 0x90, 0x94, 0x30, 0xe0, 0xff, 0x90,
0x94, 0xa0, 0xe0, 0xd3, 0x9f, 0x50, 0x43, 0x12, 0xf1, 0x63, 0xef, 0x64,
0x01, 0x4e, 0x60, 0x3a, 0x12, 0xf2, 0x42, 0xef, 0x64, 0x01, 0x4e, 0x60,
0x31, 0x12, 0xf7, 0x35, 0xef, 0x64, 0x01, 0x4e, 0x60, 0x28, 0x90, 0x01,
0xb6, 0xe0, 0x54, 0xc0, 0x64, 0xc0, 0x70, 0x1e, 0x90, 0x94, 0x80, 0xe0,
0x30, 0xe0, 0x08, 0x90, 0x94, 0x34, 0xe0, 0x64, 0x55, 0x60, 0x0f, 0x90,
0x94, 0x35, 0xe0, 0x64, 0xdd, 0x60, 0x38, 0x90, 0x94, 0x80, 0xe0, 0x30,
0xe2, 0x31, 0x90, 0x95, 0x0c, 0xe0, 0x54, 0xfd, 0xf0, 0xe0, 0x54, 0xfb,
0xf0, 0x90, 0xe0, 0x03, 0x74, 0x20, 0xf0, 0x90, 0x95, 0x03, 0x74, 0x30,
0xf0, 0xe4, 0x90, 0x01, 0x85, 0xf0, 0x90, 0x94, 0xd9, 0xf0, 0x90, 0x94,
0xd8, 0xf0, 0x90, 0x94, 0xd7, 0xf0, 0x90, 0x94, 0xd6, 0x74, 0xa3, 0xf0,
0x02, 0xc1, 0x2b, 0x90, 0x94, 0x34, 0xe0, 0x64, 0x44, 0x60, 0x15, 0x90,
0x01, 0xba, 0xe0, 0xb4, 0x44, 0x0e, 0x90, 0xe0, 0x03, 0x74, 0x20, 0xf0,
0xe4, 0x90, 0x01, 0x85, 0xf0, 0x02, 0xd9, 0xfe, 0x90, 0x94, 0x34, 0xe0,
0x64, 0x44, 0x60, 0x0f, 0x90, 0x01, 0xbc, 0xe0, 0xb4, 0x65, 0x0e, 0x90,
0xe0, 0x03, 0x74, 0x18, 0xf0, 0x80, 0x06, 0x90, 0xe0, 0x03, 0x74, 0x18,
0xf0, 0x90, 0x01, 0x85, 0x74, 0x0d, 0xf0, 0x90, 0x94, 0x34, 0xe0, 0xb4,
0x55, 0x0b, 0x90, 0x95, 0x96, 0x74, 0x1f, 0xf0, 0xa3, 0xe4, 0xf0, 0x80,
0x09, 0x90, 0x95, 0x96, 0x74, 0x07, 0xf0, 0xa3, 0xe4, 0xf0, 0x90, 0x94,
0x34, 0xe0, 0x64, 0x22, 0x60, 0x03, 0x02, 0xd9, 0xfe, 0x90, 0x01, 0xe8,
0xe0, 0x60, 0x03, 0x02, 0xd9, 0xfe, 0x7d, 0x2b, 0x7c, 0xc8, 0x7f, 0x01,
0x12, 0xfb, 0xf6, 0xee, 0x20, 0xe4, 0x03, 0x02, 0xd9, 0xfe, 0x90, 0x94,
0x85, 0xe0, 0x44, 0x08, 0xf0, 0x90, 0x94, 0x84, 0xe0, 0x54, 0x7f, 0xf0,
0x7b, 0x01, 0x7a, 0x94, 0x79, 0x52, 0xe4, 0x90, 0x01, 0xce, 0xf0, 0xa3,
0xf0, 0xa3, 0xf0, 0x7d, 0x06, 0x12, 0xec, 0x1d, 0x90, 0x94, 0x53, 0xe0,
0x44, 0x04, 0xf0, 0x90, 0xe0, 0x02, 0x74, 0x5f, 0xf0, 0x90, 0x95, 0x9c,
0xe0, 0x44, 0x20, 0xf0, 0x90, 0x94, 0x49, 0xe0, 0x44, 0x01, 0xf0, 0x90,
0x94, 0x48, 0xe0, 0x54, 0xbf, 0xf0, 0xe0, 0x44, 0x40, 0xf0, 0x7f, 0x00,
0x7e, 0x71, 0x7d, 0x02, 0x7c, 0x00, 0x12, 0xfd, 0x43, 0x7f, 0x00, 0x7e,
0x71, 0x7d, 0x02, 0x7c, 0x00, 0x12, 0xfd, 0x43, 0x90, 0x94, 0x49, 0xe0,
0x30, 0xe1, 0xf9, 0x90, 0x95, 0x9c, 0xe0, 0x54, 0xdf, 0xf0, 0x90, 0x94,
0x53, 0xe0, 0x54, 0xfb, 0xf0, 0x90, 0x94, 0x85, 0xe0, 0x54, 0xf7, 0xf0,
0x90, 0x01, 0xe8, 0x74, 0x01, 0xf0, 0x90, 0x94, 0x34, 0xe0, 0x90, 0x01,
0xba, 0xf0, 0x90, 0x95, 0x0c, 0xe0, 0x44, 0x02, 0xf0, 0xe0, 0x44, 0x04,
0xf0, 0x02, 0xc1, 0x2b, 0x7b, 0xff, 0x7a, 0x7f, 0x7d, 0x41, 0x7c, 0xc8,
0x7f, 0x01, 0x12, 0xfa, 0x8d, 0x90, 0x95, 0x0c, 0xe0, 0x54, 0xfd, 0xf0,
0xe0, 0x54, 0xfb, 0xf0, 0x22, 0xe4, 0x90, 0x01, 0xd6, 0xf0, 0xa3, 0xf0,
0x7f, 0xe4, 0x7e, 0xc8, 0x12, 0xfc, 0xed, 0x90, 0x01, 0xca, 0xee, 0xf0,
0xa3, 0xef, 0xf0, 0x90, 0x01, 0xca, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xa3,
0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x7f, 0xe4, 0x7e, 0xc8, 0x12, 0xfc, 0xed,
0x90, 0x01, 0xce, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x7f, 0xe4, 0x7e, 0xc8,
0x12, 0xfc, 0xed, 0x90, 0x01, 0xca, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0xa3,
0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x01, 0xca, 0xe0, 0xfc, 0xa3, 0xe0,
0xb5, 0x07, 0xc4, 0xec, 0xb5, 0x06, 0xc0, 0x90, 0x01, 0xce, 0xe0, 0xfe,
0xa3, 0xe0, 0xff, 0x90, 0x01, 0xca, 0xe0, 0xa3, 0xe0, 0xb5, 0x07, 0xaf,
0xec, 0xb5, 0x06, 0xab, 0x90, 0x01, 0xca, 0xa3, 0xe0, 0x54, 0x08, 0x90,
0x01, 0xd4, 0xf0, 0xe0, 0x70, 0x0a, 0xfd, 0x7c, 0x80, 0x7f, 0x2b, 0x7e,
0xc8, 0x12, 0xfb, 0x0f, 0x7f, 0xf2, 0x7e, 0x81, 0x12, 0xfc, 0xed, 0xef,
0x54, 0x0f, 0xff, 0xc0, 0x07, 0x7f, 0xf1, 0x7e, 0x81, 0x12, 0xfc, 0xed,
0xef, 0x54, 0xf0, 0xd0, 0x07, 0x4f, 0x90, 0x01, 0xd5, 0xf0, 0x90, 0x02,
0x06, 0xe0, 0x70, 0x08, 0x90, 0x01, 0xd4, 0xe0, 0x64, 0x08, 0x60, 0x0f,
0x90, 0x01, 0xd5, 0xe0, 0xff, 0x90, 0x02, 0x07, 0xe0, 0x6f, 0x70, 0x03,
0x02, 0xde, 0x63, 0x7d, 0x00, 0x7c, 0x80, 0x7f, 0x01, 0x12, 0xfb, 0xf6,
0xee, 0x20, 0xe7, 0x03, 0x02, 0xde, 0x63, 0x90, 0x94, 0x21, 0xe0, 0x44,
0x01, 0xf0, 0x7f, 0x94, 0x7e, 0x35, 0x7d, 0x77, 0x7c, 0x00, 0x12, 0xf8,
0xf6, 0x90, 0xe0, 0x00, 0xe0, 0x30, 0xe3, 0xf9, 0x90, 0x94, 0x21, 0xe0,
0x54, 0xfe, 0xf0, 0x7f, 0xff, 0x7e, 0xff, 0x7d, 0x07, 0x7c, 0x00, 0x12,
0xf8, 0xf6, 0x7d, 0x00, 0x7c, 0x80, 0x7f, 0x01, 0x12, 0xfb, 0xf6, 0xef,
0x54, 0x0c, 0xff, 0x90, 0x01, 0xca, 0xe4, 0xf0, 0xa3, 0xef, 0xf0, 0x90,
0x01, 0xca, 0xe0, 0xfe, 0xa3, 0xe0, 0x4e, 0x60, 0x07, 0x90, 0xe0, 0x00,
0xe0, 0x30, 0xe3, 0xda, 0x90, 0xe0, 0x00, 0xe0, 0x30, 0xe3, 0x0e, 0x7d,
0xff, 0x7c, 0xf7, 0x7f, 0x2b, 0x7e, 0xc8, 0x12, 0xfb, 0x49, 0x02, 0xde,
0x63, 0x7d, 0x0d, 0x7c, 0x00, 0x7f, 0x02, 0x7e, 0x80, 0x12, 0xfc, 0xc2,
0xe4, 0xfd, 0xfc, 0x7f, 0x03, 0x7e, 0x80, 0x12, 0xfc, 0xc2, 0x7d, 0xf0,
0x7c, 0x81, 0x7f, 0x04, 0x7e, 0x80, 0x12, 0xfc, 0xc2, 0x7b, 0x01, 0x7a,
0xa0, 0x7d, 0x00, 0x7c, 0x01, 0x7f, 0x05, 0x7e, 0x80, 0x12, 0xfa, 0x00,
0x7d, 0x02, 0x7c, 0x80, 0x7f, 0x00, 0x7e, 0x80, 0x12, 0xfc, 0xc2, 0x12,
0xf8, 0x26, 0x90, 0x01, 0xd8, 0xef, 0xf0, 0xe0, 0x70, 0x03, 0x02, 0xde,
0x63, 0x7f, 0xf0, 0x7e, 0x81, 0x12, 0xfc, 0xed, 0x90, 0x01, 0xca, 0xee,
0xf0, 0xa3, 0xef, 0xf0, 0x7f, 0xf3, 0x7e, 0x81, 0x12, 0xfc, 0xed, 0xef,
0x54, 0xf0, 0xff, 0x90, 0x01, 0xcc, 0xe4, 0xf0, 0xa3, 0xef, 0xf0, 0x90,
0x01, 0xca, 0xe0, 0xfe, 0xa3, 0xe0, 0x64, 0x03, 0x4e, 0x60, 0x03, 0x02,
0xde, 0x1f, 0xa3, 0xe0, 0xfe, 0xa3, 0xe0, 0x64, 0x10, 0x4e, 0x60, 0x16,
0x90, 0x01, 0xcc, 0xe0, 0xa3, 0xe0, 0x64, 0x20, 0x4e, 0x60, 0x0b, 0x90,
0x01, 0xcc, 0xe0, 0xa3, 0xe0, 0x64, 0x80, 0x4e, 0x70, 0x1e, 0x90, 0x94,
0x34, 0x74, 0x44, 0xf0, 0x7d, 0x40, 0x7c, 0x20, 0xe4, 0xff, 0xfe, 0x12,
0xfc, 0xc2, 0x7d, 0x08, 0x7c, 0x00, 0x7f, 0x07, 0x7e, 0x00, 0x12, 0xfc,
0xc2, 0x02, 0xde, 0x3a, 0x90, 0x01, 0xcc, 0xe0, 0xfe, 0xa3, 0xe0, 0x64,
0x40, 0x4e, 0x70, 0x1e, 0x90, 0x94, 0x34, 0x74, 0x22, 0xf0, 0x7d, 0x40,
0x7c, 0x20, 0xe4, 0xff, 0xfe, 0x12, 0xfc, 0xc2, 0x7d, 0x08, 0x7c, 0x00,
0x7f, 0x07, 0x7e, 0x00, 0x12, 0xfc, 0xc2, 0x02, 0xde, 0x3a, 0x7d, 0x02,
0x7c, 0x00, 0x7f, 0x02, 0x7e, 0x80, 0x12, 0xfc, 0xc2, 0x7d, 0x3c, 0x7c,
0x00, 0x7f, 0x03, 0x7e, 0x80, 0x12, 0xfc, 0xc2, 0x7d, 0xf1, 0x7c, 0x81,
0x7f, 0x04, 0x7e, 0x80, 0x12, 0xfc, 0xc2, 0x7d, 0x02, 0x7c, 0x80, 0x7f,
0x00, 0x7e, 0x80, 0x12, 0xfc, 0xc2, 0x12, 0xf8, 0x26, 0x90, 0x01, 0xd8,
0xef, 0xf0, 0x7f, 0xfc, 0x7e, 0x81, 0x12, 0xfc, 0xed, 0x90, 0x01, 0xcc,
0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x7f, 0xf8, 0x7e, 0x81, 0x12, 0xfc, 0xed,
0xef, 0x54, 0x0f, 0xff, 0x90, 0x01, 0xce, 0xe4, 0xf0, 0xa3, 0xef, 0xf0,
0x7f, 0xf1, 0x7e, 0x81, 0x12, 0xfc, 0xed, 0xef, 0x54, 0x0f, 0xff, 0x90,
0x01, 0xd0, 0xe4, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0xce, 0xe0, 0xfe,
0xa3, 0xe0, 0x64, 0x04, 0x4e, 0x70, 0x28, 0xa3, 0xe0, 0xfe, 0xa3, 0xe0,
0x64, 0x01, 0x4e, 0x70, 0x1e, 0x90, 0x94, 0x34, 0x74, 0x55, 0xf0, 0x7d,
0x40, 0x7c, 0x20, 0xe4, 0xff, 0xfe, 0x12, 0xfc, 0xc2, 0x7d, 0x08, 0x7c,
0x00, 0x7f, 0x07, 0x7e, 0x00, 0x12, 0xfc, 0xc2, 0x02, 0xde, 0x3a, 0x90,
0x01, 0xd0, 0xe0, 0xfe, 0xa3, 0xe0, 0x4e, 0x70, 0x04, 0x7f, 0x01, 0x80,
0x02, 0x7f, 0x00, 0x90, 0x01, 0xce, 0xe0, 0xfc, 0xa3, 0xe0, 0x64, 0x04,
0x4c, 0x70, 0x04, 0x7e, 0x01, 0x80, 0x02, 0x7e, 0x00, 0xee, 0x5f, 0xff,
0x90, 0x01, 0xcc, 0xe0, 0xfc, 0xa3, 0xe0, 0xd3, 0x94, 0x63, 0xec, 0x94,
0x00, 0x40, 0x04, 0x7e, 0x01, 0x80, 0x02, 0x7e, 0x00, 0xee, 0x5f, 0x60,
0x1e, 0x90, 0x94, 0x34, 0x74, 0x55, 0xf0, 0x7d, 0x40, 0x7c, 0x20, 0xe4,
0xff, 0xfe, 0x12, 0xfc, 0xc2, 0x7d, 0x08, 0x7c, 0x00, 0x7f, 0x07, 0x7e,
0x00, 0x12, 0xfc, 0xc2, 0x02, 0xde, 0x3a, 0x90, 0x01, 0xce, 0xe0, 0xfe,
0xa3, 0xe0, 0x64, 0x08, 0x4e, 0x70, 0x28, 0xa3, 0xe0, 0xfe, 0xa3, 0xe0,
0x64, 0x01, 0x4e, 0x70, 0x1e, 0x90, 0x94, 0x34, 0x74, 0x55, 0xf0, 0x7d,
0x40, 0x7c, 0x20, 0xe4, 0xff, 0xfe, 0x12, 0xfc, 0xc2, 0x7d, 0x08, 0x7c,
0x00, 0x7f, 0x07, 0x7e, 0x00, 0x12, 0xfc, 0xc2, 0x02, 0xde, 0x3a, 0x90,
0x01, 0xce, 0xe0, 0xfe, 0xa3, 0xe0, 0x64, 0x08, 0x4e, 0x70, 0x28, 0xa3,
0xe0, 0xfe, 0xa3, 0xe0, 0x64, 0x04, 0x4e, 0x70, 0x1e, 0x90, 0x94, 0x34,
0x74, 0x44, 0xf0, 0x7d, 0x40, 0x7c, 0x20, 0xe4, 0xff, 0xfe, 0x12, 0xfc,
0xc2, 0x7d, 0x08, 0x7c, 0x00, 0x7f, 0x07, 0x7e, 0x00, 0x12, 0xfc, 0xc2,
0x02, 0xde, 0x3a, 0x7f, 0xf6, 0x7e, 0x81, 0x12, 0xfc, 0xed, 0xef, 0x54,
0x0f, 0xff, 0x90, 0x01, 0xd2, 0xe4, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01,
0xd2, 0xe0, 0xfe, 0xa3, 0xe0, 0x64, 0x01, 0x4e, 0x60, 0x21, 0x90, 0x01,
0xd2, 0xe0, 0xa3, 0xe0, 0x64, 0x02, 0x4e, 0x60, 0x16, 0x90, 0x01, 0xd2,
0xe0, 0xa3, 0xe0, 0x64, 0x04, 0x4e, 0x60, 0x0b, 0x90, 0x01, 0xd2, 0xe0,
0xa3, 0xe0, 0x64, 0x08, 0x4e, 0x70, 0x1f, 0x90, 0x94, 0x34, 0x74, 0x11,
0xf0, 0x7d, 0x0d, 0x7c, 0x00, 0x7f, 0x07, 0x7e, 0x00, 0x12, 0xfc, 0xc2,
0xe4, 0xfb, 0xfa, 0x7d, 0xff, 0x7c, 0xdf, 0xff, 0xfe, 0x12, 0xfa, 0x00,
0x80, 0x38, 0x90, 0x94, 0x34, 0x74, 0x55, 0xf0, 0x7d, 0x40, 0x7c, 0x20,
0xe4, 0xff, 0xfe, 0x12, 0xfc, 0xc2, 0x7d, 0x08, 0x7c, 0x00, 0x7f, 0x07,
0x7e, 0x00, 0x12, 0xfc, 0xc2, 0x80, 0x1b, 0x90, 0x94, 0x34, 0x74, 0x55,
0xf0, 0x7d, 0x40, 0x7c, 0x20, 0xe4, 0xff, 0xfe, 0x12, 0xfc, 0xc2, 0x7d,
0x08, 0x7c, 0x00, 0x7f, 0x07, 0x7e, 0x00, 0x12, 0xfc, 0xc2, 0x7d, 0xff,
0x7c, 0x7f, 0x7f, 0x2b, 0x7e, 0xc8, 0x12, 0xfb, 0x49, 0x7f, 0xf2, 0x7e,
0x81, 0x12, 0xfc, 0xed, 0xef, 0x54, 0x0f, 0xff, 0xc0, 0x07, 0x7f, 0xf1,
0x7e, 0x81, 0x12, 0xfc, 0xed, 0xef, 0x54, 0xf0, 0xd0, 0x07, 0x4f, 0x90,
0x01, 0xd5, 0xf0, 0x90, 0x01, 0xd4, 0xe0, 0x90, 0x02, 0x06, 0xf0, 0x90,
0x01, 0xd5, 0xe0, 0x90, 0x02, 0x07, 0xf0, 0x22, 0x90, 0x01, 0x84, 0xee,
0xf0, 0xa3, 0xef, 0xf0, 0xe4, 0x90, 0x01, 0x8e, 0xf0, 0x90, 0x01, 0x86,
0xf0, 0x90, 0x01, 0x9c, 0xf0, 0x7b, 0x01, 0x7a, 0x95, 0x79, 0x8c, 0x90,
0x01, 0xce, 0xf0, 0xa3, 0xf0, 0xa3, 0xf0, 0x7d, 0x0f, 0x12, 0xec, 0x1d,
0x90, 0x95, 0x8a, 0xe0, 0x44, 0x01, 0xf0, 0xe0, 0x44, 0x08, 0xf0, 0xe0,
0x54, 0xef, 0xf0, 0x7f, 0x20, 0x7e, 0x4e, 0x7d, 0x00, 0x7c, 0x00, 0x12,
0xf8, 0xf6, 0x90, 0xe0, 0x00, 0xe0, 0x30, 0xe3, 0x13, 0x90, 0x01, 0x9b,
0x74, 0x01, 0xf0, 0x7f, 0x20, 0x7e, 0x4e, 0x7d, 0x00, 0x7c, 0x00, 0x12,
0xf8, 0xf6, 0x80, 0x05, 0xe4, 0x90, 0x01, 0x9b, 0xf0, 0x12, 0xfd, 0x6a,
0x90, 0x94, 0x80, 0xe0, 0x30, 0xe2, 0x09, 0x90, 0x95, 0x3f, 0xe0, 0x44,
0x10, 0xf0, 0x80, 0x07, 0x90, 0x95, 0x3f, 0xe0, 0x54, 0xef, 0xf0, 0x12,
0xf6, 0x29, 0x20, 0x00, 0x10, 0x7d, 0x2b, 0x7c, 0xc8, 0x7f, 0x01, 0x12,
0xfb, 0xf6, 0xee, 0x30, 0xe2, 0x03, 0x12, 0xda, 0x2d, 0xe4, 0xfd, 0xfc,
0x7f, 0x03, 0x12, 0xfb, 0xf6, 0xee, 0x30, 0xe6, 0x06, 0x7f, 0x01, 0xc0,
0x07, 0x80, 0x04, 0x7f, 0x00, 0xc0, 0x07, 0xe4, 0xfd, 0xfc, 0x7f, 0x01,
0x12, 0xfb, 0xf6, 0xef, 0x30, 0xe0, 0x04, 0x7e, 0x01, 0x80, 0x02, 0x7e,
0x00, 0xd0, 0x07, 0xee, 0x4f, 0x60, 0x04, 0x7f, 0x01, 0x80, 0x02, 0x7f,
0x00, 0x90, 0x02, 0x0a, 0xef, 0xf0, 0x7d, 0x42, 0x7c, 0xc8, 0x7f, 0x01,
0x12, 0xfb, 0xf6, 0x90, 0x01, 0x88, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x30,
0x00, 0x07, 0xe4, 0x90, 0x02, 0x08, 0xf0, 0x80, 0x16, 0x90, 0x01, 0x88,
0xe0, 0xfe, 0xa3, 0xe0, 0xee, 0x30, 0xe2, 0x04, 0x7f, 0x01, 0x80, 0x02,
0x7f, 0x00, 0x90, 0x02, 0x08, 0xef, 0xf0, 0x90, 0x01, 0x88, 0xe0, 0xfe,
0xa3, 0xe0, 0xee, 0x30, 0xe1, 0x04, 0x7f, 0x01, 0x80, 0x02, 0x7f, 0x00,
0x90, 0x01, 0x9d, 0xef, 0xf0, 0xe4, 0x90, 0x02, 0x0d, 0xf0, 0x90, 0x02,
0x08, 0xe0, 0x64, 0x01, 0x70, 0x36, 0x90, 0x02, 0x0a, 0xe0, 0x70, 0x30,
0x90, 0xe0, 0x03, 0xe0, 0xb4, 0x05, 0x14, 0x90, 0x01, 0x9d, 0xe0, 0xb4,
0x01, 0x22, 0x7d, 0x20, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfb, 0xf6, 0xee,
0x30, 0xe5, 0x15, 0x90, 0x02, 0x05, 0x74, 0x01, 0xf0, 0x7b, 0x00, 0x7a,
0x08, 0x7d, 0x0e, 0x7c, 0x80, 0x7f, 0x04, 0x12, 0xfa, 0x4c, 0x80, 0x19,
0x90, 0x02, 0x05, 0xe0, 0xb4, 0x01, 0x0d, 0x7b, 0xff, 0x7a, 0xf7, 0x7d,
0x0e, 0x7c, 0x80, 0x7f, 0x04, 0x12, 0xfa, 0x8d, 0xe4, 0x90, 0x02, 0x05,
0xf0, 0x90, 0x02, 0x0e, 0xe0, 0xb4, 0x01, 0x12, 0x7b, 0x01, 0x7a, 0x00,
0x7d, 0x60, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfa, 0x4c, 0xe4, 0x90, 0x02,
0x0e, 0xf0, 0x90, 0x01, 0x84, 0xe0, 0xfe, 0xa3, 0xe0, 0x64, 0x02, 0x4e,
0x70, 0x1b, 0xa3, 0xe0, 0xff, 0x74, 0x01, 0xa8, 0x07, 0x08, 0x80, 0x02,
0xc3, 0x33, 0xd8, 0xfc, 0xff, 0xc4, 0x54, 0xf0, 0xff, 0x90, 0x95, 0x12,
0xe0, 0x4f, 0xf0, 0x80, 0x17, 0x90, 0x01, 0x86, 0xe0, 0xff, 0x74, 0x01,
0xa8, 0x07, 0x08, 0x80, 0x02, 0xc3, 0x33, 0xd8, 0xfc, 0xff, 0x90, 0x95,
0x12, 0xe0, 0x4f, 0xf0, 0x90, 0x01, 0x86, 0xe0, 0xa3, 0xf0, 0x90, 0x01,
0x86, 0x12, 0xf0, 0x4b, 0xe0, 0x54, 0x00, 0xe0, 0xb9, 0x01, 0xe1, 0x01,
0x02, 0xe1, 0x99, 0x03, 0x00, 0x00, 0xe1, 0x9e, 0x90, 0xe0, 0x03, 0x74,
0x28, 0xf0, 0x90, 0x95, 0x8a, 0xe0, 0x44, 0x02, 0xf0, 0xe0, 0x44, 0x04,
0xf0, 0xe0, 0x44, 0x08, 0xf0, 0xe0, 0x44, 0x01, 0xf0, 0x90, 0x94, 0x37,
0xe0, 0x30, 0xe6, 0x06, 0x90, 0x01, 0x9c, 0xe0, 0x70, 0x07, 0x90, 0x95,
0x8a, 0xe0, 0x30, 0xe4, 0x15, 0x90, 0x95, 0x8a, 0xe0, 0x44, 0x10, 0xf0,
0x12, 0xf3, 0x0c, 0x90, 0x95, 0x8a, 0xe0, 0x54, 0xef, 0xf0, 0xe0, 0x54,
0xf7, 0xf0, 0x90, 0x95, 0x3c, 0xe0, 0x20, 0xe0, 0x03, 0x02, 0xe1, 0x9e,
0x90, 0x01, 0x87, 0x74, 0x01, 0xf0, 0x90, 0x95, 0x8a, 0xe0, 0x54, 0xfe,
0xf0, 0xe0, 0x54, 0xf7, 0xf0, 0xe4, 0x90, 0x01, 0x9a, 0xf0, 0x02, 0xe1,
0x9e, 0x90, 0x01, 0x9b, 0xe0, 0x70, 0x03, 0x02, 0xe1, 0x9e, 0x90, 0x01,
0x9a, 0xe0, 0x04, 0xf0, 0xe0, 0xd3, 0x94, 0x02, 0x50, 0x03, 0x02, 0xe1,
0x9e, 0x90, 0x01, 0x87, 0x74, 0x02, 0xf0, 0x90, 0x01, 0x84, 0xe0, 0xfe,
0xa3, 0xe0, 0x64, 0x02, 0x4e, 0x70, 0x09, 0x90, 0x95, 0x8a, 0xe0, 0x54,
0xfd, 0xf0, 0x80, 0x07, 0x90, 0x95, 0x8a, 0xe0, 0x54, 0xfb, 0xf0, 0x90,
0xe0, 0x03, 0x74, 0x05, 0xf0, 0xe4, 0x90, 0x01, 0x99, 0xf0, 0x02, 0xe1,
0x9e, 0x90, 0x94, 0x37, 0xe0, 0x20, 0xe7, 0x03, 0x02, 0xe1, 0x9e, 0x90,
0x95, 0x8b, 0xe0, 0xff, 0x90, 0x01, 0x88, 0xe4, 0xf0, 0xa3, 0xef, 0xf0,
0x90, 0x01, 0x88, 0xe0, 0xa3, 0xe0, 0xfe, 0x90, 0x95, 0x8a, 0xe0, 0xfd,
0xee, 0xed, 0x44, 0x20, 0xff, 0x90, 0x01, 0x88, 0xee, 0xf0, 0xa3, 0xef,
0xf0, 0x90, 0x01, 0x88, 0xe0, 0xfa, 0xa3, 0xe0, 0xfb, 0x7d, 0xc5, 0x7c,
0xca, 0x7f, 0x01, 0x12, 0xfc, 0x90, 0x7b, 0x01, 0x7a, 0x95, 0x79, 0x90,
0xe4, 0x90, 0x01, 0xa2, 0xf0, 0x7d, 0x0f, 0x12, 0xf3, 0xcb, 0x90, 0x01,
0x8c, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0x8c, 0xe0, 0xfe, 0xa3,
0xe0, 0xd3, 0x94, 0x00, 0xee, 0x64, 0x80, 0x94, 0x03, 0x40, 0x14, 0x90,
0x01, 0x8c, 0xe0, 0xa3, 0xe0, 0xee, 0x64, 0x80, 0x94, 0xfd, 0x50, 0x07,
0xe4, 0x90, 0x01, 0x99, 0xf0, 0x80, 0x1f, 0x90, 0x01, 0x9b, 0xe0, 0x60,
0x19, 0x90, 0x01, 0x99, 0xe0, 0x04, 0xf0, 0xe0, 0xd3, 0x94, 0x07, 0x40,
0x0d, 0x90, 0x01, 0x87, 0x74, 0x03, 0xf0, 0x80, 0x05, 0xe4, 0x90, 0x01,
0x87, 0xf0, 0x90, 0x95, 0x3c, 0xe0, 0x20, 0xe0, 0x05, 0xe4, 0x90, 0x01,
0x87, 0xf0, 0x90, 0x01, 0x87, 0xe0, 0xff, 0x90, 0x01, 0x86, 0xe0, 0x6f,
0x60, 0x04, 0x7f, 0x01, 0x80, 0x02, 0x7f, 0x00, 0x90, 0x01, 0x9c, 0xef,
0xf0, 0x90, 0x01, 0x87, 0xe0, 0x90, 0x01, 0x86, 0xf0, 0x7d, 0x20, 0x7c,
0xc8, 0x7f, 0x01, 0x12, 0xfb, 0xf6, 0x90, 0x01, 0x88, 0xee, 0xf0, 0xa3,
0xef, 0xf0, 0x90, 0x01, 0x88, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xa3, 0xee,
0xf0, 0xa3, 0xef, 0xf0, 0x7d, 0x20, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfb,
0xf6, 0x90, 0x01, 0x88, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0xa3, 0xe0, 0xfe,
0xa3, 0xe0, 0xff, 0x90, 0x01, 0x88, 0xe0, 0xfc, 0xa3, 0xe0, 0xb5, 0x07,
0xd1, 0xec, 0xb5, 0x06, 0xcd, 0x90, 0x01, 0x84, 0xe0, 0xfe, 0xa3, 0xe0,
0xff, 0x90, 0x01, 0x88, 0xe0, 0xa3, 0xe0, 0xfd, 0xec, 0x5e, 0xfe, 0xed,
0x5f, 0x4e, 0x60, 0x10, 0x7d, 0xe4, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xf9,
0x55, 0xef, 0x20, 0xe4, 0x03, 0x02, 0xde, 0xb6, 0x90, 0xe0, 0x03, 0x74,
0x28, 0xf0, 0x90, 0x95, 0x8a, 0xe0, 0x44, 0x02, 0xf0, 0xe0, 0x44, 0x04,
0xf0, 0xe0, 0x44, 0x08, 0xf0, 0xe0, 0x54, 0xfe, 0xf0, 0xe0, 0x44, 0x10,
0xf0, 0x90, 0x95, 0x3f, 0xe0, 0x54, 0xef, 0xf0, 0x22, 0x90, 0xe0, 0x01,
0xe0, 0x54, 0xfd, 0xf0, 0x7b, 0x00, 0x7a, 0x80, 0x7d, 0x2b, 0x7c, 0xc8,
0x7f, 0x01, 0x12, 0xfa, 0x4c, 0xe4, 0xfd, 0xfc, 0x7f, 0x42, 0x7e, 0xc8,
0x12, 0xfc, 0xc2, 0xe4, 0x90, 0x02, 0x06, 0xf0, 0xa3, 0xf0, 0x90, 0x94,
0x44, 0xe0, 0x44, 0x20, 0xf0, 0x90, 0x94, 0x45, 0xe0, 0x30, 0xe4, 0xf9,
0x90, 0x95, 0xa1, 0xe0, 0x30, 0xe4, 0xf2, 0x12, 0xfb, 0xbd, 0xe4, 0x90,
0x02, 0x0b, 0xf0, 0xa3, 0xf0, 0x90, 0x02, 0x09, 0xf0, 0x90, 0x01, 0x82,
0x74, 0xff, 0xf0, 0xa3, 0xf0, 0xe4, 0x90, 0x02, 0x04, 0xf0, 0xa3, 0xf0,
0x90, 0x02, 0x0e, 0xf0, 0x20, 0x00, 0x1d, 0xfb, 0x7a, 0x0e, 0x7d, 0x42,
0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfa, 0x4c, 0x90, 0x02, 0x0e, 0x74, 0x01,
0xf0, 0x7d, 0xfe, 0x7c, 0xff, 0x7f, 0x60, 0x7e, 0xc8, 0x12, 0xfb, 0x49,
0x12, 0xf6, 0x29, 0x7d, 0xe4, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xf9, 0x55,
0xef, 0x30, 0xe4, 0x28, 0x90, 0xe0, 0x38, 0x74, 0x0f, 0xf0, 0x90, 0x94,
0x85, 0xe0, 0x44, 0x01, 0xf0, 0x90, 0x94, 0x46, 0xe0, 0x44, 0x80, 0xf0,
0x90, 0x94, 0x05, 0xe0, 0x44, 0x04, 0xf0, 0x7d, 0xe4, 0x7c, 0xc8, 0x7f,
0x01, 0x12, 0xf9, 0x55, 0xef, 0x20, 0xe4, 0xf3, 0x90, 0x95, 0x9c, 0xe0,
0x44, 0xc0, 0xf0, 0xa3, 0xe0, 0x44, 0x01, 0xf0, 0x90, 0x94, 0x48, 0xe0,
0x44, 0x80, 0xf0, 0x90, 0x94, 0x05, 0xe0, 0x54, 0xfb, 0xf0, 0x7f, 0x80,
0x7e, 0x38, 0x7d, 0x01, 0x7c, 0x00, 0x12, 0xfd, 0x43, 0x90, 0xe0, 0x38,
0x74, 0x0b, 0xf0, 0x7f, 0x80, 0x7e, 0x38, 0x7d, 0x01, 0x7c, 0x00, 0x12,
0xfd, 0x43, 0x90, 0x94, 0x46, 0xe0, 0x54, 0x7f, 0xf0, 0x7f, 0x80, 0x7e,
0x38, 0x7d, 0x01, 0x7c, 0x00, 0x12, 0xfd, 0x43, 0x90, 0xe0, 0x38, 0x74,
0x0a, 0xf0, 0x7f, 0x80, 0x7e, 0x38, 0x7d, 0x01, 0x7c, 0x00, 0x12, 0xfd,
0x43, 0x90, 0xe0, 0x38, 0x74, 0x08, 0xf0, 0x7f, 0x80, 0x7e, 0x38, 0x7d,
0x01, 0x7c, 0x00, 0x12, 0xfd, 0x43, 0x90, 0x95, 0x9c, 0xe0, 0x54, 0x3f,
0xf0, 0x7f, 0x80, 0x7e, 0x38, 0x7d, 0x01, 0x7c, 0x00, 0x12, 0xfd, 0x43,
0x90, 0x95, 0x9d, 0xe0, 0x54, 0xfe, 0xf0, 0x7f, 0x80, 0x7e, 0x38, 0x7d,
0x01, 0x7c, 0x00, 0x12, 0xfd, 0x43, 0x90, 0x94, 0x48, 0xe0, 0x54, 0x7f,
0xf0, 0x7f, 0x80, 0x7e, 0x38, 0x7d, 0x01, 0x7c, 0x00, 0x12, 0xfd, 0x43,
0x90, 0xe0, 0x38, 0xe4, 0xf0, 0x7f, 0x80, 0x7e, 0x38, 0x7d, 0x01, 0xfc,
0x12, 0xfd, 0x43, 0x90, 0x94, 0x85, 0xe0, 0x54, 0xfe, 0xf0, 0x7d, 0x20,
0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfb, 0xf6, 0x90, 0x01, 0x7e, 0xee, 0xf0,
0xa3, 0xef, 0xf0, 0x90, 0x01, 0x7e, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xa3,
0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x7d, 0x20, 0x7c, 0xc8, 0x7f, 0x01, 0x12,
0xfb, 0xf6, 0x90, 0x01, 0x7e, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0xa3, 0xe0,
0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x01, 0x7e, 0xe0, 0xfc, 0xa3, 0xe0, 0xb5,
0x07, 0xd1, 0xec, 0xb5, 0x06, 0xcd, 0x90, 0x01, 0x7e, 0xa3, 0xe0, 0x54,
0x07, 0x90, 0x01, 0x83, 0xf0, 0xe0, 0xff, 0x90, 0x01, 0x82, 0xe0, 0x6f,
0x60, 0x49, 0xa3, 0xe0, 0x64, 0x04, 0x60, 0x19, 0xe0, 0x64, 0x02, 0x60,
0x14, 0xe0, 0x64, 0x01, 0x60, 0x0f, 0x7b, 0x00, 0x7a, 0x80, 0x7d, 0x42,
0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfa, 0x4c, 0x80, 0x2a, 0x90, 0x01, 0x82,
0xe0, 0x12, 0xf0, 0x4b, 0xe4, 0x5d, 0x01, 0xe4, 0x55, 0x02, 0xe4, 0x4d,
0x04, 0x00, 0x00, 0xe4, 0x63, 0x90, 0x95, 0x19, 0xe0, 0x04, 0xf0, 0x80,
0x0e, 0x90, 0x95, 0x17, 0xe0, 0x04, 0xf0, 0x80, 0x06, 0x90, 0x95, 0x15,
0xe0, 0x04, 0xf0, 0xe4, 0xfd, 0xfc, 0x7f, 0x03, 0x12, 0xfb, 0xf6, 0xee,
0x30, 0xe6, 0x06, 0x7f, 0x01, 0xc0, 0x07, 0x80, 0x04, 0x7f, 0x00, 0xc0,
0x07, 0xe4, 0xfd, 0xfc, 0x7f, 0x01, 0x12, 0xfb, 0xf6, 0xef, 0x30, 0xe0,
0x04, 0x7e, 0x01, 0x80, 0x02, 0x7e, 0x00, 0xd0, 0x07, 0xee, 0x4f, 0x60,
0x04, 0x7f, 0x01, 0x80, 0x02, 0x7f, 0x00, 0x90, 0x02, 0x0a, 0xef, 0xf0,
0x7d, 0x42, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfb, 0xf6, 0x90, 0x01, 0x7e,
0xee, 0xf0, 0xa3, 0xef, 0xf0, 0xe4, 0x90, 0x02, 0x08, 0xf0, 0x90, 0x02,
0x0d, 0xf0, 0x20, 0x00, 0x5d, 0x90, 0x01, 0x83, 0xe0, 0x64, 0x04, 0x70,
0x38, 0x90, 0x01, 0x7e, 0xe0, 0xfe, 0xa3, 0xe0, 0xee, 0x54, 0x18, 0xfe,
0xe4, 0xee, 0xb4, 0x10, 0x04, 0x7f, 0x01, 0x80, 0x02, 0x7f, 0x00, 0x90,
0x02, 0x08, 0xef, 0xf0, 0x90, 0x01, 0x7e, 0xe0, 0xfe, 0xa3, 0xe0, 0xee,
0x54, 0x18, 0xfe, 0xe4, 0xee, 0xb4, 0x08, 0x04, 0x7f, 0x01, 0x80, 0x02,
0x7f, 0x00, 0x90, 0x02, 0x0d, 0xef, 0xf0, 0x80, 0x1d, 0x90, 0x01, 0x83,
0xe0, 0xb4, 0x01, 0x16, 0x90, 0x01, 0x7e, 0xe0, 0xfe, 0xa3, 0xe0, 0xee,
0x30, 0xe2, 0x04, 0x7f, 0x01, 0x80, 0x02, 0x7f, 0x00, 0x90, 0x02, 0x08,
0xef, 0xf0, 0x90, 0x02, 0x08, 0xe0, 0xb4, 0x01, 0x1a, 0x90, 0x02, 0x0a,
0xe0, 0x70, 0x14, 0x90, 0x02, 0x05, 0x04, 0xf0, 0x7b, 0x00, 0x7a, 0x08,
0x7d, 0x0e, 0x7c, 0x80, 0x7f, 0x04, 0x12, 0xfa, 0x4c, 0x80, 0x19, 0x90,
0x02, 0x05, 0xe0, 0xb4, 0x01, 0x12, 0x7b, 0xff, 0x7a, 0xf7, 0x7d, 0x0e,
0x7c, 0x80, 0x7f, 0x04, 0x12, 0xfa, 0x8d, 0xe4, 0x90, 0x02, 0x05, 0xf0,
0x90, 0x02, 0x0d, 0xe0, 0xb4, 0x01, 0x19, 0x90, 0x02, 0x0a, 0xe0, 0x70,
0x13, 0x90, 0x02, 0x0e, 0x04, 0xf0, 0x7b, 0xfe, 0x7a, 0xff, 0x7d, 0x60,
0x7c, 0xc8, 0xff, 0x12, 0xfa, 0x8d, 0x80, 0x19, 0x90, 0x02, 0x0e, 0xe0,
0xb4, 0x01, 0x12, 0x7b, 0x01, 0x7a, 0x00, 0x7d, 0x60, 0x7c, 0xc8, 0x7f,
0x01, 0x12, 0xfa, 0x4c, 0xe4, 0x90, 0x02, 0x0e, 0xf0, 0x90, 0x01, 0x83,
0xe0, 0x12, 0xf0, 0x4b, 0xe5, 0xb3, 0x01, 0xe5, 0xab, 0x02, 0xe5, 0x9d,
0x04, 0x00, 0x00, 0xe5, 0xc3, 0x90, 0x95, 0x18, 0xe0, 0x04, 0xf0, 0x12,
0xea, 0x2c, 0x12, 0xc0, 0x5f, 0x80, 0x18, 0x90, 0x95, 0x16, 0xe0, 0x04,
0xf0, 0x80, 0x10, 0x90, 0x95, 0x14, 0xe0, 0x04, 0xf0, 0x12, 0xe5, 0xcf,
0x7f, 0x01, 0x7e, 0x00, 0x12, 0xde, 0x74, 0x90, 0x01, 0x83, 0xe0, 0x90,
0x01, 0x82, 0xf0, 0x02, 0xe2, 0xd4, 0x22, 0x90, 0xe0, 0x03, 0x74, 0x28,
0xf0, 0x90, 0x95, 0x8a, 0x74, 0x16, 0xf0, 0x7b, 0xfe, 0x7a, 0xff, 0x7d,
0x13, 0x7c, 0xcd, 0x7f, 0x01, 0x12, 0xfa, 0x8d, 0x90, 0x94, 0x85, 0x74,
0x0f, 0xf0, 0x90, 0xe0, 0x38, 0xe4, 0xf0, 0x90, 0x94, 0x21, 0xe0, 0x44,
0x01, 0xf0, 0x90, 0x95, 0x2e, 0xe0, 0x44, 0x08, 0xf0, 0x90, 0x94, 0x3d,
0xe0, 0xf0, 0x90, 0x95, 0x8e, 0xe4, 0xf0, 0xfb, 0x7a, 0xff, 0x7d, 0x22,
0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfc, 0x90, 0x7b, 0x10, 0x7a, 0xff, 0x7d,
0x22, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfc, 0x90, 0x90, 0x95, 0x8e, 0x74,
0x01, 0xf0, 0x90, 0x94, 0x40, 0xe0, 0x44, 0x02, 0xf0, 0xe0, 0x54, 0xfd,
0xf0, 0x90, 0x94, 0x42, 0xe0, 0x30, 0xe5, 0xf9, 0x7d, 0x00, 0x7c, 0x80,
0x7f, 0x04, 0x12, 0xfb, 0xf6, 0x90, 0x01, 0x84, 0xee, 0xf0, 0xa3, 0xef,
0xf0, 0x90, 0x01, 0x84, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xee, 0x54, 0xdf,
0x90, 0x01, 0x84, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0x84, 0xe0, 0xfa,
0xa3, 0xe0, 0xfb, 0x7d, 0x00, 0x7c, 0x80, 0x7f, 0x04, 0x12, 0xfc, 0x90,
0x90, 0x01, 0x84, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xee, 0x54, 0xf0, 0x44,
0x0c, 0x90, 0x01, 0x84, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0x84, 0xe0,
0xfa, 0xa3, 0xe0, 0xfb, 0x7d, 0x00, 0x7c, 0x80, 0x7f, 0x04, 0x12, 0xfc,
0x90, 0x7d, 0x08, 0x7c, 0x83, 0x7f, 0x04, 0x12, 0xfb, 0xf6, 0x90, 0x01,
0x84, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0x84, 0xe0, 0xfe, 0xa3,
0xe0, 0x54, 0xe0, 0xff, 0x90, 0x01, 0x84, 0xee, 0xf0, 0xa3, 0xef, 0xf0,
0x90, 0x01, 0x84, 0xe0, 0xfa, 0xa3, 0xe0, 0xfb, 0x7d, 0x08, 0x7c, 0x83,
0x7f, 0x04, 0x12, 0xfc, 0x90, 0x7d, 0xe0, 0x7c, 0xff, 0x7f, 0x04, 0x12,
0xfb, 0xf6, 0x90, 0x01, 0x84, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01,
0x84, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xee, 0x54, 0xdf, 0xfe, 0xef, 0x54,
0xbf, 0x44, 0x40, 0xff, 0x90, 0x01, 0x84, 0xee, 0xf0, 0xa3, 0xef, 0xf0,
0x90, 0x01, 0x84, 0xe0, 0xfa, 0xa3, 0xe0, 0xfb, 0x7d, 0xe0, 0x7c, 0xff,
0x7f, 0x04, 0x12, 0xfc, 0x90, 0x7d, 0x00, 0x7c, 0x80, 0x7f, 0x04, 0x12,
0xfb, 0xf6, 0x90, 0x01, 0x84, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01,
0x84, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xee, 0x44, 0x20, 0x90, 0x01, 0x84,
0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0x84, 0xe0, 0xfa, 0xa3, 0xe0, 0xfb,
0x7d, 0x00, 0x7c, 0x80, 0x7f, 0x04, 0x12, 0xfc, 0x90, 0x7d, 0x3c, 0x7c,
0x83, 0x7f, 0x04, 0x12, 0xfb, 0xf6, 0x90, 0x01, 0x84, 0xee, 0xf0, 0xa3,
0xef, 0xf0, 0x90, 0x01, 0x84, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xee, 0x54,
0xfd, 0x90, 0x01, 0x84, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0x84, 0xe0,
0xfa, 0xa3, 0xe0, 0xfb, 0x7d, 0x3c, 0x7c, 0x83, 0x7f, 0x04, 0x12, 0xfc,
0x90, 0x90, 0x95, 0x2e, 0xe0, 0x54, 0xf7, 0xf0, 0x90, 0xe0, 0x38, 0xe4,
0xf0, 0x90, 0x94, 0x85, 0x74, 0x0e, 0xf0, 0x90, 0x94, 0x84, 0xe0, 0x44,
0x40, 0xf0, 0x12, 0xf3, 0x0c, 0x12, 0xf6, 0xb1, 0x12, 0xf3, 0x0c, 0x7b,
0x01, 0x7a, 0x94, 0x79, 0x20, 0x90, 0x01, 0xce, 0x74, 0x06, 0xf0, 0xa3,
0xe4, 0xf0, 0xa3, 0x74, 0x02, 0xf0, 0x7d, 0x07, 0x12, 0xec, 0x1d, 0x90,
0x94, 0x21, 0xe0, 0x54, 0xfe, 0xf0, 0x90, 0x94, 0x72, 0xe0, 0x54, 0xfd,
0xf0, 0x7b, 0x01, 0x7a, 0x94, 0x79, 0x52, 0xe4, 0x90, 0x01, 0xce, 0xf0,
0xa3, 0xf0, 0xa3, 0x74, 0x7b, 0xf0, 0x7d, 0x06, 0x12, 0xec, 0x1d, 0x90,
0x94, 0x53, 0xe0, 0x44, 0x04, 0xf0, 0x7b, 0x01, 0x7a, 0x00, 0x7d, 0x13,
0x7c, 0xcd, 0x7f, 0x01, 0x12, 0xfa, 0x4c, 0x90, 0x95, 0x9c, 0xe0, 0x44,
0xc0, 0xf0, 0xa3, 0xe0, 0x44, 0x01, 0xf0, 0x90, 0x94, 0x48, 0xe0, 0x44,
0x80, 0xf0, 0x90, 0x94, 0xc4, 0xe0, 0x44, 0x04, 0xf0, 0xa3, 0xe0, 0x44,
0x40, 0xf0, 0x22, 0x7d, 0x02, 0x7c, 0x80, 0x7f, 0x01, 0x12, 0xfb, 0xf6,
0xee, 0x54, 0xc0, 0xfe, 0xe4, 0x70, 0x03, 0xee, 0x64, 0xc0, 0x70, 0x25,
0x7d, 0x05, 0x7c, 0x80, 0x7f, 0x01, 0x12, 0xfb, 0xf6, 0xee, 0x20, 0xe0,
0x18, 0x7d, 0x00, 0x7c, 0x80, 0x7f, 0x01, 0x12, 0xfb, 0xf6, 0xee, 0x30,
0xe7, 0x0b, 0x7f, 0x80, 0x7e, 0x84, 0x7d, 0x1e, 0x7c, 0x00, 0x12, 0xf8,
0xf6, 0x90, 0x94, 0x46, 0x74, 0x04, 0xf0, 0xa3, 0x74, 0x50, 0xf0, 0x90,
0x94, 0x31, 0xe4, 0xf0, 0x90, 0x94, 0x30, 0x74, 0x08, 0xf0, 0x90, 0x94,
0x33, 0x74, 0x0a, 0xf0, 0x90, 0x94, 0x32, 0x74, 0xa0, 0xf0, 0x90, 0x94,
0x37, 0x74, 0xf8, 0xf0, 0x90, 0x94, 0x36, 0x74, 0x0c, 0xf0, 0x90, 0x95,
0x11, 0xe4, 0xf0, 0x90, 0x95, 0x10, 0xf0, 0x90, 0x95, 0x13, 0xf0, 0x90,
0x95, 0x12, 0xf0, 0x90, 0x95, 0x15, 0xf0, 0x90, 0x95, 0x14, 0xf0, 0x90,
0x95, 0x16, 0xf0, 0xa3, 0xf0, 0x90, 0x95, 0x19, 0xf0, 0x90, 0x95, 0x18,
0xf0, 0x7b, 0x01, 0x7a, 0x95, 0x79, 0x3e, 0x90, 0x01, 0x85, 0xf0, 0xa3,
0x74, 0x18, 0xf0, 0x7d, 0xe0, 0x7c, 0xff, 0x12, 0xf8, 0x96, 0x90, 0x94,
0x3d, 0xe0, 0x54, 0xfe, 0xf0, 0x7b, 0x01, 0x7a, 0x94, 0x79, 0x3a, 0x90,
0x01, 0x85, 0xe4, 0xf0, 0xa3, 0x74, 0xfc, 0xf0, 0x7d, 0x03, 0x7c, 0xfe,
0x12, 0xf8, 0x96, 0x90, 0x94, 0x34, 0xe0, 0xb4, 0x44, 0x15, 0x90, 0x94,
0xa4, 0xe4, 0xf0, 0xa3, 0xf0, 0xa3, 0x04, 0xf0, 0xa3, 0x74, 0x7f, 0xf0,
0xa3, 0xe4, 0xf0, 0xa3, 0xf0, 0x80, 0x18, 0x90, 0x94, 0xa4, 0x74, 0x75,
0xf0, 0xa3, 0xe4, 0xf0, 0xa3, 0x74, 0x02, 0xf0, 0xa3, 0x74, 0x75, 0xf0,
0xa3, 0x74, 0x73, 0xf0, 0xa3, 0x04, 0xf0, 0x90, 0x94, 0xaa, 0x74, 0x0a,
0xf0, 0xa3, 0x74, 0x0c, 0xf0, 0xa3, 0x74, 0x76, 0xf0, 0xa3, 0x14, 0xf0,
0xa3, 0x74, 0x12, 0xf0, 0xa3, 0x74, 0x7e, 0xf0, 0xa3, 0x74, 0x75, 0xf0,
0xa3, 0xf0, 0xa3, 0x74, 0x60, 0xf0, 0xa3, 0x74, 0x74, 0xf0, 0xa3, 0x04,
0xf0, 0xa3, 0x74, 0x5e, 0xf0, 0xa3, 0x74, 0x14, 0xf0, 0xa3, 0x74, 0x75,
0xf0, 0xa3, 0x74, 0x0e, 0xf0, 0xa3, 0x74, 0x10, 0xf0, 0xa3, 0x74, 0x04,
0xf0, 0xa3, 0x74, 0x0e, 0xf0, 0xa3, 0x74, 0x06, 0xf0, 0xa3, 0x74, 0x08,
0xf0, 0xa3, 0x74, 0x77, 0xf0, 0xa3, 0x74, 0x16, 0xf0, 0xa3, 0x74, 0x18,
0xf0, 0xa3, 0x74, 0x1a, 0xf0, 0xa3, 0x74, 0x1c, 0xf0, 0xa3, 0x74, 0x7c,
0xf0, 0x90, 0x95, 0x96, 0x74, 0x07, 0xf0, 0xa3, 0xe4, 0xf0, 0x90, 0x95,
0x44, 0x74, 0x03, 0xf0, 0xa3, 0xe4, 0xf0, 0x90, 0x94, 0x50, 0x74, 0xa7,
0xf0, 0xa3, 0xe4, 0xf0, 0x90, 0x94, 0x62, 0xf0, 0xa3, 0x04, 0xf0, 0xa3,
0x74, 0xff, 0xf0, 0xa3, 0xf0, 0x90, 0x94, 0x48, 0x74, 0x1e, 0xf0, 0x90,
0x94, 0x8a, 0xe4, 0xf0, 0xa3, 0x74, 0x02, 0xf0, 0xa3, 0x74, 0x37, 0xf0,
0xa3, 0x74, 0x63, 0xf0, 0x90, 0x94, 0x5a, 0x74, 0x1a, 0xf0, 0xa3, 0x74,
0x1c, 0xf0, 0x90, 0x94, 0x58, 0x74, 0xff, 0xf0, 0xa3, 0x74, 0x0f, 0xf0,
0x90, 0x94, 0x56, 0x74, 0xff, 0xf0, 0xa3, 0x74, 0x0f, 0xf0, 0x90, 0x94,
0x54, 0xe4, 0xf0, 0xa3, 0x74, 0xff, 0xf0, 0x90, 0x94, 0x52, 0x74, 0x48,
0xf0, 0xa3, 0xe4, 0xf0, 0x90, 0x94, 0x3a, 0x74, 0xbc, 0xf0, 0xa3, 0x74,
0x26, 0xf0, 0x90, 0x94, 0x7e, 0x74, 0x7b, 0xf0, 0xa3, 0xf0, 0x7b, 0x13,
0x7a, 0x00, 0x7d, 0x5c, 0x7c, 0x80, 0x7f, 0x04, 0x12, 0xfc, 0x90, 0x7b,
0x04, 0x7a, 0x00, 0x7d, 0x5d, 0x7c, 0x80, 0x7f, 0x04, 0x12, 0xfc, 0x90,
0x7b, 0x77, 0x7a, 0x49, 0x7d, 0x5e, 0x7c, 0x80, 0x7f, 0x04, 0x12, 0xfc,
0x90, 0xe4, 0xfb, 0xfa, 0x7d, 0x29, 0x7c, 0x83, 0x7f, 0x07, 0x12, 0xfc,
0x90, 0x7d, 0x02, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfb, 0xf6, 0xef, 0xb4,
0x47, 0x11, 0xee, 0xb4, 0x87, 0x0d, 0x7b, 0x00, 0x7a, 0x02, 0x7d, 0x08,
0x7c, 0xcd, 0x7f, 0x01, 0x12, 0xfa, 0x4c, 0x22, 0x90, 0x95, 0x9c, 0xe0,
0x54, 0x3f, 0xf0, 0xa3, 0xe0, 0x54, 0xfe, 0xf0, 0x90, 0x94, 0x48, 0xe0,
0x54, 0x7f, 0xf0, 0x90, 0x95, 0x8a, 0x74, 0x16, 0xf0, 0x7b, 0xfe, 0x7a,
0xff, 0x7d, 0x13, 0x7c, 0xcd, 0x7f, 0x01, 0x12, 0xfa, 0x8d, 0x90, 0x94,
0xc4, 0xe0, 0x44, 0x04, 0xf0, 0xa3, 0xe0, 0x44, 0x40, 0xf0, 0x90, 0x94,
0x53, 0xe0, 0x44, 0x08, 0xf0, 0x90, 0x94, 0x62, 0xe0, 0x44, 0x80, 0xf0,
0x90, 0x94, 0x85, 0xe0, 0x44, 0x0f, 0xf0, 0x90, 0xe0, 0x02, 0x74, 0xff,
0xf0, 0x7f, 0x32, 0x7e, 0x00, 0x7d, 0x00, 0x7c, 0x00, 0x12, 0xfd, 0x43,
0x90, 0xe0, 0x02, 0x74, 0x7f, 0xf0, 0x90, 0x94, 0x85, 0x74, 0x06, 0xf0,
0x7f, 0x80, 0x7e, 0x38, 0x7d, 0x01, 0x7c, 0x00, 0x12, 0xfd, 0x43, 0x90,
0x94, 0x21, 0xe0, 0x44, 0x01, 0xf0, 0x90, 0x95, 0x2e, 0xe0, 0x44, 0x08,
0xf0, 0x90, 0x94, 0x3d, 0xe0, 0xf0, 0x90, 0x95, 0x8e, 0xe4, 0xf0, 0x90,
0xe0, 0x03, 0x74, 0x20, 0xf0, 0x7b, 0x00, 0x7a, 0xff, 0x7d, 0x22, 0x7c,
0xc8, 0x7f, 0x01, 0x12, 0xfc, 0x90, 0x7b, 0x40, 0x7a, 0xff, 0x7d, 0x22,
0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfc, 0x90, 0x90, 0x95, 0x8e, 0x74, 0x01,
0xf0, 0x90, 0x94, 0x40, 0xe0, 0x44, 0x02, 0xf0, 0xe0, 0x54, 0xfd, 0xf0,
0x90, 0x94, 0x42, 0xe0, 0x30, 0xe5, 0xf9, 0x7b, 0x44, 0x7a, 0x77, 0x7d,
0x22, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfc, 0x90, 0x7d, 0x00, 0x7c, 0x80,
0x7f, 0x04, 0x12, 0xfb, 0xf6, 0x90, 0x01, 0x84, 0xee, 0xf0, 0xa3, 0xef,
0xf0, 0x90, 0x01, 0x84, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xee, 0x54, 0xdf,
0x90, 0x01, 0x84, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0x84, 0xe0, 0xfa,
0xa3, 0xe0, 0xfb, 0x7d, 0x00, 0x7c, 0x80, 0x7f, 0x04, 0x12, 0xfc, 0x90,
0x90, 0x01, 0x84, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xee, 0x54, 0xf0, 0x44,
0x01, 0x90, 0x01, 0x84, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0x84, 0xe0,
0xfa, 0xa3, 0xe0, 0xfb, 0x7d, 0x00, 0x7c, 0x80, 0x7f, 0x04, 0x12, 0xfc,
0x90, 0x7d, 0x08, 0x7c, 0x83, 0x7f, 0x04, 0x12, 0xfb, 0xf6, 0x90, 0x01,
0x84, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0x84, 0xe0, 0xfe, 0xa3,
0xe0, 0x54, 0xe0, 0x44, 0x14, 0xff, 0x90, 0x01, 0x84, 0xee, 0xf0, 0xa3,
0xef, 0xf0, 0x90, 0x01, 0x84, 0xe0, 0xfa, 0xa3, 0xe0, 0xfb, 0x7d, 0x08,
0x7c, 0x83, 0x7f, 0x04, 0x12, 0xfc, 0x90, 0x7d, 0x00, 0x7c, 0x80, 0x7f,
0x04, 0x12, 0xfb, 0xf6, 0x90, 0x01, 0x84, 0xee, 0xf0, 0xa3, 0xef, 0xf0,
0x90, 0x01, 0x84, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xee, 0x44, 0x20, 0x90,
0x01, 0x84, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0x84, 0xe0, 0xfa, 0xa3,
0xe0, 0xfb, 0x7d, 0x00, 0x7c, 0x80, 0x7f, 0x04, 0x12, 0xfc, 0x90, 0x7d,
0x3c, 0x7c, 0x83, 0x7f, 0x04, 0x12, 0xfb, 0xf6, 0x90, 0x01, 0x84, 0xee,
0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0x84, 0xe0, 0xfe, 0xa3, 0xe0, 0xff,
0xee, 0x54, 0xfd, 0x90, 0x01, 0x84, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01,
0x84, 0xe0, 0xfa, 0xa3, 0xe0, 0xfb, 0x7d, 0x3c, 0x7c, 0x83, 0x7f, 0x04,
0x12, 0xfc, 0x90, 0x90, 0x95, 0x2e, 0xe0, 0x54, 0xf7, 0xf0, 0x90, 0x94,
0x85, 0x74, 0x0f, 0xf0, 0x74, 0x06, 0xf0, 0x74, 0x0f, 0xf0, 0x74, 0x06,
0xf0, 0x90, 0x94, 0x53, 0xe0, 0x54, 0xfb, 0xf0, 0x90, 0x94, 0x84, 0xe0,
0x54, 0xbf, 0xf0, 0x12, 0xf3, 0x0c, 0x12, 0xf6, 0xb1, 0x12, 0xf3, 0x0c,
0x22, 0x90, 0x01, 0xca, 0x12, 0xf0, 0x42, 0x90, 0x01, 0xcd, 0xed, 0xf0,
0x90, 0x01, 0xca, 0x12, 0xf0, 0x39, 0x90, 0x00, 0x01, 0x12, 0xef, 0x97,
0xff, 0x90, 0x01, 0xd1, 0xe4, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0xca,
0x12, 0xf0, 0x39, 0x12, 0xef, 0x7e, 0xfd, 0x7c, 0x00, 0x90, 0x01, 0xd1,
0xe0, 0xa3, 0xe0, 0xfe, 0xe4, 0x2d, 0xff, 0xec, 0x3e, 0x90, 0x01, 0xd1,
0xf0, 0xa3, 0xef, 0xf0, 0xa3, 0xe4, 0xf0, 0xa3, 0x04, 0xf0, 0x90, 0x01,
0xd3, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x01, 0xcd, 0xe0, 0x04, 0xfd,
0xef, 0xa8, 0x05, 0x08, 0x80, 0x05, 0xc3, 0x33, 0xce, 0x33, 0xce, 0xd8,
0xf9, 0xff, 0x90, 0x01, 0xd3, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01,
0xd3, 0x74, 0xff, 0xf5, 0xf0, 0x12, 0xef, 0xf8, 0x90, 0x01, 0xd3, 0xe0,
0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x01, 0xce, 0xe0, 0xfd, 0xef, 0xa8, 0x05,
0x08, 0x80, 0x05, 0xce, 0xc3, 0x13, 0xce, 0x13, 0xd8, 0xf9, 0xff, 0x90,
0x01, 0xce, 0xe0, 0xfd, 0xef, 0xa8, 0x05, 0x08, 0x80, 0x05, 0xc3, 0x33,
0xce, 0x33, 0xce, 0xd8, 0xf9, 0xff, 0x90, 0x01, 0xd3, 0xee, 0xf0, 0xa3,
0xef, 0xf0, 0x90, 0x01, 0xd3, 0xe0, 0xfe, 0xa3, 0xe0, 0xf4, 0xff, 0xee,
0xf4, 0xa3, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0xcf, 0xe0, 0xfe, 0xa3,
0xe0, 0xff, 0x90, 0x01, 0xce, 0xe0, 0xfd, 0xef, 0xa8, 0x05, 0x08, 0x80,
0x05, 0xc3, 0x33, 0xce, 0x33, 0xce, 0xd8, 0xf9, 0xff, 0x90, 0x01, 0xcf,
0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0xd3, 0xe0, 0xfe, 0xa3, 0xe0,
0xff, 0x90, 0x01, 0xcf, 0xe0, 0xfc, 0xa3, 0xe0, 0xfd, 0xec, 0x5e, 0xfe,
0xed, 0x5f, 0xff, 0x90, 0x01, 0xd5, 0xe0, 0xfc, 0xa3, 0xe0, 0xfd, 0x90,
0x01, 0xd1, 0xe0, 0xfa, 0xa3, 0xe0, 0xfb, 0xea, 0x5c, 0xfc, 0xeb, 0x5d,
0x2f, 0xff, 0xec, 0x3e, 0x90, 0x01, 0xd1, 0xf0, 0xa3, 0xef, 0xf0, 0x90,
0x01, 0xd1, 0xe0, 0xa3, 0xe0, 0xff, 0x90, 0x01, 0xca, 0x12, 0xf0, 0x39,
0xef, 0x12, 0xef, 0xc4, 0x90, 0x01, 0xd1, 0xe0, 0xfe, 0xa3, 0xe0, 0xee,
0xff, 0x90, 0x01, 0xca, 0x12, 0xf0, 0x39, 0x90, 0x00, 0x01, 0xef, 0x12,
0xef, 0xd6, 0x22, 0x90, 0x01, 0x3f, 0x74, 0x40, 0xf0, 0xe4, 0x90, 0x01,
0x15, 0xf0, 0x90, 0x01, 0x45, 0x74, 0x80, 0xf0, 0xe4, 0x90, 0x01, 0x1b,
0xf0, 0x90, 0x01, 0x4b, 0x74, 0xc0, 0xf0, 0x90, 0x01, 0x21, 0x74, 0x03,
0xf0, 0x90, 0x01, 0x40, 0x74, 0xe0, 0xf0, 0x90, 0x01, 0x16, 0x74, 0x0f,
0xf0, 0x90, 0x01, 0x46, 0x74, 0x80, 0xf0, 0xe4, 0x90, 0x01, 0x1c, 0xf0,
0x90, 0x01, 0x4c, 0xf0, 0x90, 0x01, 0x22, 0xf0, 0x90, 0x01, 0x41, 0x74,
0xe0, 0xf0, 0x90, 0x01, 0x17, 0x74, 0x0f, 0xf0, 0x90, 0x01, 0x47, 0x74,
0xc0, 0xf0, 0xe4, 0x90, 0x01, 0x1d, 0xf0, 0x90, 0x01, 0x4d, 0xf0, 0x90,
0x01, 0x23, 0xf0, 0x90, 0x01, 0x42, 0x74, 0x10, 0xf0, 0xe4, 0x90, 0x01,
0x18, 0xf0, 0x90, 0x01, 0x48, 0x74, 0xff, 0xf0, 0xe4, 0x90, 0x01, 0x1e,
0xf0, 0x90, 0x01, 0x4e, 0x74, 0xc0, 0xf0, 0x90, 0x01, 0x24, 0x74, 0x03,
0xf0, 0xe4, 0x90, 0x01, 0x43, 0xf0, 0x90, 0x01, 0x19, 0xf0, 0x90, 0x01,
0x49, 0x74, 0x80, 0xf0, 0xe4, 0x90, 0x01, 0x1f, 0xf0, 0x90, 0x01, 0x4f,
0xf0, 0x90, 0x01, 0x25, 0xf0, 0x90, 0x01, 0x5d, 0x74, 0x0f, 0xf0, 0xa3,
0x74, 0xff, 0xf0, 0xa3, 0x74, 0x0f, 0xf0, 0xa3, 0x74, 0xf7, 0xf0, 0xa3,
0xe4, 0xf0, 0xa3, 0x74, 0x33, 0xf0, 0xa3, 0xe4, 0xf0, 0xa3, 0x74, 0x27,
0xf0, 0xa3, 0x74, 0x0f, 0xf0, 0xa3, 0x74, 0xd8, 0xf0, 0xa3, 0x74, 0x0f,
0xf0, 0xa3, 0x74, 0xd7, 0xf0, 0xa3, 0xe4, 0xf0, 0xa3, 0x74, 0x15, 0xf0,
0xa3, 0xe4, 0xf0, 0xa3, 0x74, 0x0f, 0xf0, 0xa3, 0xf0, 0xa3, 0x74, 0xf9,
0xf0, 0xa3, 0x74, 0x0f, 0xf0, 0xa3, 0x74, 0xed, 0xf0, 0xa3, 0xe4, 0xf0,
0xa3, 0x74, 0x22, 0xf0, 0xa3, 0xe4, 0xf0, 0xa3, 0x74, 0x1b, 0xf0, 0xa3,
0x74, 0x0f, 0xf0, 0xa3, 0x74, 0xc8, 0xf0, 0xa3, 0x74, 0x0f, 0xf0, 0xa3,
0x74, 0xc5, 0xf0, 0xa3, 0x74, 0x0f, 0xf0, 0xa3, 0x74, 0xf4, 0xf0, 0xa3,
0x74, 0x0f, 0xf0, 0xa3, 0x74, 0xf0, 0xf0, 0x22, 0x90, 0x01, 0xf6, 0xef,
0xf0, 0xa3, 0xec, 0xf0, 0xa3, 0xed, 0xf0, 0xa3, 0xeb, 0xf0, 0x90, 0x01,
0xf6, 0xe0, 0xff, 0xa3, 0xe0, 0xfc, 0xa3, 0xe0, 0xfd, 0x12, 0xfb, 0xf6,
0x90, 0x01, 0xfd, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0xa3, 0xe4, 0xf0, 0xa3,
0x04, 0xf0, 0x90, 0x01, 0xff, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x01,
0xf9, 0xe0, 0x04, 0xfd, 0xef, 0xa8, 0x05, 0x08, 0x80, 0x05, 0xc3, 0x33,
0xce, 0x33, 0xce, 0xd8, 0xf9, 0xff, 0x90, 0x01, 0xff, 0xee, 0xf0, 0xa3,
0xef, 0xf0, 0x90, 0x01, 0xff, 0x74, 0xff, 0xf5, 0xf0, 0x12, 0xef, 0xf8,
0x90, 0x01, 0xff, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x01, 0xfa, 0xe0,
0xfd, 0xef, 0xa8, 0x05, 0x08, 0x80, 0x05, 0xce, 0xc3, 0x13, 0xce, 0x13,
0xd8, 0xf9, 0xff, 0x90, 0x01, 0xfa, 0xe0, 0xfd, 0xef, 0xa8, 0x05, 0x08,
0x80, 0x05, 0xc3, 0x33, 0xce, 0x33, 0xce, 0xd8, 0xf9, 0xff, 0x90, 0x01,
0xff, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0xff, 0xe0, 0xfe, 0xa3,
0xe0, 0xf4, 0xff, 0xee, 0xf4, 0xa3, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01,
0xfb, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x01, 0xfa, 0xe0, 0xfd, 0xef,
0xa8, 0x05, 0x08, 0x80, 0x05, 0xc3, 0x33, 0xce, 0x33, 0xce, 0xd8, 0xf9,
0xff, 0x90, 0x01, 0xfb, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0xff,
0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x01, 0xfb, 0xe0, 0xfc, 0xa3, 0xe0,
0xfd, 0xec, 0x5e, 0xfe, 0xed, 0x5f, 0xff, 0x90, 0x02, 0x01, 0xe0, 0xfc,
0xa3, 0xe0, 0xfd, 0x90, 0x01, 0xfd, 0xe0, 0xfa, 0xa3, 0xe0, 0xfb, 0xea,
0x5c, 0xfc, 0xeb, 0x5d, 0x2f, 0xff, 0xec, 0x3e, 0x90, 0x01, 0xfd, 0xf0,
0xa3, 0xef, 0xf0, 0x90, 0x01, 0xf6, 0xe0, 0xff, 0xa3, 0xe0, 0xfc, 0xa3,
0xe0, 0xfd, 0x90, 0x01, 0xfd, 0xe0, 0xfa, 0xa3, 0xe0, 0xfb, 0x12, 0xfc,
0x90, 0x22, 0xbb, 0x01, 0x06, 0x89, 0x82, 0x8a, 0x83, 0xe0, 0x22, 0x50,
0x02, 0xe7, 0x22, 0xbb, 0xfe, 0x02, 0xe3, 0x22, 0x89, 0x82, 0x8a, 0x83,
0xe4, 0x93, 0x22, 0xbb, 0x01, 0x0c, 0xe5, 0x82, 0x29, 0xf5, 0x82, 0xe5,
0x83, 0x3a, 0xf5, 0x83, 0xe0, 0x22, 0x50, 0x06, 0xe9, 0x25, 0x82, 0xf8,
0xe6, 0x22, 0xbb, 0xfe, 0x06, 0xe9, 0x25, 0x82, 0xf8, 0xe2, 0x22, 0xe5,
0x82, 0x29, 0xf5, 0x82, 0xe5, 0x83, 0x3a, 0xf5, 0x83, 0xe4, 0x93, 0x22,
0xbb, 0x01, 0x06, 0x89, 0x82, 0x8a, 0x83, 0xf0, 0x22, 0x50, 0x02, 0xf7,
0x22, 0xbb, 0xfe, 0x01, 0xf3, 0x22, 0xf8, 0xbb, 0x01, 0x0d, 0xe5, 0x82,
0x29, 0xf5, 0x82, 0xe5, 0x83, 0x3a, 0xf5, 0x83, 0xe8, 0xf0, 0x22, 0x50,
0x06, 0xe9, 0x25, 0x82, 0xc8, 0xf6, 0x22, 0xbb, 0xfe, 0x05, 0xe9, 0x25,
0x82, 0xc8, 0xf2, 0x22, 0xc5, 0xf0, 0xf8, 0xa3, 0xe0, 0x28, 0xf0, 0xc5,
0xf0, 0xf8, 0xe5, 0x82, 0x15, 0x82, 0x70, 0x02, 0x15, 0x83, 0xe0, 0x38,
0xf0, 0x22, 0xe8, 0x60, 0x0f, 0xec, 0xc3, 0x13, 0xfc, 0xed, 0x13, 0xfd,
0xee, 0x13, 0xfe, 0xef, 0x13, 0xff, 0xd8, 0xf1, 0x22, 0xe0, 0xfc, 0xa3,
0xe0, 0xfd, 0xa3, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x22, 0xec, 0xf0, 0xa3,
0xed, 0xf0, 0xa3, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x22, 0xe0, 0xfb, 0xa3,
0xe0, 0xfa, 0xa3, 0xe0, 0xf9, 0x22, 0xeb, 0xf0, 0xa3, 0xea, 0xf0, 0xa3,
0xe9, 0xf0, 0x22, 0xd0, 0x83, 0xd0, 0x82, 0xf8, 0xe4, 0x93, 0x70, 0x12,
0x74, 0x01, 0x93, 0x70, 0x0d, 0xa3, 0xa3, 0x93, 0xf8, 0x74, 0x01, 0x93,
0xf5, 0x82, 0x88, 0x83, 0xe4, 0x73, 0x74, 0x02, 0x93, 0x68, 0x60, 0xef,
0xa3, 0xa3, 0xa3, 0x80, 0xdf, 0xe4, 0x90, 0x01, 0xce, 0xf0, 0xa3, 0xf0,
0xa3, 0xf0, 0xa3, 0xf0, 0x90, 0x94, 0xcd, 0xf0, 0x90, 0x94, 0xcc, 0xe0,
0x90, 0x01, 0xca, 0xf0, 0xe0, 0x54, 0xf3, 0xf0, 0xe0, 0x90, 0x94, 0xcc,
0xf0, 0x90, 0x01, 0xca, 0xe0, 0x44, 0x0c, 0xf0, 0xe0, 0x90, 0x94, 0xcc,
0xf0, 0xe4, 0x90, 0x01, 0xcb, 0xf0, 0x90, 0x01, 0xcb, 0xe0, 0xc3, 0x94,
0x08, 0x40, 0x03, 0x02, 0xf1, 0x3b, 0xe0, 0x90, 0x94, 0xcd, 0xf0, 0xa3,
0xe0, 0x90, 0x01, 0xcc, 0xf0, 0x90, 0x94, 0xcf, 0xe0, 0x54, 0x03, 0x90,
0x01, 0xcd, 0xf0, 0x90, 0x94, 0xcf, 0xe0, 0x54, 0x02, 0x90, 0x01, 0xca,
0xf0, 0xe0, 0x70, 0x62, 0x90, 0x94, 0xcf, 0xe0, 0x54, 0x01, 0x90, 0x01,
0xcd, 0xf0, 0x90, 0x01, 0xd0, 0xe0, 0xff, 0x90, 0x01, 0xcd, 0xe0, 0x9f,
0x50, 0x17, 0x90, 0x01, 0xd0, 0xe0, 0x90, 0x01, 0xcd, 0xe0, 0x6f, 0x70,
0x41, 0x90, 0x01, 0xcf, 0xe0, 0xff, 0x90, 0x01, 0xcc, 0xe0, 0x9f, 0x40,
0x35, 0x90, 0x01, 0xcb, 0xe0, 0x90, 0x01, 0xce, 0xf0, 0x90, 0x01, 0xcd,
0xe0, 0x90, 0x01, 0xd0, 0xf0, 0x90, 0x01, 0xcc, 0xe0, 0x90, 0x01, 0xcf,
0xf0, 0x90, 0x94, 0xcf, 0xe0, 0x54, 0x01, 0xff, 0x25, 0xe0, 0x25, 0xe0,
0xff, 0x90, 0x94, 0xce, 0xe0, 0x54, 0xc0, 0xfe, 0xc4, 0x13, 0x13, 0x54,
0x03, 0x2f, 0x90, 0x01, 0xd1, 0xf0, 0x90, 0x01, 0xcb, 0xe0, 0x04, 0xf0,
0x02, 0xf0, 0xa2, 0x90, 0x94, 0xcb, 0xe0, 0x54, 0x70, 0xff, 0xc4, 0x54,
0x0f, 0xff, 0x90, 0x01, 0xce, 0xe0, 0xb5, 0x07, 0x09, 0x90, 0x01, 0xd1,
0xe0, 0xc3, 0x94, 0x01, 0x50, 0x07, 0x90, 0x01, 0x00, 0x74, 0x01, 0xf0,
0x22, 0xe4, 0x90, 0x01, 0x00, 0xf0, 0x22, 0x90, 0x94, 0x34, 0xe0, 0xb4,
0x44, 0x04, 0xe4, 0xfe, 0xff, 0x22, 0x90, 0x94, 0x31, 0xe0, 0xb4, 0x0f,
0x03, 0x74, 0xff, 0xf0, 0x90, 0x94, 0x31, 0xe0, 0x60, 0x04, 0xe4, 0xfe,
0xff, 0x22, 0x90, 0x01, 0xce, 0x74, 0x05, 0xf0, 0x90, 0x01, 0xcd, 0x74,
0x3b, 0xf0, 0x90, 0x01, 0xcc, 0x74, 0x01, 0xf0, 0xe4, 0x90, 0x01, 0xcf,
0xf0, 0x90, 0x01, 0xcf, 0xe0, 0xc3, 0x94, 0x05, 0x40, 0x03, 0x02, 0xf2,
0x3e, 0x90, 0x94, 0xfc, 0xe4, 0xf0, 0xf0, 0x90, 0x01, 0xce, 0xe0, 0x90,
0xe0, 0x22, 0xf0, 0x90, 0x01, 0xcd, 0xe0, 0x90, 0xe0, 0x2b, 0xf0, 0x90,
0x01, 0xcc, 0xe0, 0x90, 0xe0, 0x21, 0xf0, 0x90, 0xe0, 0x04, 0x74, 0x10,
0xf0, 0x90, 0xe0, 0x00, 0xe0, 0x30, 0xe3, 0xf9, 0x90, 0x94, 0xfc, 0xe0,
0x90, 0x01, 0xca, 0xf0, 0x90, 0x94, 0xfd, 0xe0, 0x90, 0x01, 0xcb, 0xf0,
0x7d, 0x47, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfb, 0xf6, 0x90, 0x01, 0xd0,
0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0xd0, 0xe0, 0xa3, 0xe0, 0x30,
0xe2, 0x19, 0x90, 0x01, 0xd0, 0xe0, 0xfe, 0xa3, 0xe0, 0xee, 0xff, 0x90,
0x94, 0xfe, 0xe0, 0xc3, 0x9f, 0xe4, 0x94, 0x00, 0x40, 0x27, 0x7e, 0x00,
0x7f, 0x01, 0x22, 0x30, 0x00, 0x0e, 0x90, 0x94, 0xfe, 0xe0, 0xc3, 0x94,
0x04, 0x40, 0x05, 0x7e, 0x00, 0x7f, 0x01, 0x22, 0x20, 0x00, 0x0e, 0x90,
0x94, 0xfe, 0xe0, 0xc3, 0x94, 0x09, 0x40, 0x05, 0x7e, 0x00, 0x7f, 0x01,
0x22, 0x90, 0x01, 0xcf, 0xe0, 0x04, 0xf0, 0x02, 0xf1, 0x99, 0xe4, 0xfe,
0xff, 0x22, 0x90, 0x94, 0x31, 0xe0, 0xb4, 0x0f, 0x03, 0x74, 0xff, 0xf0,
0x90, 0x94, 0x31, 0xe0, 0x60, 0x04, 0xe4, 0xfe, 0xff, 0x22, 0x90, 0x01,
0xd0, 0x74, 0x05, 0xf0, 0x90, 0x01, 0xcf, 0x74, 0x3b, 0xf0, 0x90, 0x01,
0xce, 0x74, 0x01, 0xf0, 0xe4, 0x90, 0x01, 0xd2, 0xf0, 0x90, 0x01, 0xd2,
0xe0, 0xc3, 0x94, 0x64, 0x40, 0x03, 0x02, 0xf3, 0x07, 0x90, 0x94, 0xfc,
0xe4, 0xf0, 0xf0, 0x90, 0x01, 0xd1, 0xf0, 0x90, 0x01, 0xd1, 0xe0, 0xc3,
0x94, 0x64, 0x50, 0x2d, 0x90, 0x01, 0xd0, 0xe0, 0x90, 0xe0, 0x22, 0xf0,
0x90, 0x01, 0xcf, 0xe0, 0x90, 0xe0, 0x2b, 0xf0, 0x90, 0x01, 0xce, 0xe0,
0x90, 0xe0, 0x21, 0xf0, 0x90, 0xe0, 0x04, 0x74, 0x10, 0xf0, 0x90, 0xe0,
0x00, 0xe0, 0x20, 0xe3, 0xf9, 0x90, 0x01, 0xd1, 0xe0, 0x04, 0xf0, 0x80,
0xca, 0x90, 0x94, 0xfc, 0xe0, 0x90, 0x01, 0xca, 0xf0, 0x90, 0x94, 0xfd,
0xe0, 0x90, 0x01, 0xcb, 0xf0, 0x90, 0x01, 0xd2, 0xe0, 0xd3, 0x94, 0x00,
0x40, 0x1c, 0x90, 0x01, 0xcc, 0xe0, 0xff, 0x90, 0x01, 0xca, 0xe0, 0xb5,
0x07, 0x0c, 0x90, 0x01, 0xcd, 0xe0, 0xff, 0x90, 0x01, 0xcb, 0xe0, 0x6f,
0x60, 0x04, 0xe4, 0xfe, 0xff, 0x22, 0x90, 0x94, 0xfc, 0xe0, 0x90, 0x01,
0xcc, 0xf0, 0x90, 0x94, 0xfd, 0xe0, 0x90, 0x01, 0xcd, 0xf0, 0x90, 0x01,
0xd2, 0xe0, 0x04, 0xf0, 0x02, 0xf2, 0x6d, 0x7e, 0x00, 0x7f, 0x01, 0x22,
0x90, 0x94, 0x84, 0xe0, 0x54, 0x40, 0x90, 0x01, 0xca, 0xf0, 0x90, 0x94,
0x84, 0xe0, 0x54, 0xef, 0xf0, 0x90, 0x94, 0x82, 0xe4, 0xf0, 0xa3, 0xf0,
0x90, 0x01, 0xca, 0xe0, 0x44, 0x80, 0x90, 0x94, 0x84, 0xf0, 0xa3, 0x74,
0x0f, 0xf0, 0x90, 0x01, 0xca, 0xe0, 0x44, 0x80, 0x90, 0x94, 0x84, 0xf0,
0xa3, 0x74, 0x0e, 0xf0, 0xe0, 0x44, 0x01, 0xf0, 0x90, 0xe0, 0x01, 0x74,
0x01, 0xf0, 0x90, 0x95, 0x42, 0xe0, 0x44, 0x01, 0xf0, 0x7f, 0x64, 0x7e,
0x00, 0x7d, 0x00, 0x7c, 0x00, 0x12, 0xfd, 0x43, 0x90, 0x95, 0x42, 0xe0,
0x54, 0xfe, 0xf0, 0x90, 0x94, 0x85, 0xe0, 0x54, 0xfe, 0xf0, 0x90, 0x94,
0x84, 0xe0, 0x44, 0x10, 0xf0, 0xa3, 0xe0, 0x44, 0x01, 0xf0, 0x7f, 0x64,
0x7e, 0x00, 0x7d, 0x00, 0x7c, 0x00, 0x12, 0xfd, 0x43, 0x90, 0x94, 0x85,
0xe0, 0x54, 0xfe, 0xf0, 0x7f, 0x64, 0x7e, 0x00, 0x7d, 0x00, 0x7c, 0x00,
0x12, 0xfd, 0x43, 0x90, 0x94, 0x85, 0xe0, 0x44, 0x01, 0xf0, 0x7f, 0x64,
0x7e, 0x00, 0x7d, 0x00, 0x7c, 0x00, 0x12, 0xfd, 0x43, 0x90, 0x94, 0x85,
0xe0, 0x54, 0xfe, 0xf0, 0x90, 0x94, 0x84, 0xe0, 0x54, 0xef, 0xf0, 0x90,
0xe0, 0x01, 0xe4, 0xf0, 0x90, 0x01, 0xca, 0xe0, 0x90, 0x94, 0x84, 0xf0,
0xa3, 0xe4, 0xf0, 0x90, 0x94, 0x84, 0xe0, 0x44, 0x80, 0xf0, 0x22, 0x90,
0x01, 0x9e, 0x12, 0xf0, 0x42, 0x90, 0x01, 0xa1, 0xed, 0xf0, 0x90, 0x01,
0x9e, 0x12, 0xf0, 0x39, 0x90, 0x00, 0x01, 0x12, 0xef, 0x97, 0xff, 0x90,
0x01, 0xa3, 0xe4, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0x9e, 0x12, 0xf0,
0x39, 0x12, 0xef, 0x7e, 0xfd, 0x7c, 0x00, 0x90, 0x01, 0xa3, 0xe0, 0xa3,
0xe0, 0xfe, 0xe4, 0x2d, 0xff, 0xec, 0x3e, 0x90, 0x01, 0xa3, 0xf0, 0xa3,
0xef, 0xf0, 0xa3, 0xe4, 0xf0, 0xa3, 0x04, 0xf0, 0x90, 0x01, 0xa5, 0xe0,
0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x01, 0xa1, 0xe0, 0x04, 0xfd, 0xef, 0xa8,
0x05, 0x08, 0x80, 0x05, 0xc3, 0x33, 0xce, 0x33, 0xce, 0xd8, 0xf9, 0xff,
0x90, 0x01, 0xa5, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0xa5, 0x74,
0xff, 0xf5, 0xf0, 0x12, 0xef, 0xf8, 0x90, 0x01, 0xa5, 0xe0, 0xfe, 0xa3,
0xe0, 0xff, 0x90, 0x01, 0xa3, 0xe0, 0xfc, 0xa3, 0xe0, 0xfd, 0xec, 0x5e,
0xfe, 0xed, 0x5f, 0xff, 0x90, 0x01, 0xa2, 0xe0, 0xfd, 0xef, 0xa8, 0x05,
0x08, 0x80, 0x05, 0xce, 0xc3, 0x13, 0xce, 0x13, 0xd8, 0xf9, 0xff, 0x90,
0x01, 0xa3, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0xa3, 0xe0, 0xfe,
0xa3, 0xe0, 0xff, 0x22, 0x7b, 0x00, 0x7a, 0x40, 0x7d, 0x42, 0x7c, 0xc8,
0x7f, 0x01, 0x12, 0xfa, 0x4c, 0x90, 0x01, 0xfa, 0x74, 0x0e, 0xf0, 0xa3,
0xe4, 0xf0, 0xa3, 0x74, 0x03, 0xf0, 0x7b, 0x0f, 0x7d, 0x72, 0x7c, 0x83,
0x7f, 0x07, 0x12, 0xee, 0x70, 0x7b, 0x03, 0x7a, 0x00, 0x7d, 0x50, 0x7c,
0x83, 0x7f, 0x07, 0x12, 0xfc, 0x90, 0x7b, 0x01, 0x7a, 0x06, 0x7d, 0x56,
0x7c, 0x83, 0x7f, 0x07, 0x12, 0xfc, 0x90, 0x7b, 0x01, 0x7a, 0x00, 0x7d,
0x57, 0x7c, 0x83, 0x7f, 0x07, 0x12, 0xfc, 0x90, 0x7b, 0x01, 0x7a, 0x00,
0x7d, 0x74, 0x7c, 0x83, 0x7f, 0x07, 0x12, 0xfc, 0x90, 0x90, 0x01, 0xfa,
0x74, 0x09, 0xf0, 0xa3, 0xe4, 0xf0, 0xa3, 0x04, 0xf0, 0x7b, 0x09, 0xe4,
0xfd, 0xfc, 0x7f, 0x07, 0x12, 0xee, 0x70, 0x7d, 0x14, 0x7c, 0x00, 0x7f,
0x07, 0x12, 0xfb, 0xf6, 0xef, 0x4e, 0x70, 0xf3, 0x7b, 0x00, 0x7a, 0x20,
0x7d, 0x42, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfa, 0x4c, 0x90, 0x02, 0x0b,
0xe4, 0xf0, 0xa3, 0x04, 0xf0, 0x22, 0x90, 0x02, 0x1a, 0xef, 0xf0, 0xa3,
0xec, 0xf0, 0xa3, 0xed, 0xf0, 0xa3, 0xeb, 0xf0, 0x90, 0x02, 0x1a, 0xe0,
0xff, 0xa3, 0xe0, 0xfc, 0xa3, 0xe0, 0xfd, 0x12, 0xfb, 0xf6, 0x90, 0x02,
0x1f, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0xa3, 0xe4, 0xf0, 0xa3, 0x04, 0xf0,
0x90, 0x02, 0x21, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x02, 0x1d, 0xe0,
0x04, 0xfd, 0xef, 0xa8, 0x05, 0x08, 0x80, 0x05, 0xc3, 0x33, 0xce, 0x33,
0xce, 0xd8, 0xf9, 0xff, 0x90, 0x02, 0x21, 0xee, 0xf0, 0xa3, 0xef, 0xf0,
0x90, 0x02, 0x21, 0x74, 0xff, 0xf5, 0xf0, 0x12, 0xef, 0xf8, 0x90, 0x02,
0x21, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x90, 0x02, 0x1f, 0xe0, 0xfc, 0xa3,
0xe0, 0xfd, 0xec, 0x5e, 0xfe, 0xed, 0x5f, 0xff, 0x90, 0x02, 0x1e, 0xe0,
0xfd, 0xef, 0xa8, 0x05, 0x08, 0x80, 0x05, 0xce, 0xc3, 0x13, 0xce, 0x13,
0xd8, 0xf9, 0xff, 0x90, 0x02, 0x1f, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90,
0x02, 0x1f, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x22, 0x7b, 0x0a, 0x7a, 0x00,
0x7d, 0x43, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfc, 0x90, 0x90, 0x01, 0xfa,
0x74, 0x0e, 0xf0, 0xe4, 0xa3, 0xf0, 0xa3, 0xf0, 0x7b, 0x0f, 0x7d, 0x72,
0x7c, 0x83, 0x7f, 0x07, 0x12, 0xee, 0x70, 0x7b, 0x02, 0x7a, 0x00, 0x7d,
0x50, 0x7c, 0x83, 0x7f, 0x07, 0x12, 0xfc, 0x90, 0x7b, 0x00, 0x7a, 0x06,
0x7d, 0x56, 0x7c, 0x83, 0x7f, 0x07, 0x12, 0xfc, 0x90, 0xe4, 0xfb, 0xfa,
0x7d, 0x57, 0x7c, 0x83, 0x7f, 0x07, 0x12, 0xfc, 0x90, 0xe4, 0xfb, 0xfa,
0x7d, 0x74, 0x7c, 0x83, 0x7f, 0x07, 0x12, 0xfc, 0x90, 0x90, 0x01, 0xfa,
0x74, 0x09, 0xf0, 0xa3, 0xe4, 0xf0, 0xa3, 0x04, 0xf0, 0x7b, 0x09, 0xe4,
0xfd, 0xfc, 0x7f, 0x07, 0x12, 0xee, 0x70, 0x7d, 0x14, 0x7c, 0x00, 0x7f,
0x07, 0x12, 0xfb, 0xf6, 0xef, 0x4e, 0x70, 0xf3, 0x74, 0x0a, 0xfb, 0xfa,
0x7d, 0x43, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfc, 0x90, 0xe4, 0x90, 0x02,
0x0b, 0xf0, 0xa3, 0xf0, 0x22, 0x7d, 0x20, 0x7c, 0xc8, 0x7f, 0x01, 0x12,
0xfb, 0xf6, 0x90, 0x01, 0xca, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01,
0xca, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xa3, 0xee, 0xf0, 0xa3, 0xef, 0xf0,
0x7d, 0x20, 0x7c, 0xc8, 0x7f, 0x01, 0x12, 0xfb, 0xf6, 0x90, 0x01, 0xca,
0xee, 0xf0, 0xa3, 0xef, 0xf0, 0xa3, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x90,
0x01, 0xca, 0xe0, 0xfc, 0xa3, 0xe0, 0xb5, 0x07, 0xd1, 0xec, 0xb5, 0x06,
0xcd, 0x90, 0x01, 0xca, 0xfe, 0xa3, 0xe0, 0xf4, 0xee, 0xf4, 0xc4, 0x13,
0x54, 0x07, 0xff, 0x90, 0x01, 0xca, 0xe0, 0xa3, 0xe0, 0x54, 0x07, 0x5f,
0x90, 0x01, 0xce, 0xf0, 0xe0, 0xff, 0x90, 0x02, 0x09, 0xe0, 0x6f, 0x60,
0x17, 0x90, 0x94, 0x27, 0x74, 0x0e, 0xf0, 0x7d, 0x13, 0x7c, 0xca, 0x7f,
0x01, 0x12, 0xfb, 0xf6, 0x90, 0x01, 0xca, 0xee, 0xf0, 0xa3, 0xef, 0xf0,
0x90, 0x01, 0xce, 0xe0, 0x90, 0x02, 0x09, 0xf0, 0x22, 0x90, 0x94, 0x21,
0xe0, 0x44, 0x01, 0xf0, 0x90, 0x94, 0x85, 0xe0, 0x44, 0x08, 0xf0, 0x90,
0x94, 0x50, 0xe0, 0x44, 0x10, 0xf0, 0x7b, 0x01, 0x7a, 0x94, 0x79, 0x52,
0xe4, 0x90, 0x01, 0xce, 0xf0, 0xa3, 0xf0, 0xa3, 0xf0, 0x7d, 0x06, 0x12,
0xec, 0x1d, 0x90, 0x94, 0x53, 0xe0, 0x44, 0x04, 0xf0, 0x90, 0xe0, 0x02,
0x74, 0x5f, 0xf0, 0x90, 0x95, 0x9c, 0xe0, 0x44, 0x20, 0xf0, 0x90, 0x94,
0x49, 0xe0, 0x44, 0x01, 0xf0, 0x90, 0x94, 0x48, 0xe0, 0x54, 0xbf, 0xf0,
0xe0, 0x44, 0x40, 0xf0, 0x7f, 0x00, 0x7e, 0x71, 0x7d, 0x02, 0x7c, 0x00,
0x12, 0xfd, 0x43, 0x90, 0x94, 0x49, 0xe0, 0x30, 0xe1, 0xf9, 0x90, 0x95,
0x9c, 0xe0, 0x54, 0xdf, 0xf0, 0x90, 0x94, 0x53, 0xe0, 0x54, 0xfb, 0xf0,
0x90, 0xe0, 0x02, 0x74, 0x5f, 0xf0, 0x90, 0x94, 0x50, 0xe0, 0x54, 0xef,
0xf0, 0x90, 0x94, 0x85, 0xe0, 0x54, 0xf7, 0xf0, 0x22, 0x90, 0x94, 0x31,
0xe0, 0xb4, 0x0f, 0x03, 0x74, 0xff, 0xf0, 0x90, 0x94, 0x31, 0xe0, 0x60,
0x04, 0xe4, 0xfe, 0xff, 0x22, 0xe4, 0x90, 0x01, 0xcd, 0xf0, 0x90, 0x01,
0xcd, 0xe0, 0xc3, 0x94, 0x08, 0x50, 0x58, 0x90, 0x94, 0xcd, 0xe4, 0xf0,
0x90, 0x94, 0xcc, 0xe0, 0x90, 0x01, 0xcc, 0xf0, 0xe0, 0x54, 0xf3, 0xf0,
0xe0, 0x90, 0x94, 0xcc, 0xf0, 0x90, 0x01, 0xcc, 0xe0, 0x44, 0x0c, 0xf0,
0xe0, 0x90, 0x94, 0xcc, 0xf0, 0x90, 0x01, 0xcd, 0xe0, 0x90, 0x94, 0xcd,
0xf0, 0xa3, 0xe0, 0x90, 0x01, 0xca, 0xf0, 0x90, 0x94, 0xcf, 0xe0, 0x54,
0x03, 0x90, 0x01, 0xcb, 0xf0, 0xe0, 0x20, 0xe1, 0x12, 0x54, 0x01, 0xf0,
0xe0, 0x70, 0x08, 0x90, 0x01, 0xca, 0xe0, 0x94, 0x40, 0x40, 0x04, 0xe4,
0xfe, 0xff, 0x22, 0x90, 0x01, 0xcd, 0xe0, 0x04, 0xf0, 0x80, 0x9f, 0x7e,
0x00, 0x7f, 0x01, 0x22, 0xe4, 0x90, 0x02, 0x0f, 0xf0, 0xa3, 0x74, 0x40,
0xf0, 0xa3, 0x74, 0x80, 0xf0, 0xa3, 0x74, 0xc0, 0xf0, 0xe0, 0xa3, 0xf0,
0x90, 0x94, 0x86, 0x74, 0x03, 0xf0, 0x90, 0x94, 0x84, 0x74, 0x10, 0xf0,
0xe4, 0x90, 0x02, 0x18, 0xf0, 0xa3, 0xf0, 0x90, 0x02, 0x18, 0xe0, 0xfe,
0xa3, 0xe0, 0xd3, 0x94, 0x03, 0xee, 0x64, 0x80, 0x94, 0x80, 0x50, 0x2b,
0x90, 0x02, 0x18, 0xe0, 0xa3, 0xe0, 0x90, 0x94, 0x83, 0xf0, 0x90, 0x02,
0x18, 0xe0, 0xfe, 0xa3, 0xe0, 0x24, 0x0f, 0xf5, 0x82, 0x74, 0x02, 0x3e,
0xf5, 0x83, 0xe0, 0x90, 0x94, 0x82, 0xf0, 0x90, 0x02, 0x18, 0xe4, 0x75,
0xf0, 0x01, 0x12, 0xef, 0xf8, 0x80, 0xc4, 0x90, 0x94, 0x83, 0x74, 0x08,
0xf0, 0x90, 0x02, 0x13, 0xe0, 0x90, 0x94, 0x82, 0xf0, 0x22, 0x7f, 0x80,
0x7e, 0x38, 0x7d, 0x01, 0x7c, 0x00, 0x12, 0xfd, 0x43, 0x7f, 0xff, 0x7e,
0xff, 0x7d, 0x07, 0x7c, 0x00, 0x12, 0xf8, 0xf6, 0x7d, 0x00, 0x7c, 0x80,
0x7f, 0x01, 0x12, 0xfb, 0xf6, 0xef, 0x54, 0x0c, 0xff, 0x90, 0x01, 0xd9,
0xe4, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0xd9, 0xe0, 0xfe, 0xa3, 0xe0,
0x64, 0x08, 0x4e, 0x70, 0x07, 0x90, 0xe0, 0x00, 0xe0, 0x30, 0xe3, 0xd8,
0x90, 0xe0, 0x00, 0xe0, 0x30, 0xe3, 0x0e, 0x7d, 0xff, 0x7c, 0xf7, 0x7f,
0x2b, 0x7e, 0xc8, 0x12, 0xfb, 0x49, 0x7f, 0x00, 0x22, 0x90, 0x01, 0xd9,
0xe0, 0xfe, 0xa3, 0xe0, 0x64, 0x0c, 0x4e, 0x70, 0x0e, 0x7d, 0xff, 0x7c,
0xfd, 0x7f, 0x2b, 0x7e, 0xc8, 0x12, 0xfb, 0x49, 0x7f, 0x00, 0x22, 0x7f,
0x01, 0x22, 0x90, 0x01, 0x80, 0x12, 0xf0, 0x42, 0x90, 0x01, 0x83, 0xec,
0xf0, 0xa3, 0xed, 0xf0, 0x90, 0x01, 0x80, 0x12, 0xf0, 0x39, 0x90, 0x00,
0x01, 0x12, 0xef, 0x97, 0xf5, 0xa5, 0x90, 0x01, 0x80, 0x12, 0xf0, 0x39,
0x12, 0xef, 0x7e, 0xf5, 0xa4, 0x90, 0x01, 0x83, 0xe0, 0xfe, 0xa3, 0xe0,
0xff, 0xe5, 0xa5, 0x5e, 0xfe, 0xe5, 0xa4, 0x5f, 0xff, 0xa3, 0xe0, 0xfc,
0xa3, 0xe0, 0xfd, 0xee, 0x4c, 0xfe, 0xef, 0x4d, 0x8e, 0xa5, 0xf5, 0xa4,
0x90, 0x01, 0x80, 0x12, 0xf0, 0x39, 0xe5, 0xa4, 0x12, 0xef, 0xc4, 0x90,
0x01, 0x80, 0x12, 0xf0, 0x39, 0x90, 0x00, 0x01, 0xe5, 0xa5, 0x12, 0xef,
0xd6, 0x22, 0x90, 0x01, 0xdf, 0x12, 0xf0, 0x2d, 0x90, 0x01, 0xdf, 0x12,
0xf0, 0x21, 0xef, 0xe4, 0x90, 0x01, 0xe3, 0xef, 0xf0, 0x90, 0x01, 0xdf,
0x12, 0xf0, 0x21, 0xe4, 0xff, 0xee, 0xe4, 0xfd, 0xfc, 0x78, 0x08, 0x12,
0xf0, 0x0e, 0x90, 0x01, 0xe4, 0xef, 0xf0, 0x90, 0x01, 0xdf, 0x12, 0xf0,
0x21, 0xe4, 0xff, 0xfe, 0xed, 0xe4, 0xfc, 0x78, 0x10, 0x12, 0xf0, 0x0e,
0x90, 0x01, 0xe5, 0xef, 0xf0, 0x90, 0x01, 0xe4, 0xe0, 0x90, 0xe0, 0x2b,
0xf0, 0x90, 0x01, 0xe3, 0xe0, 0x90, 0xe0, 0x22, 0xf0, 0x90, 0x01, 0xe5,
0xe0, 0x90, 0xe0, 0x21, 0xf0, 0x90, 0xe0, 0x04, 0xe0, 0x44, 0x10, 0xf0,
0x22, 0x90, 0x01, 0xca, 0xef, 0xf0, 0xa3, 0xec, 0xf0, 0xa3, 0xed, 0xf0,
0x90, 0x01, 0xca, 0xe0, 0xff, 0xa3, 0xe0, 0xfc, 0xa3, 0xe0, 0xfd, 0x12,
0xfb, 0xf6, 0x90, 0x01, 0xcd, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01,
0xcd, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xa3, 0xee, 0xf0, 0xa3, 0xef, 0xf0,
0x90, 0x01, 0xcb, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x12, 0xfc, 0xed, 0x90,
0x01, 0xcd, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0xa3, 0xe0, 0xfe, 0xa3, 0xe0,
0xff, 0x90, 0x01, 0xcd, 0xe0, 0xfc, 0xa3, 0xe0, 0xb5, 0x07, 0xcf, 0xec,
0xb5, 0x06, 0xcb, 0x90, 0x01, 0xcd, 0xfe, 0xa3, 0xe0, 0xff, 0x22, 0x90,
0x02, 0x23, 0xef, 0xf0, 0xa3, 0xec, 0xf0, 0xa3, 0xed, 0xf0, 0xa3, 0xea,
0xf0, 0xa3, 0xeb, 0xf0, 0x90, 0x02, 0x23, 0xe0, 0xf5, 0xa1, 0xa3, 0xe0,
0xfe, 0xa3, 0xe0, 0xff, 0x8e, 0xa3, 0x8f, 0xa2, 0xe4, 0xf5, 0xa0, 0x20,
0xa0, 0xfd, 0x90, 0x02, 0x26, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xe5, 0xa7,
0x5e, 0xfe, 0xe5, 0xa6, 0x5f, 0xff, 0xa3, 0xe0, 0xfc, 0xa3, 0xe0, 0xfd,
0xee, 0x4c, 0xfe, 0xef, 0x4d, 0x8e, 0xa5, 0xf5, 0xa4, 0x75, 0xa0, 0x10,
0x20, 0xa0, 0xfd, 0x22, 0x90, 0x01, 0xd9, 0xee, 0xf0, 0xa3, 0xef, 0xf0,
0xa3, 0xec, 0xf0, 0xa3, 0xed, 0xf0, 0xa3, 0xea, 0xf0, 0xa3, 0xeb, 0xf0,
0x90, 0x01, 0xd9, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x8e, 0xa3, 0x8f, 0xa2,
0xe4, 0xf5, 0xa0, 0x20, 0xa0, 0xfd, 0x90, 0x01, 0xdb, 0xe0, 0xfe, 0xa3,
0xe0, 0xff, 0xe5, 0xa7, 0x5e, 0xfe, 0xe5, 0xa6, 0x5f, 0xff, 0xa3, 0xe0,
0xfc, 0xa3, 0xe0, 0xfd, 0xee, 0x4c, 0xfe, 0xef, 0x4d, 0x8e, 0xa5, 0xf5,
0xa4, 0x75, 0xa0, 0x10, 0x20, 0xa0, 0xfd, 0x22, 0x90, 0x01, 0xca, 0xef,
0xf0, 0xa3, 0xec, 0xf0, 0xa3, 0xed, 0xf0, 0xa3, 0xea, 0xf0, 0xa3, 0xeb,
0xf0, 0x90, 0x01, 0xca, 0xe0, 0xf5, 0xa1, 0xa3, 0xe0, 0xfe, 0xa3, 0xe0,
0xff, 0x8e, 0xa3, 0x8f, 0xa2, 0xe4, 0xf5, 0xa0, 0x20, 0xa0, 0xfd, 0x90,
0x01, 0xcd, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xe5, 0xa7, 0x4e, 0xfe, 0xe5,
0xa6, 0x4f, 0x8e, 0xa5, 0xf5, 0xa4, 0x75, 0xa0, 0x10, 0x20, 0xa0, 0xfd,
0x22, 0x90, 0x01, 0xca, 0xef, 0xf0, 0xa3, 0xec, 0xf0, 0xa3, 0xed, 0xf0,
0xa3, 0xea, 0xf0, 0xa3, 0xeb, 0xf0, 0x90, 0x01, 0xca, 0xe0, 0xf5, 0xa1,
0xa3, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x8e, 0xa3, 0x8f, 0xa2, 0xe4, 0xf5,
0xa0, 0x20, 0xa0, 0xfd, 0x90, 0x01, 0xcd, 0xe0, 0xfe, 0xa3, 0xe0, 0xff,
0xe5, 0xa7, 0x5e, 0xfe, 0xe5, 0xa6, 0x5f, 0x8e, 0xa5, 0xf5, 0xa4, 0x75,
0xa0, 0x10, 0x20, 0xa0, 0xfd, 0x22, 0x90, 0x02, 0x2a, 0xef, 0xf0, 0xa3,
0xec, 0xf0, 0xa3, 0xed, 0xf0, 0xa3, 0xea, 0xf0, 0xa3, 0xeb, 0xf0, 0x90,
0x02, 0x2a, 0xe0, 0xf5, 0xa1, 0xa3, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x8e,
0xa3, 0x8f, 0xa2, 0xe4, 0xf5, 0xa0, 0x20, 0xa0, 0xfd, 0x90, 0x02, 0x2d,
0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xe5, 0xa7, 0x6e, 0xfe, 0xe5, 0xa6, 0x6f,
0x8e, 0xa5, 0xf5, 0xa4, 0x75, 0xa0, 0x10, 0x20, 0xa0, 0xfd, 0x22, 0x90,
0x01, 0xd9, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0xa3, 0xec, 0xf0, 0xa3, 0xed,
0xf0, 0x90, 0x01, 0xd9, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x8e, 0xa3, 0x8f,
0xa2, 0xe4, 0xf5, 0xa0, 0x20, 0xa0, 0xfd, 0x90, 0x01, 0xdb, 0xe0, 0xfe,
0xa3, 0xe0, 0xff, 0xe5, 0xa7, 0x4e, 0xfe, 0xe5, 0xa6, 0x4f, 0x8e, 0xa5,
0xf5, 0xa4, 0x75, 0xa0, 0x10, 0x20, 0xa0, 0xfd, 0x22, 0x90, 0x01, 0xdb,
0xee, 0xf0, 0xa3, 0xef, 0xf0, 0xa3, 0xec, 0xf0, 0xa3, 0xed, 0xf0, 0x90,
0x01, 0xdb, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x8e, 0xa3, 0x8f, 0xa2, 0xe4,
0xf5, 0xa0, 0x20, 0xa0, 0xfd, 0x90, 0x01, 0xdd, 0xe0, 0xfe, 0xa3, 0xe0,
0xff, 0xe5, 0xa7, 0x5e, 0xfe, 0xe5, 0xa6, 0x5f, 0x8e, 0xa5, 0xf5, 0xa4,
0x75, 0xa0, 0x10, 0x20, 0xa0, 0xfd, 0x22, 0x90, 0x02, 0x2f, 0xee, 0xf0,
0xa3, 0xef, 0xf0, 0xa3, 0xec, 0xf0, 0xa3, 0xed, 0xf0, 0x90, 0x02, 0x2f,
0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x8e, 0xa3, 0x8f, 0xa2, 0xe4, 0xf5, 0xa0,
0x20, 0xa0, 0xfd, 0x90, 0x02, 0x31, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xe5,
0xa7, 0x6e, 0xfe, 0xe5, 0xa6, 0x6f, 0x8e, 0xa5, 0xf5, 0xa4, 0x75, 0xa0,
0x10, 0x20, 0xa0, 0xfd, 0x22, 0x7d, 0x55, 0x7c, 0xc8, 0x7f, 0x01, 0x12,
0xfb, 0xf6, 0x90, 0x01, 0x84, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01,
0x84, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0xee, 0x44, 0x08, 0xfe, 0xef, 0x44,
0x88, 0xff, 0x90, 0x01, 0x84, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01,
0x84, 0xe0, 0xfc, 0xa3, 0xe0, 0xfd, 0x7f, 0x54, 0x7e, 0xc8, 0x12, 0xfc,
0xc2, 0x22, 0x90, 0x01, 0xdb, 0xef, 0xf0, 0xa3, 0xec, 0xf0, 0xa3, 0xed,
0xf0, 0x90, 0x01, 0xdb, 0xe0, 0xf5, 0xa1, 0xa3, 0xe0, 0xfe, 0xa3, 0xe0,
0xff, 0x8e, 0xa3, 0x8f, 0xa2, 0xe4, 0xf5, 0xa0, 0x20, 0xa0, 0xfd, 0x90,
0x01, 0xde, 0xe5, 0xa7, 0xf0, 0xa3, 0xe5, 0xa6, 0xf0, 0x90, 0x01, 0xde,
0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x22, 0xe5, 0xab, 0x70, 0x10, 0x7f, 0x0d,
0x7e, 0x60, 0x12, 0xfd, 0x0c, 0x90, 0x94, 0x38, 0xee, 0xf0, 0xa3, 0xef,
0xf0, 0x22, 0xaf, 0xab, 0xef, 0x90, 0x94, 0x38, 0xe0, 0xe4, 0xef, 0xf0,
0x90, 0xff, 0xff, 0xe4, 0x93, 0xff, 0x90, 0xff, 0xfe, 0xe4, 0x93, 0x6f,
0xff, 0x90, 0x94, 0x39, 0xe0, 0xe4, 0xef, 0xf0, 0x22, 0x90, 0x02, 0x33,
0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x02, 0x33, 0xe0, 0xa3, 0xe0, 0xa3,
0xf0, 0x90, 0x02, 0x33, 0xe0, 0xfe, 0xa3, 0xe0, 0xee, 0x90, 0x02, 0x36,
0xf0, 0x90, 0x02, 0x35, 0xe0, 0x90, 0xe0, 0x17, 0xf0, 0x90, 0x02, 0x36,
0xe0, 0x90, 0xe0, 0x18, 0xf0, 0x90, 0xe0, 0x04, 0x74, 0xe0, 0xf0, 0x22,
0x90, 0x01, 0x9e, 0xef, 0xf0, 0xa3, 0xec, 0xf0, 0xa3, 0xed, 0xf0, 0xa3,
0xea, 0xf0, 0xa3, 0xeb, 0xf0, 0x90, 0x01, 0x9e, 0xe0, 0xf5, 0xa1, 0xa3,
0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x8e, 0xa3, 0x8f, 0xa2, 0xa3, 0xe0, 0xfe,
0xa3, 0xe0, 0xff, 0x8e, 0xa5, 0x8f, 0xa4, 0x75, 0xa0, 0x10, 0x20, 0xa0,
0xfd, 0x22, 0x90, 0x01, 0xd9, 0xee, 0xf0, 0xa3, 0xef, 0xf0, 0xa3, 0xec,
0xf0, 0xa3, 0xed, 0xf0, 0x90, 0x01, 0xd9, 0xe0, 0xfe, 0xa3, 0xe0, 0xff,
0x8e, 0xa3, 0x8f, 0xa2, 0xa3, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x8e, 0xa5,
0x8f, 0xa4, 0x75, 0xa0, 0x10, 0x20, 0xa0, 0xfd, 0x22, 0x90, 0x01, 0xd9,
0xee, 0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x01, 0xd9, 0xe0, 0xfe, 0xa3, 0xe0,
0xff, 0x8e, 0xa3, 0x8f, 0xa2, 0xe4, 0xf5, 0xa0, 0x20, 0xa0, 0xfd, 0xaf,
0xa6, 0xae, 0xa7, 0x22, 0x90, 0x01, 0x7e, 0xee, 0xf0, 0xa3, 0xef, 0xf0,
0xe0, 0xa3, 0xf0, 0x90, 0x01, 0x7e, 0xe0, 0x90, 0x01, 0x81, 0xf0, 0x90,
0x01, 0x80, 0xe0, 0xfe, 0xa3, 0xe0, 0xff, 0x22, 0x90, 0x02, 0x39, 0xee,
0xf0, 0xa3, 0xef, 0xf0, 0x90, 0x02, 0x39, 0xe0, 0xfe, 0xa3, 0xe0, 0xff,
0x12, 0xfc, 0x5d, 0x90, 0xe0, 0x00, 0xe0, 0x30, 0xe4, 0xf9, 0x22, 0x90,
0x01, 0xdb, 0x12, 0xf0, 0x2d, 0x90, 0x01, 0xdb, 0x12, 0xf0, 0x21, 0x12,
0xf8, 0xf6, 0x90, 0xe0, 0x00, 0xe0, 0x30, 0xe3, 0xf9, 0x22, 0x41, 0x02,
0x06, 0x00, 0x41, 0x02, 0x07, 0x00, 0x41, 0x01, 0xf3, 0x00, 0x41, 0x01,
0xe8, 0x00, 0x22, 0x22, 0x22, 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, 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, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xd2, 0xe8, 0xd2, 0xaf,
0x22, 0xc0, 0xe0, 0xc0, 0xd0, 0xd2, 0xd4, 0x05, 0x86, 0x90, 0x94, 0x24,
0xe0, 0xf8, 0x05, 0x84, 0xe0, 0xf9, 0x53, 0x91, 0xef, 0x64, 0xca, 0x60,
0x1c, 0xe9, 0x64, 0xcb, 0x60, 0x17, 0xe9, 0x64, 0xee, 0x60, 0x23, 0xe9,
0x64, 0x11, 0x60, 0x44, 0xe9, 0x64, 0x66, 0x70, 0x02, 0xc1, 0xbb, 0x78,
0x0e, 0x79, 0x0e, 0xe1, 0x09, 0xe8, 0xc3, 0x33, 0xf5, 0x84, 0xe9, 0x33,
0xf5, 0x85, 0xe0, 0xf8, 0x05, 0x84, 0xe0, 0xf9, 0xe1, 0x09, 0x05, 0x84,
0x74, 0xcd, 0xf0, 0x05, 0x84, 0x74, 0xab, 0xf0, 0xe5, 0x91, 0x30, 0xe4,
0xfb, 0x75, 0x84, 0x24, 0xe0, 0xfa, 0x05, 0x84, 0xe0, 0xfb, 0x53, 0x91,
0xef, 0x8a, 0x84, 0x8b, 0x85, 0xe0, 0xf8, 0xa3, 0xe0, 0xf9, 0xe1, 0x09,
0x05, 0x84, 0x74, 0xcd, 0xf0, 0x05, 0x84, 0x74, 0xab, 0xf0, 0xe5, 0x91,
0x30, 0xe4, 0xfb, 0x75, 0x84, 0x24, 0xe0, 0xfa, 0x05, 0x84, 0xe0, 0xfb,
0x53, 0x91, 0xef, 0x05, 0x84, 0x74, 0xcd, 0xf0, 0x05, 0x84, 0x74, 0xab,
0xf0, 0xe5, 0x91, 0x30, 0xe4, 0xfb, 0x75, 0x84, 0x24, 0xe0, 0xfc, 0x05,
0x84, 0xe0, 0xfd, 0x53, 0x91, 0xef, 0x8a, 0x84, 0x8b, 0x85, 0xec, 0xf0,
0x05, 0x84, 0xed, 0xf0, 0x90, 0x94, 0x25, 0xd8, 0xbb, 0x78, 0x21, 0x79,
0x43, 0xe1, 0x09, 0x05, 0x84, 0x74, 0xcd, 0xf0, 0x05, 0x84, 0x74, 0xab,
0xf0, 0xe5, 0x91, 0x30, 0xe4, 0xfb, 0x75, 0x84, 0x24, 0xe0, 0xfa, 0x05,
0x84, 0xe0, 0xfb, 0x53, 0x91, 0xef, 0x05, 0x84, 0x74, 0xcd, 0xf0, 0x05,
0x84, 0x74, 0xab, 0xf0, 0xe5, 0x91, 0x30, 0xe4, 0xfb, 0x75, 0x84, 0x24,
0xe0, 0xfc, 0x05, 0x84, 0xe0, 0xfd, 0x53, 0x91, 0xef, 0x8a, 0x84, 0x8b,
0x85, 0xec, 0xf0, 0x05, 0x84, 0xed, 0xf0, 0xa3, 0xaa, 0x84, 0xab, 0x85,
0x90, 0x94, 0x25, 0xd8, 0xd1, 0x78, 0x21, 0x79, 0x43, 0x90, 0x94, 0x26,
0xe8, 0xf0, 0x05, 0x84, 0xe9, 0xf0, 0x53, 0x91, 0xef, 0x15, 0x86, 0xd0,
0xd0, 0xd0, 0xe0, 0x32, 0x22, 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, 0x02, 0xfe, 0x05, 0x22, 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, 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, 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, 0x89, 0xde
};
unsigned int phy8747_ucode_bin_len = 16384;
#else
typedef int _phy8747_ucode_c_not_empty; /* Make ISO compilers happy. */
#endif
|
the_stack_data/60664.c | /*
** Copyright 2001, Travis Geiselbrecht. All rights reserved.
** Distributed under the terms of the NewOS License.
*/
#include <sys/types.h>
#include <string.h>
char *
strcpy(char *dest, char const *src)
{
char *tmp = dest;
while ((*dest++ = *src++) != '\0')
;
return tmp;
}
|
the_stack_data/47122.c | void f(int *b, int tmp)
{
}
|
the_stack_data/187642405.c | // General tests that as(1) invocations on AIX targets are sane. Note that we
// only test assembler functionalities in this suite.
// Check powerpc-ibm-aix7.1.0.0, 32-bit.
// RUN: %clang -no-canonical-prefixes %s -### -c -o %t.o 2>&1 \
// RUN: -target powerpc-ibm-aix7.1.0.0 \
// RUN: | FileCheck --check-prefix=CHECK-AS32 %s
// CHECK-AS32-NOT: warning:
// CHECK-AS32: {{.*}}clang{{(.exe)?}}" "-cc1" "-triple" "powerpc-ibm-aix7.1.0.0"
// CHECK-AS32: "{{.*}}as{{(.exe)?}}"
// CHECK-AS32: "-a32"
// CHECK-AS32: "-many"
// Check powerpc64-ibm-aix7.1.0.0, 64-bit.
// RUN: %clang -no-canonical-prefixes %s -### -c -o %t.o 2>&1 \
// RUN: -target powerpc64-ibm-aix7.1.0.0 \
// RUN: | FileCheck --check-prefix=CHECK-AS64 %s
// CHECK-AS64-NOT: warning:
// CHECK-AS64: {{.*}}clang{{(.exe)?}}" "-cc1" "-triple" "powerpc64-ibm-aix7.1.0.0"
// CHECK-AS64: "{{.*}}as{{(.exe)?}}"
// CHECK-AS64: "-a64"
// CHECK-AS64: "-many"
// Check powerpc-ibm-aix7.1.0.0, 32-bit. -Xassembler <arg> option.
// RUN: %clang -no-canonical-prefixes %s -### -c -o %t.o 2>&1 \
// RUN: -Xassembler -w \
// RUN: -target powerpc-ibm-aix7.1.0.0 \
// RUN: | FileCheck --check-prefix=CHECK-AS32-Xassembler %s
// CHECK-AS32-Xassembler-NOT: warning:
// CHECK-AS32-Xassembler: {{.*}}clang{{(.exe)?}}" "-cc1" "-triple" "powerpc-ibm-aix7.1.0.0"
// CHECK-AS32-Xassembler: "{{.*}}as{{(.exe)?}}"
// CHECK-AS32-Xassembler: "-a32"
// CHECK-AS32-Xassembler: "-many"
// CHECK-AS32-Xassembler: "-w"
// Check powerpc64-ibm-aix7.1.0.0, 64-bit. -Wa,<arg>,<arg> option.
// RUN: %clang -no-canonical-prefixes %s -### -c -o %t.o 2>&1 \
// RUN: -Wa,-v,-w \
// RUN: -target powerpc64-ibm-aix7.1.0.0 \
// RUN: | FileCheck --check-prefix=CHECK-AS64-Wa %s
// CHECK-AS64-Wa-NOT: warning:
// CHECK-AS64-Wa: {{.*}}clang{{(.exe)?}}" "-cc1" "-triple" "powerpc64-ibm-aix7.1.0.0"
// CHECK-AS64-Wa: "{{.*}}as{{(.exe)?}}"
// CHECK-AS64-Wa: "-a64"
// CHECK-AS64-Wa: "-many"
// CHECK-AS64-Wa: "-v"
// CHECK-AS64-Wa: "-w"
// Check powerpc-ibm-aix7.1.0.0, 32-bit. Multiple input files.
// RUN: %clang -no-canonical-prefixes -### -c \
// RUN: %S/Inputs/aix_ppc_tree/dummy0.s \
// RUN: %S/Inputs/aix_ppc_tree/dummy1.s \
// RUN: %S/Inputs/aix_ppc_tree/dummy2.s 2>&1 \
// RUN: -target powerpc-ibm-aix7.1.0.0 \
// RUN: | FileCheck --check-prefix=CHECK-AS32-MultiInput %s
// CHECK-AS32-MultiInput-NOT: warning:
// CHECK-AS32-MultiInput: "{{.*}}as{{(.exe)?}}"
// CHECK-AS32-MultiInput: "-a32"
// CHECK-AS32-MultiInput: "-many"
// CHECK-AS32-MultiInput: "{{.*}}as{{(.exe)?}}"
// CHECK-AS32-MultiInput: "-a32"
// CHECK-AS32-MultiInput: "-many"
// CHECK-AS32-MultiInput: "{{.*}}as{{(.exe)?}}"
// CHECK-AS32-MultiInput: "-a32"
// CHECK-AS32-MultiInput: "-many"
// Check not passing no-integrated-as flag by default.
// RUN: %clang -no-canonical-prefixes %s -### -c -o %t.o 2>&1 \
// RUN: -target powerpc64-ibm-aix7.1.0.0 \
// RUN: | FileCheck --check-prefix=CHECK-IAS --implicit-check-not=-no-integrated-as %s
// CHECK-IAS: InstalledDir
// CHECK-IAS: "-a64"
// Check passing no-integrated-as flag if specified by user.
// RUN: %clang -no-canonical-prefixes %s -### -c -o %t.o 2>&1 \
// RUN: -target powerpc64-ibm-aix7.1.0.0 -fno-integrated-as \
// RUN: | FileCheck --check-prefix=CHECK-NOIAS %s
// CHECK-NOIAS: InstalledDir
// CHECK-NOIAS: -no-integrated-as
// CHECK-NOIAS: "-a64"
|
the_stack_data/154830538.c | /*
* OpenBOR - http://www.LavaLit.com
* -----------------------------------------------------------------------
* All rights reserved, see LICENSE in OpenBOR root for details.
*
* Copyright (c) 2004 - 2011 OpenBOR Team
*/
#include <stdio.h>
#include <string.h>
#include <ctype.h>
char *stristr(const char *String, const char *Pattern)
{
char *pptr, *sptr, *start;
unsigned int slen, plen;
for(start = (char *)String, pptr = (char *)Pattern, slen = strlen(String), plen = strlen(Pattern); slen >= plen; start++, slen--)
{
/* find start of pattern in string */
while(toupper((int)*start) != toupper((int)*Pattern))
{
start++;
slen--;
/* if pattern longer than string */
if (slen < plen)
{
return(NULL);
}
}
sptr = start;
pptr = (char *)Pattern;
while(toupper((int)*sptr) == toupper((int)*pptr))
{
sptr++;
pptr++;
/* if end of pattern then pattern was found */
if('\0' == *pptr)
{
return (start);
}
}
}
return(NULL);
}
|
the_stack_data/151657.c | //***Modifies initial file to be a multiple of 128***//
#include <x86intrin.h>
#include <stdio.h>
#include <string.h>
#define LCS _lrotl
#define RCS _lrotr
#define u64 unsigned long long
#define R(x, y, k) (x=RCS(x, 8), x+=y, x^=k, y=LCS (y ,3) ,y^=x)
#define INV_R(x, y, k) (y^=x, y=RCS (y, 3), x^=k, x-=y, x=LCS(x, 8))
#define ENCRYPT 1
void Speck128ExpandKeyAndEncrypt (u64 pt[], u64 ct[], u64 K[])
{
u64 i, B=K [1], A=K[0];
ct [0] = pt[0];
ct [1] = pt[1];
for (i=0; i <32; i++)
{
R (ct [1], ct[0], A);
R (B, A, i);
}
}
void Speck128Encrypt (u64 pt[], u64 ct[], u64 k[])
{
u64 i;
ct[0] = pt [0];
ct[1] = pt[1];
for (i = 0; i <32; i++)
R (ct[1], ct[0], k[i]);
}
void Speck128Decrypt (u64 pt[], u64 ct[], u64 K[])
{
long long i;
for (i = 31; i >= 0; i--)
INV_R (ct [1], ct [0], K[i]);
}
static void speck_keyexpand (u64 K[])
{
u64 tmp [32], *p;
memcpy (tmp, K, sizeof tmp);
u64 i;
for (i = 0; i < (31) ;)
{
p = tmp + (1 + (i % (2 - 1)));
R (*p, tmp [0], i);
++i;
K[i] = tmp [0];
}
}
void fill_k (char *s, u64 k[])
{
int len = strlen(s);
int i;
u64 a=0;
u64 b=0;
for (i = 0; i < len/2; i++)
a += s[i];
for (; i<len; i++)
b += 2*s[i];
k[0] = a*b;
k[1] = b;
}
int main (int argc, char **argv)
{
if (argc < 3)
{
printf("Please format the command line arguments as such:\n");
printf("%s <file_to_read> {[encrypt] or [anything else]}\n", argv[0]);
printf("Where if you write encrypt you encrypt the file or anything else then you decrypt it\n");
exit(2);
}
u64 k[32];
char keyboard_buffer[100];
printf("Please introduce the key\n");
scanf("%100s", keyboard_buffer);
fill_k(keyboard_buffer, k);
printf("%llx %llx\n", k[0],k[1]);
FILE *fp = fopen (argv[1], "rb+");
if (!fp)
{
printf("Couldnt open file for reading\n");
exit(1);
}
FILE *fp2 = fopen (argv[2], "wb");
if (!fp2)
{
printf("Couldnt open file for writing\n");
exit(3);
}
u64 pt[2];
u64 ct[2];
fseek(fp, 0, SEEK_END);
long size = ftell(fp);
fseek(fp, 0, SEEK_SET);
speck_keyexpand (k);
fseek(fp, 0, SEEK_END);
while (size%128!=0)
{
char c = ' ';
size++;
fwrite(&c, 1, 1,fp);
}
fseek(fp, 0, SEEK_SET);
while(fread(pt, sizeof(pt), 1, fp))
{
ct[1] = 0x0;
ct[0] = 0x0;
if (!strcmp(argv[2], "encrypt"))
{
Speck128Encrypt (pt, ct, k);
fwrite(ct, sizeof(ct), 1, fp2);
}
else
{
Speck128Decrypt (pt, pt, k);
fwrite(pt, sizeof(pt), 1, fp2);
}
}
fclose(fp);
fclose(fp2);
return 0;
}
|
the_stack_data/215768699.c | // function declaration
int func();
int main()
{
// function call
int i = func();
}
// function definition
int func()
{
return 0;
} |
the_stack_data/76700552.c | #include <features.h>
#ifdef __UCLIBC_HAS_LFS__
#if defined _FILE_OFFSET_BITS && _FILE_OFFSET_BITS != 64
#undef _FILE_OFFSET_BITS
#define _FILE_OFFSET_BITS 64
#endif
#ifndef __USE_LARGEFILE64
# define __USE_LARGEFILE64 1
#endif
/* We absolutely do _NOT_ want interfaces silently
* renamed under us or very bad things will happen... */
#ifdef __USE_FILE_OFFSET64
# undef __USE_FILE_OFFSET64
#endif
#include <dirent.h>
#include <errno.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <dirent.h>
#include "dirstream.h"
struct dirent64 *readdir64(DIR * dir)
{
ssize_t bytes;
struct dirent64 *de;
if (!dir) {
__set_errno(EBADF);
return NULL;
}
#ifdef __UCLIBC_HAS_THREADS__
__pthread_mutex_lock(&(dir->dd_lock));
#endif
do {
if (dir->dd_size <= dir->dd_nextloc) {
/* read dir->dd_max bytes of directory entries. */
bytes = __getdents64(dir->dd_fd, dir->dd_buf, dir->dd_max);
if (bytes <= 0) {
de = NULL;
goto all_done;
}
dir->dd_size = bytes;
dir->dd_nextloc = 0;
}
de = (struct dirent64 *) (((char *) dir->dd_buf) + dir->dd_nextloc);
/* Am I right? H.J. */
dir->dd_nextloc += de->d_reclen;
/* We have to save the next offset here. */
dir->dd_nextoff = de->d_off;
/* Skip deleted files. */
} while (de->d_ino == 0);
all_done:
#ifdef __UCLIBC_HAS_THREADS__
__pthread_mutex_unlock(&(dir->dd_lock));
#endif
return de;
}
#endif /* __UCLIBC_HAS_LFS__ */
|
the_stack_data/215769511.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_iterative_factorial.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: cacharle <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2019/07/06 16:48:21 by cacharle #+# #+# */
/* Updated: 2019/07/08 17:22:07 by cacharle ### ########.fr */
/* */
/* ************************************************************************** */
int ft_iterative_factorial(int nb)
{
int acc;
if (nb < 0)
return (0);
if (nb == 0)
return (1);
acc = 1;
while (nb > 0)
acc *= nb--;
return (acc);
}
|
the_stack_data/196457.c | #include <stdio.h>
void printPattern (int);
void upperHalf (int);
void lowerHalf (int);
int main () {
int totalColumns, totalLines;
printf("How many columns to be printed? -- ");
fflush(stdout);
scanf("%d", &totalColumns);
totalLines = ((2 * totalColumns) - 1);
printf("\nYour pattern looks like this:\n");
printf("\n");
printPattern (totalLines);
printf("\n");
return 0;
}
void printPattern (int totalLines) {
int upperLines = ((totalLines + 1) / 2), lowerLines = (totalLines - upperLines);
upperHalf (upperLines);
lowerHalf (lowerLines);
}
void upperHalf (int total) {
for (int i = 1; i <= total; i++) {
for (int j = 1; j <= i; j++) {
((j == 1) || (j == i)) ? printf ("* ") : printf (" ");
}
printf("\n");
}
}
void lowerHalf (int total) {
for (int i = total; i >= 1; i--) {
for (int j = 1; j <= i; j++) {
((j == 1) || (j == i)) ? printf ("* ") : printf (" ");
}
printf("\n");
}
} |
the_stack_data/247018893.c | #include <stdbool.h>
#include <stdlib.h>
#include <stdio.h>
#include <dlfcn.h>
#define Log printf
double (*cosine)(double) = NULL;
void *handle = NULL;
int tryLoad() {
char *error;
// handle = dlopen ("/lib/i386-linux-gnu/libm.so.6", RTLD_LAZY);
const char *dlfn = "/lib/x86_64-linux-gnu/libm.so.6";
// const char *dlfn = NULL;
Log("loading dl=%s\n", dlfn);
handle = dlopen (dlfn, RTLD_LAZY);
if (!handle) {
fputs (dlerror(), stderr);
exit(1);
} else {
Log("load handle=%p\n", handle);
}
const char *symstr = "cos";
Log("loading symbol=%s\n", symstr);
cosine = dlsym(handle, symstr);
if ((error = dlerror()) != NULL) {
fputs(error, stderr);
fputs("\n", stderr);
// if load fail, still continue
// exit(1);
} else {
Log("load cos=%p\n", cosine);
}
}
int tryUnload() {
if (handle) {
dlclose(handle);
}
}
double consine_wrap(double x) {
return cosine(x);
}
int main()
{
tryLoad();
Log("run symbol\n");
printf("%f\n", consine_wrap(2.0));
tryUnload();
return 0;
}
|
the_stack_data/18887721.c | #include <assert.h>
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/inotify.h>
#include <unistd.h>
#include <fcntl.h>
#include <sys/syscall.h>
#include <linux/fs.h>
#define BUF_LEN (10 * (sizeof(struct inotify_event) + NAME_MAX + 1))
#define TMP_DIUS "/tmp/dius"
const char * FAKE_METADATA = "LIST:1\n"
"FILENAME:/etc/diusweb.cfg\n"
"CREATE:1\n"
"FILENAME0:fake.cfg\n"
"COMPRESS0:n\n"
"FILESIZE0:98\n";
int main() {
int inotify_fd;
int wd;
int metadata_fd;
int tmp_dius_fd;
size_t fake_metadata_len;
int r;
ssize_t num_read;
struct inotify_event * event;
char buf[BUF_LEN] __attribute__ ((aligned(8)));
char * p;
printf("Getting things setup...\n");
fake_metadata_len = strlen(FAKE_METADATA);
tmp_dius_fd = open(TMP_DIUS, O_DIRECTORY | O_RDONLY);
if (tmp_dius_fd == -1) {
printf("Could not open /tmp/dius fd\n");
}
inotify_fd = inotify_init();
wd = inotify_add_watch(inotify_fd, TMP_DIUS, IN_CREATE);
assert(wd != -1);
printf("Starting inotify loop to watch /tmp/dius...\n");
for (;;) {
num_read = read(inotify_fd, buf, BUF_LEN);
if (num_read == -1) {
printf("inotify read failed\n");
return 1;
}
else if (num_read == 0) {
printf("read() with inotify fd returned 0\n");
return 1;
}
// Assume the first created file is the one we want.
event = (struct inotify_event *)buf;
break;
}
printf("dius tmp file: %s\n", event->name);
// race to overwrite the metadata file to one not containing WEB.
metadata_fd = openat(tmp_dius_fd, event->name, O_WRONLY | O_TRUNC);
if (metadata_fd == -1) {
printf("Failed to open dius tmp file for writing\n");
return 1;
}
write(metadata_fd, FAKE_METADATA, fake_metadata_len);
close(metadata_fd);
return 0;
} |
the_stack_data/54825865.c | /**
***********************************************************************************************************************
* Copyright (c) 2020, China Mobile Communications Group Co.,Ltd.
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on
* an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the
* specific language governing permissions and limitations under the License.
*
* @file dev_iwdg.c
*
* @brief This file implements iwdg driver for cm32
*
* @revision
* Date Author Notes
* 2020-02-20 OneOS Team First Version
***********************************************************************************************************************
*/
#ifdef BSP_USING_IWDG
int iwdg_instance = 0;
OS_HAL_DEVICE_DEFINE("IWDG_HandleTypeDef", "iwdg", iwdg_instance);
#endif
|
the_stack_data/89200272.c | /* Test program for byte registers.
Copyright 2010-2020 Free Software Foundation, Inc.
This file is part of GDB.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
int data[] = {
0x14131211,
0x24232221,
0x34333231,
0x44434241,
};
int
main (int argc, char **argv)
{
register int eax asm ("eax");
register int ebx asm ("ebx");
register int ecx asm ("ecx");
register int edx asm ("edx");
asm ("mov 0(%0), %%eax\n\t"
"mov 4(%0), %%ebx\n\t"
"mov 8(%0), %%ecx\n\t"
"mov 12(%0), %%edx\n\t"
: /* no output operands */
: "r" (data)
: "eax", "ebx", "ecx", "edx");
asm ("nop" /* first breakpoint here */
/* i386-{byte,word}.exp write eax-edx here.
Tell gcc/clang they're live. */
: "=r" (eax), "=r" (ebx), "=r" (ecx), "=r" (edx)
: /* no inputs */);
asm ("mov %%eax, 0(%0)\n\t"
"mov %%ebx, 4(%0)\n\t"
"mov %%ecx, 8(%0)\n\t"
"mov %%edx, 12(%0)\n\t"
: /* no output operands */
: "r" (data),
/* Mark these as inputs so that gcc/clang won't try to use them as
a temp to build %0. */
"r" (eax), "r" (ebx), "r" (ecx), "r" (edx));
puts ("Bye!"); /* second breakpoint here */
return 0;
}
|
the_stack_data/34513304.c | #include <stdio.h>
int main()
{
int n,m;
printf("Enter the number of rows");
scanf("%d",&n);
m=n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m-1;j++)
{
printf(" ");
}
for(int k=1;k<=2*i-1;k++)
{
printf("*");
}
m--;
printf("\n");
}
return 0;
}
|
the_stack_data/15039.c | #include <assert.h>
#include <stdio.h>
#include <time.h>
long long get_time_ms() {
struct timespec now;
clock_gettime(CLOCK_MONOTONIC, &now);
return (now.tv_sec * 1000) + (now.tv_nsec / 1000 / 1000);
}
int main(void) {
// Sleep for 10ms relative to current time (i.e. without TIMER_ABSTIME).
struct timespec sleep_for;
sleep_for.tv_sec = 0;
sleep_for.tv_nsec = 10 * 1000 * 1000;
long long before = get_time_ms();
printf("before: %lli\n", before);
clock_nanosleep(CLOCK_MONOTONIC, 0, &sleep_for, NULL);
long long after = get_time_ms();
printf("after: %lli\n", after);
// Check we slept at least 10ms
assert(after > before);
assert(after - before >= 10);
assert(after - before < 10000);
before = get_time_ms();
printf("before: %lli\n", before);
struct timespec deadline;
clock_gettime(CLOCK_MONOTONIC, &deadline);
deadline.tv_nsec += 20 * 1000 * 1000;
deadline.tv_sec += (deadline.tv_nsec / (1000 * 1000 * 1000));
deadline.tv_nsec = deadline.tv_nsec % (1000 * 1000 * 1000);
clock_nanosleep(CLOCK_MONOTONIC, TIMER_ABSTIME, &deadline, NULL);
after = get_time_ms();
printf("after: %lli\n", after);
// Check we slept at least 20ms
assert(after > before);
assert(after - before >= 20);
assert(after - before < 10000);
return 0;
}
|
the_stack_data/272361.c | // Copyright (c) 2020, devgo.club
// All rights reserved.
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <errno.h>
#include <signal.h>
#include <stdio.h>
void handle_signal(int signo)
{
printf("[%d] receive signal: signo = %d\n", getpid(), signo);
sleep(10);
}
int main(int argc, char const *argv[])
{
if (signal(SIGINT, &handle_signal) != NULL)
{
fprintf(stderr, "[%d] signal failed: %s, signo = %d\n", getpid(), strerror(errno), SIGINT);
return errno;
}
if (signal(SIGTSTP, &handle_signal) != NULL)
{
fprintf(stderr, "[%d] signal failed: %s, signo = %d\n", getpid(), strerror(errno), SIGTERM);
return errno;
}
for (int i = 0; i < 1 << 10; i++)
{
printf("[%d] i = %d\n", getpid(), i);
sleep(1);
}
return EXIT_SUCCESS;
} |
the_stack_data/70450812.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
struct initrd_header
{
uint8_t magic; // The magic number is there to check for consistency.
int8_t name[64];
uint32_t offset; // Offset in the initrd the file starts.
uint32_t length; // Length of the file.
};
int main(char argc, char **argv)
{
int nheaders = (argc - 1) / 2;
struct initrd_header headers[64];
printf("size of header: %d\n", sizeof(struct initrd_header));
unsigned int off = sizeof(struct initrd_header) * 64 + sizeof(int);
int i;
for (i = 0; i < nheaders; i++)
{
printf("writing file %s->%s at 0x%x\n", argv[i * 2 + 1], argv[i * 2 + 2], off);
strcpy(headers[i].name, argv[i * 2 + 2]);
headers[i].offset = off;
FILE *stream = fopen(argv[i * 2 + 1], "r");
if (stream == 0)
{
printf("Error: file not found: %s\n", argv[i * 2 + 1]);
return 1;
}
fseek(stream, 0, SEEK_END);
headers[i].length = ftell(stream);
off += headers[i].length;
fclose(stream);
headers[i].magic = 0xBF;
}
FILE *wstream = fopen("./initrd.img", "w");
unsigned char *data = (unsigned char *)malloc(off);
fwrite(&nheaders, sizeof(int), 1, wstream);
fwrite(headers, sizeof(struct initrd_header), 64, wstream);
for (i = 0; i < nheaders; i++)
{
FILE *stream = fopen(argv[i * 2 + 1], "r");
unsigned char *buf = (unsigned char *)malloc(headers[i].length);
fread(buf, 1, headers[i].length, stream);
fwrite(buf, 1, headers[i].length, wstream);
fclose(stream);
free(buf);
}
fclose(wstream);
free(data);
return 0;
}
|
the_stack_data/1182097.c | /*
!!DESCRIPTION!!
!!ORIGIN!! testsuite
!!LICENCE!! Public Domain
!!AUTHOR!! Johan Kotlinski
*/
#include <stdio.h>
/*
...gives "test.c(2): Error: Variable 'foo' has unknown size" using -Cl.
Is it really unknown?
cc65 V2.13.0, SVN version: 4384
*/
int main() {
char foo[] = { 0 };
printf("it works :)\n");
return 0;
}
|
the_stack_data/192331066.c | #include <stdio.h>
main()
{
float a,b,c;
printf("Enter the base of the triangle: ");
scanf("%f",&a);
printf("Enter the height of the triangle: ");
scanf("%f",&b);
c=a*b/2;
printf("Area of the triangle is %0.2f\n",c);
}
|
the_stack_data/162643382.c | /*********************************************************
* Copyright (C) 2008 VMware, Inc. All rights reserved.
*
* This program 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 version 2.1 and no later version.
*
* This program 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 Lesser GNU General Public
* License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
*********************************************************/
#include <string.h>
/*
*----------------------------------------------------------------------------
*
* strlcpy --
*
* XXX: Copied from vmblock/linux/module.c. Share them.
*
* Copies at most count - 1 bytes from src to dest, and ensures dest is NUL
* terminated.
*
* Results:
* Length of src. If src >= count, src was truncated in copy.
*
* Side effects:
* None.
*
*----------------------------------------------------------------------------
*/
size_t
strlcpy(char *dest, // OUT: destination to copy string to
const char *src, // IN : source to copy string from
size_t count) // IN : size of destination buffer
{
size_t ret;
size_t len;
ret = strlen(src);
len = ret >= count ? count - 1 : ret;
memcpy(dest, src, len);
dest[len] = '\0';
return ret;
}
|
the_stack_data/92326068.c | #include <sys/types.h>
#include <unistd.h>
int main()
{
char buf[20];
size_t nbytes;
ssize_t bytes_read;
int fd;
nbytes = sizeof(buf);
bytes_read = read(fd, buf, nbytes);
return 0;
}
|
the_stack_data/125382.c | // MergeSort com strings
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void troca(char **a, char **b) {
char *t = *a;
*a = *b;
*b = t;
}
void intercala(char *l[],int ini, int fim, int meio) {
char *aux[fim-ini+1], p_aux = 0;
int ini1 = ini, ini2 = meio + 1;
while( (ini1 <= meio) && (ini2 <= fim) ) {
if (strcmp(l[ini1], l[ini2])<=0)
troca(&aux[p_aux], &l[ini1++]);
else
troca(&aux[p_aux], &l[ini2++]);
p_aux++;
}
for (int i = ini1 ; i <= meio ; i++)
troca(&aux[p_aux++], &l[i]);
for (int i = ini2 ; i <= fim ; i++)
troca(&aux[p_aux++], &l[i]);
for (int i = ini, j = 0 ; i <= fim ; i++,j++)
troca(&l[i], &aux[j]);
}
void mergeSort(char *l[], int ini, int fim) {
if (ini < fim) {
int meio = (ini + fim) / 2;
mergeSort(l,ini,meio);
mergeSort(l,meio+1,fim);
intercala(l,ini,fim,meio);
}
}
int main(void) {
char *l[] = {"vaso","gato","planta","cachorro","mesa","cadeira"};
mergeSort(l, 0, 5);
printf("\n");
for (int i = 0 ; i <= 5 ; i++)
printf("%s\n",l[i]);
return 0;
} |
the_stack_data/51700736.c | #include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <unistd.h>
#include <string.h>
// Global parameters
struct setup {
int excel ;
int digit ;
int base ;
int ratio ;
int title ;
int start ;
int end ;
int nDigits ;
int ** sums ;
int ** digits ;
} SU = {
.excel = 0,
.digit = 9,
.base = 10,
.title = 0,
.ratio = 0,
.start=321,
.end=321,
};
void Add( void ) {
// Add incr in sum
int d ;
for ( d=1 ; d<SU.base ; ++d ) {
int i;
int carry = 0;
for (i=0;i<SU.nDigits;++i) {
SU.sums[d][i] += SU.digits[d][i] + carry ;
if ( SU.sums[d][i] >= SU.base ) {
SU.sums[d][i] -= SU.base ;
carry = 1 ;
} else {
carry = 0 ;
}
}
}
}
void Zero( int* num ) {
// zero the number
int i ;
for ( i=0 ; i < SU.nDigits ; ++i ) {
num[i] = 0 ;
}
}
void Digit( int place ) {
// Put digit in next place
int d ;
for ( d=1 ; d<SU.base ; ++d ) {
SU.digits[d][place] = d ;
}
}
long int SumDigits( int digit ) {
// Add the digits
int i ;
long int sum = 0 ;
for ( i=0 ; i < SU.nDigits ; ++i ) {
sum += SU.sums[digit][i] ;
}
return sum ;
}
void Repeat( void ) {
int d ;
for ( d=1 ; d<SU.base ; ++d ) {
int zeroes ;
int repeats = 0 ;
int i ;
int j ;
int * Sum = SU.sums[d] ;
int sod = 0 ;
for ( zeroes=SU.nDigits-1 ; zeroes>1 ; --zeroes ) {
if ( Sum[zeroes] != 0 ) {
break ;
}
}
if ( zeroes < SU.base*3 ) {
printf("Sums too small for this base\n") ;
break ;
}
j = zeroes - SU.base + 1 ;
while ( j > SU.base - 1 ) {
for ( i = 0 ; i < SU.base - 1 ; ++i ) {
if ( Sum[zeroes-i] != Sum[j] ) {
j=0 ;
break ;
}
--j ;
}
++ repeats ;
}
printf( "Digit=%d, Base=%d, Repeats=%d\t\t" , d, SU.base, repeats ) ;
for ( i=0 ; i<SU.base-1 ; ++i ) {
sod += Sum[zeroes-i] ;
printf("%d ",Sum[zeroes-i]) ;
}
printf("\t\tAvg=%g\n",(0.0+sod)/(SU.base-1.0)) ;
}
printf("\n");
}
void Makespace( void ) {
int d ;
for ( d=1 ; d<SU.base ; ++d ) {
SU.digits[d] = calloc( SU.nDigits , sizeof(int) ) ;
if ( SU.digits[d] == NULL ) {
fprintf(stderr,"Memory exhausted\n");
exit(1) ;
}
Zero( SU.digits[d] ) ;
SU.sums[d] = calloc( SU.nDigits , sizeof(int) ) ;
if ( SU.sums[d] == NULL ) {
fprintf(stderr,"Memory exhausted\n");
exit(1) ;
}
Zero( SU.sums[d] ) ;
}
}
void Freespace( void ) {
int d ;
for ( d=1 ; d<SU.base ; ++d ) {
free(SU.sums[d]) ;
free(SU.digits[d]) ;
}
}
void SumOfDigits( void ) {
int place;
SU.nDigits = SU.end + 2 ;
Makespace() ;
for ( place = 1 ; place <= SU.end ; ++place ) {
Digit(place);
Add() ;
}
Repeat() ;
Freespace() ;
}
void Limits( char * str ) {
int start ;
int end ;
switch ( sscanf( str, "%d-%d", &start, &end ) ) {
case 1:
if ( start < 0 ) {
fprintf(stderr, "Invalid value %d\nNote that range cannot have spaces e.g. 10-100\n",start);
exit(1);
}
SU.start = start ;
SU.end = start ;
SumOfDigits() ;
break ;
case 2:
if ( start < 0 ) {
fprintf(stderr, "Invalid value %d\n",start);
exit(1);
} else if ( start > end ) {
fprintf(stderr,"Invalid range start %d end %d\n",start,end);
exit(1) ;
}
SU.start = start ;
SU.end = end ;
SumOfDigits() ;
break ;
default:
break ;
}
}
void help( void ) {
printf("Add Digits -- by Paul H Alfille based on concept by Daniel Saddawi-Konefka\n");
printf("\tShows sum of digits for a sum of numbers:\n");
printf("\t9+99+999+9999+99999+...\n");
printf("-h\tthis help message\n");
printf("-x\tExcel (i.e. csv) format\n");
printf("-r\tratios of SOD/length\n");
printf("-b10\tnumber base to use -- default 10\n");
printf("-t\tAdd column titles\n");
printf("321\tMaximum length of repeating digits string\n");
printf("1-321\tShow a range of maximum digit strings\n");
}
int main( int argc, char **argv ) {
int c;
int opterr = 0 ;
while ( (c = getopt( argc, argv, "hrb::tx" )) != -1 ) {
switch ( c ) {
case 'h':
help() ;
exit(0);
break ;
case 'r':
SU.ratio = 1 ;
break ;
case 't':
SU.title = 1;
break ;
case 'x':
SU.excel = 1 ;
break ;
case 'b':
SU.base = (int)strtol(optarg,NULL,0) ;
if ( SU.base < 1 ) {
fprintf( stderr, "bad base\n" ) ;
exit(1) ;
}
break ;
}
}
// allocate array pointers (not actual arrays)
SU.sums = calloc( SU.base, sizeof(int*) ) ;
SU.digits = calloc( SU.base, sizeof(int*) ) ;
if ( SU.sums == NULL || SU.digits == NULL ) {
fprintf(stderr, "Memory exhausted\n");
exit(1);
}
if ( SU.title ) {
if ( SU.excel ) {
int d ;
printf("length");
for (d=0 ; d<SU.base ; ++d) {
printf(",SOD_%d",d);
}
printf("\n");
} else {
printf("Repeating digit strings base %d and sum of digits of sum\n",SU.base);
}
}
if ( optind == argc ) {
SumOfDigits() ;
} else {
int index ;
for ( index = optind ; index < argc ; ++index ) {
char * token ;
char * str = argv[index] ;
while( (token=strsep(&str,",")) != NULL ) {
Limits(token) ;
}
}
}
free( SU.digits);
free( SU.sums) ;
return 0 ;
}
|
the_stack_data/64199677.c | /**
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
#include <sys/mman.h>
#include <unistd.h>
#include <errno.h>
extern int getpagesize(void);
static void *cont;
static int sys_pagesize;
static int cont_left;
void *
_sbrk(int incr)
{
void *result;
if (!sys_pagesize) {
sys_pagesize = getpagesize();
}
if (cont && incr <= cont_left) {
result = cont;
cont_left -= incr;
if (cont_left) {
cont = (char *)cont + incr;
} else {
cont = NULL;
}
return result;
}
result = mmap(NULL, incr, PROT_READ | PROT_WRITE, MAP_ANON | MAP_SHARED,
-1, 0);
if (result) {
cont_left = sys_pagesize - (incr % sys_pagesize);
if (cont_left) {
cont = (char *)result + incr;
} else {
cont = NULL;
}
}
return result;
}
|
the_stack_data/1212274.c | int i = 1;
main()
{
printf("%d\n",i);
foo();
}
|
the_stack_data/50136819.c | /* memcpy example */
#include <stdio.h>
#include <string.h>
struct {
char name[40];
int age;
} person, person_copy;
int main ()
{
char myname[] = "Pierre";
/* using memcpy to copy string: */
memcpy ( person.name, myname, strlen(myname)+1 );
person.age = 46;
/* using memcpy to copy structure: */
memcpy ( &person_copy, &person, sizeof(person) );
assert(person_copy.age == 46);
assert(!strcmp(myname, person.name));
return 0;
}
|
the_stack_data/90763514.c | extern void abort(void);
unsigned long c = 0x8000000000000000;
double t = 0x8000000000000000;
int main() {
if (c - t < 0)
abort();
return 0;
}
|
the_stack_data/93887727.c | #include <inttypes.h>
imaxdiv_t imaxdiv(intmax_t num, intmax_t den)
{
return (imaxdiv_t){ num/den, num%den };
}
|
the_stack_data/154830473.c | /*
* Copyright (C) 2015-2017 Alibaba Group Holding Limited
*/
#if defined(CONFIG_CLI) && defined(CONFIG_TCPIP)
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#include <unistd.h>
#include "lwipopts.h"
#if LWIP_IPV6 && LWIP_RAW /* don't build if not configured for use in lwipopts.h */
#include "lwip/mem.h"
#include "lwip/raw.h"
#include "lwip/icmp.h"
#include "lwip/icmp6.h"
#include "lwip/prot/prot_icmp6.h"
#include "lwip/netif.h"
#include "lwip/sys.h"
#include "lwip/timeouts.h"
#include "lwip/inet_chksum.h"
#include "lwip/netdb.h"
#ifndef PING_USE_SOCKETS
#define PING_USE_SOCKETS LWIP_SOCKET
#include "lwip/sockets.h"
#include "arpa/inet.h"
#endif
/**
* PING_DEBUG: Enable debugging for PING.
*/
#ifndef PING_DEBUG
#define PING_DEBUG LWIP_DBG_ON
#endif
/** ping target - should be an "ip4_addr_t" */
#ifndef PING_TARGET
#define PING_TARGET (netif_default ? *netif_ip4_gw(netif_default) : (*IP4_ADDR_ANY))
#endif
/** ping receive timeout - in milliseconds */
#ifndef PING_RCV_TIMEO
#define PING_RCV_TIMEO 4000
#endif
/** ping delay - in milliseconds */
#ifndef PING_DELAY
#define PING_DELAY 1000
#endif
/** ping identifier - must fit on a u16_t */
#ifndef PING_ID
#define PING_ID 0xAFAF
#endif
/** ping additional data size to include in the packet */
#ifndef PING_DATA_SIZE
#define PING_DATA_SIZE 32
#endif
/** ping result action - no default action */
#ifndef PING_RESULT
#define PING_RESULT(ping_ok)
#endif
#define PING_REPEAT_CNT 10
/* ping variables */
static u16_t ping_seq_num;
static uint64_t ping_time;
#if !PING_USE_SOCKETS
static struct raw_pcb *ping_pcb;
#endif /* PING_USE_SOCKETS */
extern char *host_ip;
/* Prepare a echo ICMP request */
static void ping6_prepare_echo(struct icmp6_echo_hdr *iecho, u16_t len, ip6_addr_t *saddr , ip6_addr_t *daddr)
{
size_t i;
struct pbuf r;
size_t data_len = len - sizeof(struct icmp6_echo_hdr);
ICMPH_TYPE_SET(iecho, ICMP6_TYPE_EREQ);
ICMPH_CODE_SET(iecho, 0);
iecho->chksum = 0;
iecho->id = PING_ID;
iecho->seqno = htons(++ping_seq_num);
/* fill the additional data buffer with some data */
for (i = 0; i < data_len; i++) {
((char *)iecho)[sizeof(struct icmp6_echo_hdr) + i] = (char)i;
}
memset((void *)&r, 0, sizeof(r));
r.payload = iecho;
r.len = len;
r.tot_len = len;
iecho->chksum = ip6_chksum_pseudo(&r, IP6_NEXTH_ICMP6, r.tot_len, saddr, daddr);
}
/* Ping using the socket ip */
static err_t ping_send(int s, ip_addr_t *addr)
{
int err;
struct sockaddr_storage to;
struct netif *pnetif;
struct icmp6_echo_hdr *iecho;
ip6_addr_t * saddr;
size_t ping_size = sizeof(struct icmp6_echo_hdr) + PING_DATA_SIZE;
LWIP_ASSERT("ping_size is too big", ping_size <= 0xffff);
pnetif = netif_find("en0");
if (pnetif == NULL) {
printf("\t net work has not inited \r\n");
return -1;
}
iecho = (struct icmp6_echo_hdr *)mem_malloc((mem_size_t)ping_size);
if (!iecho) {
return ERR_MEM;
}
if (ip6_addr_islinklocal(ip_2_ip6(addr))) {
saddr = (ip6_addr_t *)netif_ip6_addr(pnetif, 0);
} else {
saddr = (ip6_addr_t *)netif_ip6_addr(pnetif, 1);
}
ping6_prepare_echo(iecho, (u16_t)ping_size, saddr, ip_2_ip6(addr));
if (IP_IS_V6(addr)) {
struct sockaddr_in6 *to6 = (struct sockaddr_in6 *)&to;
to6->sin6_len = sizeof(to6);
to6->sin6_family = AF_INET6;
inet6_addr_from_ip6addr(&to6->sin6_addr, ip_2_ip6(addr));
}
err = sendto(s, iecho, ping_size, 0, (struct sockaddr *)&to, sizeof(to));
if (err < 0) {
printf(" sendto failed, %d \r\n", err);
mem_free(iecho);
return err;
}
mem_free(iecho);
return (err ? ERR_OK : ERR_VAL);
}
static void ping_recv(int s)
{
char buf[94];
int len;
struct sockaddr_storage from;
int fromlen = sizeof(from);
ip_addr_t fromaddr;
while ((len = recvfrom(s, buf, sizeof(buf), 0, (struct sockaddr *)&from, (socklen_t *)&fromlen)) > 0) {
if (len >= (int)(sizeof(struct ip6_hdr) + sizeof(struct icmp6_echo_hdr))) {
memset(&fromaddr, 0, sizeof(fromaddr));
if (from.ss_family == AF_INET6) {
struct sockaddr_in6 *from6 = (struct sockaddr_in6 *)&from;
inet6_addr_to_ip6addr(ip_2_ip6(&fromaddr), &from6->sin6_addr);
IP_SET_TYPE(&fromaddr, IPADDR_TYPE_V6);
}
/* todo: support ICMP6 echo */
if (IP_IS_V6_VAL(fromaddr)) {
struct ip6_hdr *iphdr;
struct icmp6_echo_hdr *iecho;
iphdr = (struct ip6_hdr *)buf;
iecho = (struct icmp6_echo_hdr *)(buf + IP6H_PLEN(iphdr));
/* printf("\t ping: len: %d, id:%x, sepo:%x\r\n",len, iecho->id,iecho->seqno ); */
if (iecho->type != ICMP6_TYPE_EREP) {
continue;
}
if ((iecho->id == PING_ID/*0x100*/) && (iecho->seqno == lwip_htons(ping_seq_num))) {
/* do some ping result processing */
printf("\t from %s: icmp_seq=%d time=%d ms\r\n", ipaddr_ntoa(&fromaddr), ping_seq_num, (aos_now_ms() - ping_time));
return;
} else {
printf("\t ping: drop, len: %d\r\n", len);
}
}
}
fromlen = sizeof(from);
}
if (len < 0) {
printf("\t from %s: icmp_seq=%d Destination Host Unreachable \r\n", host_ip, ping_seq_num);
}
/* do some ping result processing */
PING_RESULT(0);
}
uint32_t cmd_ping6_func(ip_addr_t *ping_target)
{
int s;
int ret;
int cnt = PING_REPEAT_CNT;
ping_seq_num = 0;
#if LWIP_SO_SNDRCVTIMEO_NONSTANDARD
int timeout = PING_RCV_TIMEO;
#else
struct timeval timeout;
timeout.tv_sec = PING_RCV_TIMEO / 1000;
timeout.tv_usec = (PING_RCV_TIMEO % 1000) * 1000;
#endif
if (IP_IS_V4(ping_target) || ip6_addr_isipv6mappedipv4(ip_2_ip6(ping_target))) {
s = socket(AF_INET6, SOCK_RAW, IP_PROTO_ICMP);
} else {
s = socket(AF_INET6, SOCK_RAW, IP6_NEXTH_ICMP6);
}
ret = setsockopt(s, SOL_SOCKET, SO_RCVTIMEO, &timeout, sizeof(timeout));
LWIP_ASSERT("setting receive timeout failed", ret == 0);
while (cnt--) {
if (ping_send(s, ping_target) == ERR_OK) {
/* printf("\t fd %d, ping : %s \r\n\r\n", s, inet6_ntoa(ping_target)); */
ping_time = aos_now_ms();
ping_recv(s);
} else {
printf("\t ping: send to %s error\r\n", ipaddr_ntoa(ping_target));
}
aos_msleep(PING_DELAY);
}
close(s);
return 0;
}
#endif
#endif /* defined(CONFIG_CLI) && defined(CONFIG_TCPIP) */
|
the_stack_data/47069.c | #define LIMIT 2
int a[LIMIT];
void pass_through_array ()
{
for(unsigned i=0; i<LIMIT; i++)
a[i] = a[i];
}
void main (void) {
a[0] = 0;
a[1] = 0;
pass_through_array();
assert(a[0] == 0 && a[1] == 0);
}
|
the_stack_data/126703704.c | /* Solution for Day 3 of the 2016 Advent of Code */
/* Solution by Andrew Fugier */
#include <stdio.h>
#include <stdlib.h>
int main()
{
FILE *fp = fopen("input", "r");
int a1, a2, a3, possible = 0;
if(fp == NULL) {
printf("could not open input file\n");
return -1;
}
while (fscanf(fp, "%i %i %i", &a1, &a2, &a3) != EOF) {
if(a1 + a2 > a3 && a2 + a3 > a1 && a3 + a1 > a2){
possible++;
}
}
printf("Possible: %i\n", possible);
fclose(fp); // fp should be valid as we return -1 above we fail to open
return(0);
}
|
the_stack_data/80269.c | /*
UCF EGN 3211
FALL 2018
Prof. Sundar Sinnappan
*** Homework 8B ***
by Allan Aquino Vieira
*/
#include <stdio.h>
#include<stdlib.h>
//FUNCTIONS PROTOTYPES
void displayMatrix(int equations, int variables, float matrix[equations][variables]);
void solution(int equations, int variables, float matrix[equations][variables], int var);
void elementInputMatrix(int equations, int variables, float matrix[equations][variables], char varLtr);
int main (void)
{
//main VARIABLE DECLARATION
int equations=3, variables=3, var=0;
char varLtr = 'x';
printf("Enter number of equatons to solve: ");
scanf("%d", &equations);
fflush(stdin);
printf("Enter number of variables in equations: ");
scanf("%d", &variables);
fflush(stdin);
printf("Enter letter for first variable in equations: ");
scanf("%c", &varLtr);
fflush(stdin);
var=variables;
++variables;//Accounting for equations solution
//main VARIABLE DECLARATION
float matrix[equations][variables];
float *matrixPtr = matrix;
matrix[0][0]=2.0; matrix[0][1]=4.0; matrix[0][2]=6.0; matrix[0][3]=22.0;
matrix[1][0]=3.0; matrix[1][1]=8.0; matrix[1][2]=5.0; matrix[1][3]=27.0;
matrix[2][0]=-1.0; matrix[2][1]=1.0; matrix[2][2]=2.0; matrix[2][3]=02.0;
elementInputMatrix(equations, variables, matrix, varLtr);
displayMatrix(equations, variables, matrix);
solution(equations, variables, matrix, var);
return 0;
}
void elementInputMatrix(int equations, int variables, float matrix[equations][variables], char varLtr)
{
//displayMatrix VARIABLE DEFINITIONS
int maker=(variables-2);
printf("\nEnter the coefficients for the linear equation\n"
"Ax + By + Cz + ... = S\n");
for(int i=0, j=0; i<equations; ++i,j=0)
{
for(;j<variables;++j)
{
if(j<(maker+1))
{
printf("\nCoeficient for %c on Equation %d: ", varLtr+j, i+1);
}
if(j==maker+1)
{
printf("\nSolution for Equation %d: ", i+1);
}
scanf("%f", &matrix[i][j]);
fflush(stdin);
}
printf("\n");
}
}
void displayMatrix(int equations, int variables, float matrix[equations][variables])
{
//displayMatrix VARIABLE DEFINITIONS
int maker = (variables-2);
for(int i=0, j=0; i<equations; ++i,j=0)
{
for(;j<variables; ++j)
{
printf("%7.3f\t",matrix[i][j]);
if(j==maker)
{
printf("|\t");
}
}
printf("\n");
}
}
/*****************************************************************
solution() function was taken and altered from:
www.sanfoundry.com/c-program-implement-gauss-jordan-elimination/
*****************************************************************/
void solution(int equations, int variables, float a[equations][variables], int var)
{
//solution VARIABLE DEFINITIONS
int k, i, j, c = (int)'x';
float l;
//displayMatrix(equations, variables, a);
for (k=0;k<var;++k )
{
for (i=0;i<=var;++i )
{
l = a[i][k];
for (j=0;j<=var;++j)
{
if (i!=k)
a[i][j]=(a[k][k]*a[i][j])-(l*a[k][j]);
}
}
}
printf( "\nThe Solutions:\n" );
for (i=0;i<var;++i)
{
printf( "\n%c = %7.3f\n", c + i, a[i][var] / a[i][i] );
}
}
|
the_stack_data/845448.c |
#include <stdlib.h>
#include <stdio.h>
#include <errno.h>
#include <limits.h>
#include <stdint.h>
#include <assert.h>
#define ASSERT assert
#define NOT_REACHED() assert(0)
#define NOT_IMPLEMENTED() assert(0)
#define DPRINT printf
#define BIT(_v, _b) (((_v) >> (_b)) & 0x1)
#define BITS(_v, _l, _h) (((uint32_t)(_v) << (31-(_h))) >> ((_l)+31-(_h)))
/*********************************************************************
*
* ia32DecodeTable
*
* The decode table is provided to save you typing. The actual table is
* defined at the bottom of the file due to its size. Each opcode has an
* entry in the table. 2 byte opcodes are encoded as 0x1XX. For example the
* opcode 0x0f 0x83 would be encoded as 0x183. See Figure 2.12b in the text
* for further explaination.
*
*********************************************************************/
#define IA32_DATA 0 // default
#define IA32_notimpl 1
#define IA32_PREFIX 2
#define IA32_2BYTE 3
#define IA32_CFLOW 4
#define IA32_DECODE_TYPE(_d) ((_d) & 0x000f)
/*
* The following defines add extra information on top of the decode type.
*/
#define IA32_MODRM 0x0010
#define IA32_IMM8 0x0020 // REL8 also
#define IA32_IMM32 0x0040 // REL32 also
#define IA32_RET 0x0100
#define IA32_JCC 0x0200
#define IA32_JMP 0x0400
#define IA32_CALL 0x0800
extern unsigned ia32DecodeTable[]; /* see below */
/*********************************************************************
*
* IA32Instr
*
* Decoded information about a single ia32 instruction.
*
*********************************************************************/
typedef struct {
uint16_t opcode;
uint8_t len;
unsigned modRM;
uint32_t imm;
} IA32Instr;
/*********************************************************************
*
* IA32Instr
*
* Program registers saved on a callout. These must be restored
* when we return to the program.
*
* pc - this is the return address of the callout
* retPC - this is only valid if the callout replaced a RET
* instruction. This will be the return PC the ret
* will jump to.
*
*********************************************************************/
typedef struct {
uint32_t eflags;
uint32_t edi;
uint32_t esi;
uint32_t ebp;
uint32_t esp;
uint32_t ebx;
uint32_t edx;
uint32_t ecx;
uint32_t eax;
void *pc;
void *retPC;
} IA32SaveRegs;
/* addresses of asm callout glue code */
extern void* jccCallout;
extern void* jmpCallout;
extern void* callCallout;
extern void* retCallout;
void *callTarget;
/*********************************************************************
*
* ia32Decode
*
* Decode an IA32 instruction.
*
*********************************************************************/
void
ia32Decode(uint8_t *ptr, IA32Instr *instr)
{
NOT_IMPLEMENTED();
}
/*********************************************************************
*
* callout handlers
*
* These get called by asm glue routines.
*
*********************************************************************/
void
handleCallCallout(IA32SaveRegs regs)
{
NOT_IMPLEMENTED();
}
void
handleRetCallout(IA32SaveRegs regs)
{
NOT_IMPLEMENTED();
}
/*********************************************************************
*
* StartProfiling, StopProfiling
*
* Profiling hooks. This is your place to inspect and modify the profiled
* function.
*
*********************************************************************/
void
StartProfiling(void *func)
{
/* inspect/modify func here */
*((uint8_t*)func) = 0xc3;
}
/*********************************************************************
*
* fib, main
*
* This is the user program to be profiled.
*
*********************************************************************/
int fib(int i)
{
if (i <= 1) {
return 1;
}
return fib(i-1) + fib(i-2);
}
int main(int argc, char *argv[])
{
int value;
char *end;
if (argc != 2) {
fprintf(stderr, "usage: %s <value>\n", argv[0]);
exit(1);
}
value = strtol(argv[1], &end, 10);
if (((errno == ERANGE)
&& ((value == LONG_MAX) || (value == LONG_MIN)))
|| ((errno != 0) && (value == 0))) {
perror("strtol");
exit(1);
}
if (end == argv[1]) {
fprintf(stderr, "error: %s is not an integer\n", argv[1]);
exit(1);
}
if (*end != '\0') {
fprintf(stderr, "error: junk at end of parameter: %s\n", end);
exit(1);
}
StartProfiling(fib);
value = fib(value);
printf("%d\n", value);
exit(0);
}
unsigned ia32DecodeTable[] = {
IA32_MODRM, IA32_MODRM, // 00
IA32_MODRM, IA32_MODRM,
IA32_IMM8, IA32_IMM32,
0, 0,
IA32_MODRM, IA32_MODRM,
IA32_MODRM, IA32_MODRM,
IA32_IMM8, IA32_IMM32,
0, IA32_2BYTE,
IA32_MODRM, IA32_MODRM, // 10
IA32_MODRM, IA32_MODRM,
IA32_IMM8, IA32_IMM32,
0, 0,
IA32_MODRM, IA32_MODRM,
IA32_MODRM, IA32_MODRM,
IA32_IMM8, IA32_IMM32,
0, 0,
IA32_MODRM, IA32_MODRM, // 20
IA32_MODRM, IA32_MODRM,
IA32_IMM8, IA32_IMM32,
IA32_PREFIX, 0,
IA32_MODRM, IA32_MODRM,
IA32_MODRM, IA32_MODRM,
IA32_IMM8, IA32_IMM32,
0, 0,
IA32_MODRM, IA32_MODRM, // 30
IA32_MODRM, IA32_MODRM,
IA32_IMM8, IA32_IMM32,
IA32_PREFIX, 0,
IA32_MODRM, IA32_MODRM,
IA32_MODRM, IA32_MODRM,
IA32_IMM8, IA32_IMM32,
0, 0,
0, 0, // 40
0, 0,
0, 0,
0, 0,
0, 0,
0, 0,
0, 0,
0, 0,
0, 0, // 50
0, 0,
0, 0,
0, 0,
0, 0,
0, 0,
0, 0,
0, 0,
0, 0, // 60
IA32_notimpl, IA32_notimpl,
IA32_PREFIX, IA32_PREFIX,
IA32_PREFIX, IA32_PREFIX,
IA32_IMM32, IA32_MODRM | IA32_IMM32,
IA32_IMM8, IA32_MODRM | IA32_IMM8,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_CFLOW | IA32_JCC | IA32_IMM8, IA32_CFLOW | IA32_JCC | IA32_IMM8, // 70
IA32_CFLOW | IA32_JCC | IA32_IMM8, IA32_CFLOW | IA32_JCC | IA32_IMM8,
IA32_CFLOW | IA32_JCC | IA32_IMM8, IA32_CFLOW | IA32_JCC | IA32_IMM8,
IA32_CFLOW | IA32_JCC | IA32_IMM8, IA32_CFLOW | IA32_JCC | IA32_IMM8,
IA32_CFLOW | IA32_JCC | IA32_IMM8, IA32_CFLOW | IA32_JCC | IA32_IMM8,
IA32_CFLOW | IA32_JCC | IA32_IMM8, IA32_CFLOW | IA32_JCC | IA32_IMM8,
IA32_CFLOW | IA32_JCC | IA32_IMM8, IA32_CFLOW | IA32_JCC | IA32_IMM8,
IA32_CFLOW | IA32_JCC | IA32_IMM8, IA32_CFLOW | IA32_JCC | IA32_IMM8,
IA32_MODRM | IA32_IMM8, IA32_MODRM | IA32_IMM32, // 80
IA32_MODRM | IA32_IMM8, IA32_MODRM | IA32_IMM8,
IA32_MODRM, IA32_MODRM,
IA32_MODRM, IA32_MODRM,
IA32_MODRM, IA32_MODRM,
IA32_MODRM, IA32_MODRM,
IA32_MODRM, IA32_MODRM,
IA32_MODRM, IA32_MODRM,
0, 0, // 90
0, 0,
0, 0,
0, 0,
0, 0,
0, 0,
0, 0,
0, 0,
IA32_notimpl, IA32_notimpl, // a0
IA32_notimpl, IA32_notimpl,
0, 0,
0, 0,
IA32_IMM8, IA32_IMM32,
0, 0,
0, 0,
0, 0,
IA32_IMM8, IA32_IMM8, // b0
IA32_IMM8, IA32_IMM8,
IA32_IMM8, IA32_IMM8,
IA32_IMM8, IA32_IMM8,
IA32_IMM32, IA32_IMM32,
IA32_IMM32, IA32_IMM32,
IA32_IMM32, IA32_IMM32,
IA32_IMM32, IA32_IMM32,
IA32_MODRM | IA32_IMM8, IA32_MODRM | IA32_IMM8, // c0
IA32_notimpl, IA32_CFLOW | IA32_RET,
IA32_notimpl, IA32_notimpl,
IA32_MODRM | IA32_IMM8, IA32_MODRM | IA32_IMM32,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // d0
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // e0
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_CFLOW | IA32_CALL | IA32_IMM32, IA32_notimpl,
IA32_notimpl, IA32_CFLOW | IA32_JMP | IA32_IMM8,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // f0
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // 100
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // 110
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // 120
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // 130
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // 140
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // 150
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // 160
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // 170
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_CFLOW | IA32_JCC | IA32_IMM32, IA32_CFLOW | IA32_JCC | IA32_IMM32,// 180
IA32_CFLOW | IA32_JCC | IA32_IMM32, IA32_CFLOW | IA32_JCC | IA32_IMM32,
IA32_CFLOW | IA32_JCC | IA32_IMM32, IA32_CFLOW | IA32_JCC | IA32_IMM32,
IA32_CFLOW | IA32_JCC | IA32_IMM32, IA32_CFLOW | IA32_JCC | IA32_IMM32,
IA32_CFLOW | IA32_JCC | IA32_IMM32, IA32_CFLOW | IA32_JCC | IA32_IMM32,
IA32_CFLOW | IA32_JCC | IA32_IMM32, IA32_CFLOW | IA32_JCC | IA32_IMM32,
IA32_CFLOW | IA32_JCC | IA32_IMM32, IA32_CFLOW | IA32_JCC | IA32_IMM32,
IA32_CFLOW | IA32_JCC | IA32_IMM32, IA32_CFLOW | IA32_JCC | IA32_IMM32,
IA32_notimpl, IA32_notimpl, // 190
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // 1a0
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // 1b0
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_MODRM, IA32_MODRM,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_MODRM, IA32_MODRM,
IA32_notimpl, IA32_notimpl, // 1c0
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // 1d0
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // 1e0
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl, // 1f0
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
IA32_notimpl, IA32_notimpl,
};
|
the_stack_data/243894411.c | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <ctype.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <pwd.h>
#include <grp.h>
#include <dirent.h>
#include <time.h>
#include <string.h>
#define MAX_LENGTH 1000
char buff[80];
char *cwd = NULL;//current working directory
char *para = NULL;//parameter
char *path = NULL;//this is absolute path
void show_help()
{
printf("this is usage");
}
void show_path()
{
printf("path: %s\n",path);
}
char* uid_to_name(uid_t uid)
{
struct passwd* getpwuid(),* pw_ptr;
static char numstr[10];
if((pw_ptr = getpwuid(uid)) == NULL)
{
sprintf(numstr,"%d",uid);
return numstr;
}
else
{
return pw_ptr->pw_name;
}
}
char* gid_to_name(gid_t gid)
{
struct group* getgrgid(),* grp_ptr;
static char numstr[10];
if(( grp_ptr = getgrgid(gid)) == NULL)
{
sprintf(numstr,"%d",gid);
return numstr;
}
else
{
return grp_ptr->gr_name;
}
}
void mode_to_letters(int mode, char str[])
{
strcpy(str, "----------");
if (S_ISDIR(mode))
{
str[0] = 'd';
}
if (S_ISCHR(mode))
{
str[0] = 'c';
}
if (S_ISBLK(mode))
{
str[0] = 'b';
}
if ((mode & S_IRUSR))
{
str[1] = 'r';
}
if ((mode & S_IWUSR))
{
str[2] = 'w';
}
if ((mode & S_IXUSR))
{
str[3] = 'x';
}
if ((mode & S_IRGRP))
{
str[4] = 'r';
}
if ((mode & S_IWGRP))
{
str[5] = 'w';
}
if ((mode & S_IXGRP))
{
str[6] = 'x';
}
if ((mode & S_IROTH))
{
str[7] = 'r';
}
if ((mode & S_IWOTH))
{
str[8] = 'w';
}
if ((mode & S_IXOTH))
{
str[9] = 'x';
}
}
void show_list_l() //ls -l
{
show_path();
DIR* dir;
struct dirent* ptr;
dir = opendir(path);
if(dir==NULL){
perror("cannot open");
exit(0);
}
while((ptr = readdir(dir)) != NULL) {
if(strcmp(ptr->d_name,".")==0 || strcmp(ptr->d_name,"..")==0)//dismiss "." and ".."
continue;
else if(*(ptr->d_name) =='.')
continue;
/***** filter ****/
/*if(ptr->d_type==8) {//file
printf("%s\t", ptr->d_name);
}else {//folder
printf("\033[35m%s\033[0m\t", ptr->d_name);
}*/
char* file_path = (char*)malloc(MAX_LENGTH);
struct stat file;
strcpy(file_path,path);
strcat(file_path,"/");
strcat(file_path,ptr->d_name);
if(stat(file_path,&file)<0) {
perror("read file failed");
exit(0);
}
char mode[15];
mode_to_letters(file.st_mode,mode);
/*
printf("文件名: %s\t\t",ptr->d_name);
printf("保护模式：%s",mode);
printf("文件类型:%uc",ptr->d_type);
printf("连接数: %d\t",file.st_nlink);
printf("所有者: %s\t",uid_to_name(file.st_uid));
printf("组: %s\t",gid_to_name(file.st_gid));
printf("大小: %d\t",file.st_size);
printf("修改时间: %s\t",ctime(&file.st_mtime));
printf("\n");
*/
printf("%s %d %s\t%s\t%d\t%.16s ",mode,file.st_nlink,uid_to_name(file.st_uid),gid_to_name(file.st_gid),file.st_size,ctime(&file.st_mtime));
if(ptr->d_type==4)
printf("\033[35m%s\033[0m\n",ptr->d_name);
else
printf("%s\n", ptr->d_name);
}
closedir(dir);
}
void show_list_all() //ls -a
{
DIR* dir;
struct dirent* ptr;
dir = opendir(path);
if(dir==NULL){
perror("cannot open");
exit(0);
}
while((ptr = readdir(dir)) != NULL) {
if(ptr->d_type==8) {//file
printf("%s\t", ptr->d_name);
}else {//folder
printf("\033[35m%s\033[0m\t", ptr->d_name);
}
}
closedir(dir);
}
void show_list() //ls
{
DIR* dir;
struct dirent* ptr;
dir = opendir(path);
if(dir==NULL){
perror("cannot open");
exit(0);
}
while((ptr = readdir(dir)) != NULL) {
if(strcmp(ptr->d_name,".")==0 || strcmp(ptr->d_name,"..")==0)//dismiss "." and ".."
continue;
else if(*(ptr->d_name) =='.')
continue;
if(ptr->d_type==8) {//file
printf("%s\t", ptr->d_name);
}else {//folder
printf("\033[35m%s\033[0m\t", ptr->d_name);
}
}
closedir(dir);
}
void show_list_recur() //ls -R
{
list_file_recur(path);
}
void list_file_recur(char *pth) {
printf("\033[35m%s\033[0m:\n",pth);
DIR* dir;
struct dirent* ptr;
dir = opendir(pth);
if(dir==NULL){
perror("cannot open");
exit(0);
}
//handle file
int i=0;
char folder[100][100];
memset(folder,0,sizeof(folder));
while((ptr = readdir(dir)) != NULL) {
if(ptr->d_type==8) {//is file
if(*(ptr->d_name)=='.') continue;//filter hide
printf("%s\n",ptr->d_name);
}
else {
if(*(ptr->d_name)=='.') continue;//filter hide & ..
if(strcmp(ptr->d_name,".")==0||strcmp(ptr->d_name,"..")==0) continue;
strcpy(folder[i++],ptr->d_name);
}
}
printf("\n");
//handle folder
int j=0;
for(j=0;j<i;j++) {
char new_path[100];
strcpy(new_path,path);
strcat(new_path,"/");
strcat(new_path,folder[j]);
list_file_recur(new_path);
//printf("foloder:%s \n",new_path);
}
}
int main(int argc,char* argv[])
{
getcwd(buff,sizeof(buff));
cwd = buff;//current_working_directory
if(argc>=2) {
int i=0;
para = argv[1];
for(i=0;i<strlen(para);i++) {
para[i]=tolower(para[i]);//pre_handle_to_lower_case
}
}
if(argc==1) {//ls
path = cwd;
show_list();
} else if(argc==2) { //ls <path> or ls <parameter>
para = argv[1];
path = cwd;
if(strcmp(para,"-a")==0) {
show_list_all();
} else if(strcmp(para,"-l")==0) {
show_list_l();
} else if(strcmp(para,"-r")==0) {
show_list_recur();
} else if(strcmp(para,"-h")==0) {
show_help();
} else {
if(argv[1][0]=='/')
path = argv[1];
else {
strcat(cwd,"/");
strcat(cwd,argv[1]);
path = cwd;
}
show_list();// ls <path>
}
} else if(argc==3) { //ls <parameter> <path>
para = argv[1];
path = argv[2];
if(argv[2][0]=='/')
path = argv[2];
else {
strcat(cwd,"/");
strcat(cwd,argv[2]);
path = cwd;
}
if(strcmp(para,"-a")==0) {
show_list_all();
} else if(strcmp(para,"-l")==0) {
show_list_l();
} else if(strcmp(para,"-r")==0) {
show_list_recur();
} else if(strcmp(para,"-h")==0) {
show_help();
} else {
printf("un support parameter: %s",para);
exit(0);
}
} else {
printf("to much argument");
exit(0);
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.