#define NULL ((void *)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t;
typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */

/* Type definitions */
struct Node {
  int dummy;
};
typedef int /*<<< orphan*/ items;

/* Variables and functions */
int /*<<< orphan*/ free_tree(struct Node *);
int /*<<< orphan*/ insert(struct Node **, int);
int /*<<< orphan*/ remove_node(struct Node **, int);
int /*<<< orphan*/ test_tree_properties(struct Node *);
void test_remove_complex_2() {
  struct Node *root = NULL;
  int items[] = {60, 44, 69, 67, 91, 89, 98};
  for (size_t i = 0; i < sizeof(items) / sizeof(items[0]); i++) {
    insert(&root, items[i]);
  };
  test_tree_properties(root);
  remove_node(&root, 69);
  remove_node(&root, 91);
  test_tree_properties(root);
  free_tree(root);
  root = NULL;
}


x86 assembly (clang, -O0):
<test_remove_complex_2>:
push   %rbp
mov    %rsp,%rbp
sub    $0x40,%rsp
movq   $0x0,-0x8(%rbp)
mov    0xea9(%rip),%rax
mov    %rax,-0x30(%rbp)
mov    0xea6(%rip),%rax
mov    %rax,-0x28(%rbp)
mov    0xea3(%rip),%rax
mov    %rax,-0x20(%rbp)
mov    0xea1(%rip),%eax
mov    %eax,-0x18(%rbp)
movq   $0x0,-0x38(%rbp)
cmpq   $0x7,-0x38(%rbp)
jae    11af <test_remove_complex_2+0x6f>
mov    -0x38(%rbp),%rax
mov    -0x30(%rbp,%rax,4),%esi
lea    -0x8(%rbp),%rdi
call   1060 <insert@plt>
mov    -0x38(%rbp),%rax
add    $0x1,%rax
mov    %rax,-0x38(%rbp)
jmp    1182 <test_remove_complex_2+0x42>
mov    -0x8(%rbp),%rdi
call   1040 <test_tree_properties@plt>
lea    -0x8(%rbp),%rdi
mov    $0x45,%esi
call   1050 <remove_node@plt>
lea    -0x8(%rbp),%rdi
mov    $0x5b,%esi
call   1050 <remove_node@plt>
mov    -0x8(%rbp),%rdi
call   1040 <test_tree_properties@plt>
mov    -0x8(%rbp),%rdi
call   1030 <free_tree@plt>
movq   $0x0,-0x8(%rbp)
add    $0x40,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<test_remove_complex_2>:
push   %rbx
sub    $0x10,%rsp
movq   $0x0,0x8(%rsp)
lea    0x8(%rsp),%rbx
mov    %rbx,%rdi
mov    $0x3c,%esi
call   1060 <insert@plt>
mov    %rbx,%rdi
mov    $0x2c,%esi
call   1060 <insert@plt>
mov    %rbx,%rdi
mov    $0x45,%esi
call   1060 <insert@plt>
mov    %rbx,%rdi
mov    $0x43,%esi
call   1060 <insert@plt>
mov    %rbx,%rdi
mov    $0x5b,%esi
call   1060 <insert@plt>
mov    %rbx,%rdi
mov    $0x59,%esi
call   1060 <insert@plt>
mov    %rbx,%rdi
mov    $0x62,%esi
call   1060 <insert@plt>
mov    0x8(%rsp),%rdi
call   1040 <test_tree_properties@plt>
mov    %rbx,%rdi
mov    $0x45,%esi
call   1050 <remove_node@plt>
mov    %rbx,%rdi
mov    $0x5b,%esi
call   1050 <remove_node@plt>
mov    0x8(%rsp),%rdi
call   1040 <test_tree_properties@plt>
mov    0x8(%rsp),%rdi
call   1030 <free_tree@plt>
add    $0x10,%rsp
pop    %rbx
ret

LLVM IR (-O0):
%struct.Node = type { i32 }
@__const.test_remove_complex_2.items = [7 x i32] [i32 60, i32 44, i32 69, i32 67, i32 91, i32 89, i32 98]
define void @test_remove_complex_2() {
%1 = alloca %struct.Node*
%2 = alloca [7 x i32]
%3 = alloca i64
store %struct.Node* null, %struct.Node** %1
%4 = bitcast [7 x i32]* %2 to i8*
store i64 0, i64* %3
br label %5
5: ; preds = %13, %0
%6 = load i64, i64* %3
%7 = icmp ult i64 %6, 7
br i1 %7, label %8, label %16
8: ; preds = %5
%9 = load i64, i64* %3
%10 = getelementptr inbounds [7 x i32], [7 x i32]* %2, i64 0, i64 %9
%11 = load i32, i32* %10
%12 = call i32 @insert(%struct.Node** %1, i32 %11)
br label %13
13: ; preds = %8
%14 = load i64, i64* %3
%15 = add i64 %14, 1
store i64 %15, i64* %3
br label %5
16: ; preds = %5
%17 = load %struct.Node*, %struct.Node** %1
%18 = call i32 @test_tree_properties(%struct.Node* %17)
%19 = call i32 @remove_node(%struct.Node** %1, i32 69)
%20 = call i32 @remove_node(%struct.Node** %1, i32 91)
%21 = load %struct.Node*, %struct.Node** %1
%22 = call i32 @test_tree_properties(%struct.Node* %21)
%23 = load %struct.Node*, %struct.Node** %1
%24 = call i32 @free_tree(%struct.Node* %23)
store %struct.Node* null, %struct.Node** %1
ret void
}

LLVM IR (-O2):
%struct.Node = type { i32 }
define void @test_remove_complex_2() {
%1 = alloca %struct.Node*
%2 = bitcast %struct.Node** %1 to i8*
store %struct.Node* null, %struct.Node** %1
%3 = call i32 @insert(%struct.Node** %1, i32 60)
%4 = call i32 @insert(%struct.Node** %1, i32 44)
%5 = call i32 @insert(%struct.Node** %1, i32 69)
%6 = call i32 @insert(%struct.Node** %1, i32 67)
%7 = call i32 @insert(%struct.Node** %1, i32 91)
%8 = call i32 @insert(%struct.Node** %1, i32 89)
%9 = call i32 @insert(%struct.Node** %1, i32 98)
%10 = load %struct.Node*, %struct.Node** %1
%11 = call i32 @test_tree_properties(%struct.Node* %10)
%12 = call i32 @remove_node(%struct.Node** %1, i32 69)
%13 = call i32 @remove_node(%struct.Node** %1, i32 91)
%14 = load %struct.Node*, %struct.Node** %1
%15 = call i32 @test_tree_properties(%struct.Node* %14)
%16 = load %struct.Node*, %struct.Node** %1
%17 = call i32 @free_tree(%struct.Node* %16)
ret void
}