// File: /workspace/github_c_makefile_star2_O1/CarlosLunaMota[P]BinaryTrees/main.c
// Function: bs_tree_fast_sequential_test
int bs_tree_fast_sequential_test(int max_size) {

    int i;
    bs_tree *tree  = new_bs_tree(MyComp);
    MyData  *data  = NULL;
    MyData  *found = NULL;

    // It is a bs_tree:
    if (is_bs_tree(tree) == NO) { return FAIL; }

    // It is empty:
    if (bs_tree_is_empty(tree) == NO) { return FAIL; }

    // Insert elements sequentially in the tree:
    for (i=0; i<max_size; i++) {
        
        data = (MyData *) malloc(sizeof(MyData));
        data->key = i;
        found = bs_tree_insert_max(tree, data);

        // It was not already there:
        if (found != NULL) { return FAIL; }

        // It is a bs_tree:
        if (is_bs_tree(tree) == NO)        { return FAIL; }

        // It is not empty:
        if (bs_tree_is_empty(tree) == YES) { return FAIL; }

    }

    // Check if all elements are there:
    data = (MyData *) malloc(sizeof(MyData));
    for (i=0; i<max_size; i++) {
        data->key = i;
        found = bs_tree_search(tree, data);
        if (found == NULL)            { return FAIL; }
        if (MyComp(data, found) != 0) { return FAIL; }
    }
    free(data);

    // Check if everything is correctly sorted forward...
    found = bs_tree_min(tree);
    if (found == NULL)   { return FAIL; }
    if (found->key != 0) { return FAIL; }
    while (found != NULL) {
        data  = found;
        found = bs_tree_next(tree, data);
        if (found != NULL) {
            if (MyComp(data, found) >= 0) { return FAIL; }
        } else { 
            found = bs_tree_max(tree);
            if (found == NULL)            { return FAIL; }
            if (MyComp(data, found) != 0) { return FAIL; }
            break;
        }
    }

    // ...and backwards.
    found = bs_tree_max(tree);
    if (found == NULL)            { return FAIL; }
    if (found->key != max_size-1) { return FAIL; }
    while (found != NULL) {
        data  = found;
        found = bs_tree_prev(tree, data);
        if (found != NULL) {
            if (MyComp(data, found) <= 0) { return FAIL; }
        } else { 
            found = bs_tree_min(tree);
            if (found == NULL)            { return FAIL; }
            if (MyComp(data, found) != 0) { return FAIL; }
            break; 
        }
    }

    // Now, clean everything!
    for (i=max_size; i>0; i--) {
        
        found = bs_tree_remove_max(tree);

        // Not enought elements:
        if (found == NULL) { return FAIL; }
        else               { free(found); }

        // It is a bs_tree:
        if (is_bs_tree(tree) == NO) { return FAIL; }
    }
    
    // It is a bs_tree:
    if (is_bs_tree(tree) == NO) { return FAIL; }

    // It is empty:
    if (bs_tree_is_empty(tree) == NO) { return FAIL; }

    // Insert elements sequentially in the tree:
    for (i=max_size; i>0; i--) {
        
        data = (MyData *) malloc(sizeof(MyData));
        data->key = i;
        found = bs_tree_insert_min(tree, data);

        // It was not already there:
        if (found != NULL) { return FAIL; }

        // It is a bs_tree:
        if (is_bs_tree(tree) == NO)        { return FAIL; }

        // It is not empty:
        if (bs_tree_is_empty(tree) == YES) { return FAIL; }

    }

    // Check if all elements are there:
    data = (MyData *) malloc(sizeof(MyData));
    for (i=max_size; i>0; i--) {
        data->key = i;
        found = bs_tree_search(tree, data);
        if (found == NULL)            { return FAIL; }
        if (MyComp(data, found) != 0) { return FAIL; }
    }
    free(data);

    // Check if everything is correctly sorted forward...
    found = bs_tree_min(tree);
    if (found == NULL)   { return FAIL; }
    if (found->key != 1) { return FAIL; }
    while (found != NULL) {
        data  = found;
        found = bs_tree_next(tree, data);
        if (found != NULL) {
            if (MyComp(data, found) >= 0) { return FAIL; }
        } else { 
            found = bs_tree_max(tree);
            if (found == NULL)            { return FAIL; }
            if (MyComp(data, found) != 0) { return FAIL; }
            break;
        }
    }

    // ...and backwards.
    found = bs_tree_max(tree);
    if (found == NULL)          { return FAIL; }
    if (found->key != max_size) { return FAIL; }
    while (found != NULL) {
        data  = found;
        found = bs_tree_prev(tree, data);
        if (found != NULL) {
            if (MyComp(data, found) <= 0) { return FAIL; }
        } else { 
            found = bs_tree_min(tree);
            if (found == NULL)            { return FAIL; }
            if (MyComp(data, found) != 0) { return FAIL; }
            break; 
        }
    }

    // Now, clean everything!
    for (i=max_size; i>0; i--) {
        
        found = bs_tree_remove_min(tree);

        // Not enought elements:
        if (found == NULL) { return FAIL; }
        else               { free(found); }

        // It is a bs_tree:
        if (is_bs_tree(tree) == NO) { return FAIL; }
    }
    
    // It is a bs_tree:
    if (is_bs_tree(tree) == NO) { return FAIL; }

    // It is empty:
    if (bs_tree_is_empty(tree) == NO) { return FAIL; }

    // Insert elements sequentially in the tree:
    for (i=1; i<=max_size; i++) {
        
        data = (MyData *) malloc(sizeof(MyData));
        data->key = i;
        found = bs_tree_insert_max(tree, data);

        // It was not already there:
        if (found != NULL) { return FAIL; }

        // It is a bs_tree:
        if (is_bs_tree(tree) == NO)        { return FAIL; }

        // It is not empty:
        if (bs_tree_is_empty(tree) == YES) { return FAIL; }

        data = (MyData *) malloc(sizeof(MyData));
        data->key = -i;
        found = bs_tree_insert_min(tree, data);

        // It was not already there:
        if (found != NULL) { return FAIL; }

        // It is a bs_tree:
        if (is_bs_tree(tree) == NO)        { return FAIL; }

        // It is not empty:
        if (bs_tree_is_empty(tree) == YES) { return FAIL; }

    }

    // Check if all elements are there:
    data = (MyData *) malloc(sizeof(MyData));
    for (i=1; i<=max_size; i++) {
        data->key = i;
        found = bs_tree_search(tree, data);
        if (found == NULL)            { return FAIL; }
        if (MyComp(data, found) != 0) { return FAIL; }
        data->key = -i;
        found = bs_tree_search(tree, data);
        if (found == NULL)            { return FAIL; }
        if (MyComp(data, found) != 0) { return FAIL; }
    }
    free(data);

    // Check if everything is correctly sorted forward...
    found = bs_tree_min(tree);
    if (found == NULL)           { return FAIL; }
    if (found->key != -max_size) { return FAIL; }
    while (found != NULL) {
        data  = found;
        found = bs_tree_next(tree, data);
        if (found != NULL) {
            if (MyComp(data, found) >= 0) { return FAIL; }
        } else { 
            found = bs_tree_max(tree);
            if (found == NULL)            { return FAIL; }
            if (MyComp(data, found) != 0) { return FAIL; }
            break;
        }
    }

    // ...and backwards.
    found = bs_tree_max(tree);
    if (found == NULL)          { return FAIL; }
    if (found->key != max_size) { return FAIL; }
    while (found != NULL) {
        data  = found;
        found = bs_tree_prev(tree, data);
        if (found != NULL) {
            if (MyComp(data, found) <= 0) { return FAIL; }
        } else { 
            found = bs_tree_min(tree);
            if (found == NULL)            { return FAIL; }
            if (MyComp(data, found) != 0) { return FAIL; }
            break; 
        }
    }

    // Now, clean everything!
    for (i=1; i<=max_size; i++) {
        
        found = bs_tree_remove_max(tree);

        // Not enought elements:
        if (found == NULL) { return FAIL; }
        else               { free(found); }

        // It is a bs_tree:
        if (is_bs_tree(tree) == NO) { return FAIL; }

        found = bs_tree_remove_min(tree);

        // Not enought elements:
        if (found == NULL) { return FAIL; }
        else               { free(found); }

        // It is a bs_tree:
        if (is_bs_tree(tree) == NO) { return FAIL; }
    }
    
    // It is a bs_tree:
    if (is_bs_tree(tree) == NO) { return FAIL; }

    // It is empty:
    if (bs_tree_is_empty(tree) == NO) { return FAIL; }

    free(tree);
    
    return PASS;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movl %edi, %r15d
leaq -0x593(%rip), %rdi      # 0x166c
callq 0x78a4
movq %rax, %r14
movq %rax, %rdi
callq 0x942c
movl $0x1, %ebx
testl %eax, %eax
je 0x1cc3
movq %r14, %rdi
callq 0x7ca1
testl %eax, %eax
je 0x1cc3
testl %r15d, %r15d
jle 0x1c6f
xorl %ebp, %ebp
movl $0x4, %edi
callq 0x10d0
movl %ebp, (%rax)
movq %r14, %rdi
movq %rax, %rsi
callq 0x7bd7
testq %rax, %rax
jne 0x1cc3
movq %r14, %rdi
callq 0x942c
testl %eax, %eax
je 0x1cc3
movq %r14, %rdi
callq 0x7ca1
cmpl $0x1, %eax
je 0x1cc3
incl %ebp
cmpl %ebp, %r15d
jne 0x1c33
movl $0x4, %edi
callq 0x10d0
movq %rax, %r12
testl %r15d, %r15d
jle 0x1ca6
xorl %ebp, %ebp
movl %ebp, (%r12)
movq %r14, %rdi
movq %r12, %rsi
callq 0x7cd0
testq %rax, %rax
je 0x1cc3
movl (%r12), %ecx
cmpl (%rax), %ecx
jne 0x1cc3
incl %ebp
cmpl %ebp, %r15d
jne 0x1c83
movq %r12, %rdi
callq 0x1120
movq %r14, %rdi
callq 0x7d67
testq %rax, %rax
je 0x1cc3
movq %rax, %r12
cmpl $0x0, (%rax)
je 0x1cdf
movl %ebx, %eax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movl (%r12), %ecx
movq %rax, %r12
cmpl (%rax), %ecx
jge 0x1cc3
movq %r14, %rdi
movq %r12, %rsi
callq 0x7eaf
testq %rax, %rax
jne 0x1cd4
movq %r14, %rdi
callq 0x7da9
testq %rax, %rax
je 0x1cc3
movl (%r12), %ecx
cmpl (%rax), %ecx
jne 0x1cc3
movq %r14, %rdi
callq 0x7da9
testq %rax, %rax
je 0x1cc3
movq %rax, %r12
leal -0x1(%r15), %eax
cmpl %eax, (%r12)
jne 0x1cc3
movq %r14, %rdi
movq %r12, %rsi
callq 0x7deb
testq %rax, %rax
je 0x1d3b
movl (%r12), %ecx
movq %rax, %r12
cmpl (%rax), %ecx
jg 0x1d1e
jmp 0x1cc3
movq %r14, %rdi
callq 0x7d67
testq %rax, %rax
je 0x1cc3
movl (%r12), %ecx
cmpl (%rax), %ecx
jne 0x1cc3
testl %r15d, %r15d
jle 0x1d91
leal 0x1(%r15), %ebp
movq %r14, %rdi
callq 0x80f5
testq %rax, %rax
je 0x1cc3
movq %rax, %rdi
callq 0x1120
movq %r14, %rdi
callq 0x942c
testl %eax, %eax
je 0x1cc3
decl %ebp
cmpl $0x2, %ebp
jge 0x1d61
movq %r14, %rdi
callq 0x942c
testl %eax, %eax
je 0x1cc3
movq %r14, %rdi
callq 0x7ca1
testl %eax, %eax
je 0x1cc3
testl %r15d, %r15d
jle 0x1e09
movl %r15d, %r12d
movl $0x4, %edi
callq 0x10d0
movl %r12d, (%rax)
movq %r14, %rdi
movq %rax, %rsi
callq 0x7b0d
testq %rax, %rax
jne 0x1cc3
movq %r14, %rdi
callq 0x942c
testl %eax, %eax
je 0x1cc3
movq %r14, %rdi
callq 0x7ca1
cmpl $0x1, %eax
je 0x1cc3
leal -0x1(%r12), %eax
cmpl $0x2, %r12d
movl %eax, %r12d
jge 0x1db9
movl $0x4, %edi
callq 0x10d0
movq %rax, %r12
testl %r15d, %r15d
jle 0x1e4f
movl %r15d, %r13d
movl %r13d, (%r12)
movq %r14, %rdi
movq %r12, %rsi
callq 0x7cd0
testq %rax, %rax
je 0x1cc3
movl (%r12), %ecx
cmpl (%rax), %ecx
jne 0x1cc3
leal -0x1(%r13), %eax
cmpl $0x2, %r13d
movl %eax, %r13d
jge 0x1e1e
movq %r12, %rdi
callq 0x1120
movq %r14, %rdi
callq 0x7d67
testq %rax, %rax
je 0x1cc3
movq %rax, %r12
cmpl $0x1, (%rax)
jne 0x1cc3
movq %r14, %rdi
movq %r12, %rsi
callq 0x7eaf
testq %rax, %rax
je 0x1e94
movl (%r12), %ecx
movq %rax, %r12
cmpl (%rax), %ecx
jl 0x1e74
jmp 0x1cc3
movq %r14, %rdi
callq 0x7da9
testq %rax, %rax
je 0x1cc3
movl (%r12), %ecx
cmpl (%rax), %ecx
jne 0x1cc3
movq %r14, %rdi
callq 0x7da9
testq %rax, %rax
je 0x1cc3
movq %rax, %r12
cmpl %r15d, (%rax)
jne 0x1cc3
movq %r14, %rdi
movq %r12, %rsi
callq 0x7deb
testq %rax, %rax
je 0x1eee
movl (%r12), %ecx
movq %rax, %r12
cmpl (%rax), %ecx
jg 0x1ece
jmp 0x1cc3
movq %r14, %rdi
callq 0x7d67
testq %rax, %rax
je 0x1cc3
movl (%r12), %ecx
cmpl (%rax), %ecx
jne 0x1cc3
testl %r15d, %r15d
jle 0x1f44
leal 0x1(%r15), %ebp
movq %r14, %rdi
callq 0x8091
testq %rax, %rax
je 0x1cc3
movq %rax, %rdi
callq 0x1120
movq %r14, %rdi
callq 0x942c
testl %eax, %eax
je 0x1cc3
decl %ebp
cmpl $0x2, %ebp
jge 0x1f14
movq %r14, %rdi
callq 0x942c
testl %eax, %eax
je 0x1cc3
movq %r14, %rdi
callq 0x7ca1
testl %eax, %eax
je 0x1cc3
testl %r15d, %r15d
jle 0x201a
movl %r15d, %r12d
negl %r12d
movl $0xffffffff, %ebp       # imm = 0xFFFFFFFF
movl $0x1, %r13d
movl $0x4, %edi
callq 0x10d0
movl %r13d, (%rax)
movq %r14, %rdi
movq %rax, %rsi
callq 0x7bd7
testq %rax, %rax
jne 0x20db
movq %r14, %rdi
callq 0x942c
testl %eax, %eax
je 0x20db
movq %r14, %rdi
callq 0x7ca1
cmpl $0x1, %eax
je 0x20db
movl $0x4, %edi
callq 0x10d0
movl %ebp, (%rax)
movq %r14, %rdi
movq %rax, %rsi
callq 0x7b0d
testq %rax, %rax
jne 0x20db
movq %r14, %rdi
callq 0x942c
testl %eax, %eax
je 0x20db
movq %r14, %rdi
callq 0x7ca1
cmpl $0x1, %eax
je 0x20db
leal (%r12,%r13), %eax
incl %eax
movl %r13d, %ecx
incl %ecx
decl %ebp
movl %ecx, %r13d
cmpl $0x1, %eax
jne 0x1f7e
movl $0x4, %edi
callq 0x10d0
movq %rax, %r12
testl %r15d, %r15d
jle 0x2094
movl %r15d, %eax
negl %eax
movq %rax, (%rsp)
movl $0xffffffff, %ebp       # imm = 0xFFFFFFFF
movl $0x1, %r13d
movl %r13d, (%r12)
movq %r14, %rdi
movq %r12, %rsi
callq 0x7cd0
testq %rax, %rax
je 0x20db
movl (%r12), %ecx
cmpl (%rax), %ecx
jne 0x20db
movl %ebp, (%r12)
movq %r14, %rdi
movq %r12, %rsi
callq 0x7cd0
testq %rax, %rax
je 0x20db
movl (%r12), %ecx
cmpl (%rax), %ecx
jne 0x20db
movq (%rsp), %rax
addl %r13d, %eax
incl %eax
movl %r13d, %ecx
incl %ecx
decl %ebp
movl %ecx, %r13d
cmpl $0x1, %eax
jne 0x2040
movq %r12, %rdi
callq 0x1120
movq %r14, %rdi
callq 0x7d67
testq %rax, %rax
je 0x1cc3
movq %rax, %r12
movl (%rax), %eax
addl %r15d, %eax
jne 0x1cc3
movq %r14, %rdi
movq %r12, %rsi
callq 0x7eaf
testq %rax, %rax
je 0x20e5
movl (%r12), %ecx
movq %rax, %r12
cmpl (%rax), %ecx
jl 0x20bb
jmp 0x1cc3
movl $0x1, %ebx
jmp 0x1cc3
movq %r14, %rdi
callq 0x7da9
testq %rax, %rax
je 0x1cc3
movl (%r12), %ecx
cmpl (%rax), %ecx
jne 0x1cc3
movq %r14, %rdi
callq 0x7da9
testq %rax, %rax
je 0x1cc3
movq %rax, %r12
cmpl %r15d, (%rax)
jne 0x1cc3
movq %r14, %rdi
movq %r12, %rsi
callq 0x7deb
testq %rax, %rax
je 0x213f
movl (%r12), %ecx
movq %rax, %r12
cmpl (%rax), %ecx
jg 0x211f
jmp 0x1cc3
movq %r14, %rdi
callq 0x7d67
testq %rax, %rax
je 0x1cc3
movl (%r12), %ecx
cmpl (%rax), %ecx
jne 0x1cc3
testl %r15d, %r15d
jle 0x21b8
movq %r14, %rdi
callq 0x80f5
testq %rax, %rax
je 0x1cc3
movq %rax, %rdi
callq 0x1120
movq %r14, %rdi
callq 0x942c
testl %eax, %eax
je 0x1cc3
movq %r14, %rdi
callq 0x8091
testq %rax, %rax
je 0x1cc3
movq %rax, %rdi
callq 0x1120
movq %r14, %rdi
callq 0x942c
testl %eax, %eax
je 0x1cc3
decl %r15d
jne 0x2161
movq %r14, %rdi
callq 0x942c
testl %eax, %eax
je 0x1cc3
movq %r14, %rdi
callq 0x7ca1
testl %eax, %eax
je 0x1cc3
movq %r14, %rdi
callq 0x1120
xorl %ebx, %ebx
jmp 0x1cc3