/* Task 2 Binary Search Tree -- search */
void task_3(){
//start_Task3:
//puts("task3\n");
//search_node(s_search_tree, 5);
//search_node(s_search_tree, 6);
//search_node(s_search_tree, 12);
/*putchar(10);*/
// CLI
putchar('C');
// STI
for(int i=0;i<5;i++){
int dest0 = reverse_integer(123456789);
int dest1 = reverse_integer(-123456789);
int dest2 = reverse_integer(0);
int dest3 = reverse_integer(1000);
int dest4 = reverse_integer(-1000);
}
/*putchar('w');*/
/*putchar(10);*/
if(wait_after_done){
task_done(s_processor);
// goto start_Task3;
while (1)
{
/* putchar('C');*/
/*putchar(10);*/
}
}
}
/* Task 1 Reverse Integer */
void task_1() {
//start_Task1:
if(wait_after_done==0){
/*puts("task1 start\n");*/
/* putchar(10);*/
/*putchar('1');*/
/*putchar('s');*/
/*putchar(10);*/
}
// CLI
__asm__("j7 7");
putchar('A');
//
int dest0 = reverse_integer(123456789);
int dest1 = reverse_integer(-123456789);
int dest2 = reverse_integer(0);
putchar('a');
int dest3 = reverse_integer(1000);
int dest4 = reverse_integer(-1000);
// putchar('a');
if(wait_after_done==1){
task_done(s_processor);
// goto start_Task1;
while (1)
{
// CLI
/* putchar('A');*/
/*putchar(10);*/
// STI
}
}else{
/*puts("task1 done\n");*/
/* putchar('1');*/
/*putchar('e');*/
/*putchar(10);*/
}
}
/* Task 2 Binary Search Tree -- insert & delete */
void task_2(){
//start_Task2:
//puts("task2\n");
//insert(s_search_tree, 14);
//insert(s_search_tree, 15);
//insert(s_search_tree, 2);
//delete(s_search_tree, 14);
//delete(s_search_tree, 15);
//delete(s_search_tree, 2);
// CLI
putchar('B');
// STI
for(int i=0;i<3;i++){
int dest0 = reverse_integer(123456789);
int dest1 = reverse_integer(-123456789);
int dest2 = reverse_integer(0);
int dest3 = reverse_integer(1000);
int dest4 = reverse_integer(-1000);
}
putchar('b');
if(wait_after_done){
task_done(s_processor);
// goto start_Task2;
while (1)
{
// CLI
/* putchar('B');*/
/*putchar(10);*/
// STI
}
}
}
int main ()
{
int n = 587593999;
printf ("Reverse of %d is %f %lu.\n", n, reverse_integer(n), sizeof(double));
return 0;
}
