// File: /workspace/github_c_makefile_star2_O1/CarlosLunaMota[P]BinaryTrees/main.c
// Function: bs_tree_random_test
int bs_tree_random_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 randomly in the tree:
    for (i=0; i<max_size*10; i++) {
        
        data = (MyData *) malloc(sizeof(MyData));
        data->key = rand() % max_size;

        // Insert it:
        found = bs_tree_insert(tree, data);

        // If it was already there:
        if (found != NULL) { free(found); }

        // 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 everything is correctly sorted forward...
    found = bs_tree_min(tree);
    if (found == NULL) { 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; }
    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; 
        }
    }

    // Remove elements randomly from the tree:
    for (i=0; i<max_size*5; i++) {
        
        data = (MyData *) malloc(sizeof(MyData));
        data->key = rand() % max_size;

        // Remove element
        found = bs_tree_remove(tree, data);

        // If it was there:
        if (found != NULL) { free(found); }

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

    // Check if everything is correctly sorted forward...
    found = bs_tree_min(tree);
    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);
    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!
    bs_tree_remove_all(tree, free);

    // 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 %r12
pushq %rbx
movl %edi, %r14d
leaq -0xb8d(%rip), %rdi      # 0x166c
callq 0x78a4
movq %rax, %rbx
movq %rax, %rdi
callq 0x942c
testl %eax, %eax
je 0x2448
movq %rbx, %rdi
callq 0x7ca1
testl %eax, %eax
je 0x2448
testl %r14d, %r14d
jle 0x2296
leal (%r14,%r14), %eax
leal (%rax,%rax,4), %eax
cmpl $0x2, %eax
movl $0x1, %r12d
cmovgel %eax, %r12d
movl $0x1, %ebp
movl $0x4, %edi
callq 0x10d0
movq %rax, %r15
callq 0x1110
cltd
idivl %r14d
movl %edx, (%r15)
movq %rbx, %rdi
movq %r15, %rsi
callq 0x7a24
testq %rax, %rax
je 0x2270
movq %rax, %rdi
callq 0x1120
movq %rbx, %rdi
callq 0x942c
testl %eax, %eax
je 0x244d
movq %rbx, %rdi
callq 0x7ca1
cmpl $0x1, %eax
je 0x244d
decl %r12d
jne 0x223f
movq %rbx, %rdi
callq 0x7d67
testq %rax, %rax
je 0x2448
movq %rax, %r15
movq %rbx, %rdi
movq %r15, %rsi
callq 0x7eaf
testq %rax, %rax
je 0x22c9
movl (%r15), %ecx
movq %rax, %r15
cmpl (%rax), %ecx
jl 0x22aa
jmp 0x2448
movq %rbx, %rdi
callq 0x7da9
testq %rax, %rax
je 0x2448
movl (%r15), %ecx
cmpl (%rax), %ecx
jne 0x2448
movq %rbx, %rdi
callq 0x7da9
testq %rax, %rax
je 0x2448
movq %rax, %r15
movq %rbx, %rdi
movq %r15, %rsi
callq 0x7deb
testq %rax, %rax
je 0x2318
movl (%r15), %ecx
movq %rax, %r15
cmpl (%rax), %ecx
jg 0x22f9
jmp 0x2448
movq %rbx, %rdi
callq 0x7d67
testq %rax, %rax
je 0x2448
movl (%r15), %ecx
cmpl (%rax), %ecx
jne 0x2448
testl %r14d, %r14d
jle 0x238d
leal (%r14,%r14,4), %eax
cmpl $0x2, %eax
movl $0x1, %ebp
cmovgel %eax, %ebp
movl $0x4, %edi
callq 0x10d0
movq %rax, %r15
callq 0x1110
cltd
idivl %r14d
movl %edx, (%r15)
movq %rbx, %rdi
movq %r15, %rsi
callq 0x7f67
testq %rax, %rax
je 0x2379
movq %rax, %rdi
callq 0x1120
movq %rbx, %rdi
callq 0x942c
testl %eax, %eax
je 0x2448
decl %ebp
jne 0x2348
movq %rbx, %rdi
callq 0x7d67
movq %rax, %r14
testq %r14, %r14
je 0x23d0
movq %rbx, %rdi
movq %r14, %rsi
callq 0x7eaf
testq %rax, %rax
je 0x23bc
movl (%r14), %ecx
movq %rax, %r14
cmpl (%rax), %ecx
jl 0x2398
jmp 0x2448
movq %rbx, %rdi
callq 0x7da9
testq %rax, %rax
je 0x2448
movl (%r14), %ecx
cmpl (%rax), %ecx
jne 0x2448
movq %rbx, %rdi
callq 0x7da9
movq %rax, %r14
testq %r14, %r14
je 0x2410
movq %rbx, %rdi
movq %r14, %rsi
callq 0x7deb
testq %rax, %rax
je 0x23fc
movl (%r14), %ecx
movq %rax, %r14
cmpl (%rax), %ecx
jg 0x23db
jmp 0x2448
movq %rbx, %rdi
callq 0x7d67
testq %rax, %rax
je 0x2448
movl (%r14), %ecx
cmpl (%rax), %ecx
jne 0x2448
movq 0xfba9(%rip), %rsi      # 0x11fc0
movq %rbx, %rdi
callq 0x8159
movq %rbx, %rdi
callq 0x942c
testl %eax, %eax
je 0x2448
movq %rbx, %rdi
callq 0x7ca1
movl $0x1, %ebp
testl %eax, %eax
je 0x244d
movq %rbx, %rdi
callq 0x1120
xorl %ebp, %ebp
jmp 0x244d
movl $0x1, %ebp
movl %ebp, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq