#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 SyncStatusTree {
  int dummy;
};

/* Variables and functions */
int /*<<< orphan*/ S_IFDIR;
int /*<<< orphan*/ S_IFREG;
int /*<<< orphan*/ printf(char *, ...);
int /*<<< orphan*/ sync_status_tree_add(struct SyncStatusTree *, char *,
                                        int /*<<< orphan*/);
int /*<<< orphan*/ sync_status_tree_del(struct SyncStatusTree *, char *);
int sync_status_tree_exists(struct SyncStatusTree *, char *);
struct SyncStatusTree *sync_status_tree_new();
int main(int argc, char **argv) {
  struct SyncStatusTree *tree;
  int val;
  tree = sync_status_tree_new();
  sync_status_tree_add(tree, "a/b/c.txt", S_IFREG);
  sync_status_tree_add(tree, "a/b/c/d", S_IFDIR);
  sync_status_tree_add(tree, "a/xxx.txt", S_IFREG);
  printf("test after add\n");
  val = sync_status_tree_exists(tree, "a/b/c.txt");
  printf("a/b/c.txt: %d\n", val);
  val = sync_status_tree_exists(tree, "a/b/c/d");
  printf("a/b/c/d: %d\n", val);
  val = sync_status_tree_exists(tree, "a/d/f.foo");
  printf("a/d/f.foo: %d\n", val);
  val = sync_status_tree_exists(tree, "a/b");
  printf("a/b: %d\n", val);
  sync_status_tree_del(tree, "a/b/c.txt");
  sync_status_tree_del(tree, "a/b/c/d");
  sync_status_tree_del(tree, "a/xxx.txt");
  sync_status_tree_del(tree, "a/c.pdf");
  printf("test after del\n");
  val = sync_status_tree_exists(tree, "a/b/c.txt");
  printf("a/b/c.txt: %d\n", val);
  val = sync_status_tree_exists(tree, "a/b/c/d");
  printf("a/b/c/d: %d\n", val);
  val = sync_status_tree_exists(tree, "a/b");
  printf("a/b: %d\n", val);
  val = sync_status_tree_exists(tree, "a");
  printf("a: %d\n", val);
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x20,%rsp
mov    %edi,-0x4(%rbp)
mov    %rsi,-0x10(%rbp)
mov    $0x0,%al
call   1040 <sync_status_tree_new@plt>
mov    %rax,-0x18(%rbp)
mov    -0x18(%rbp),%rdi
mov    0x2e73(%rip),%rax
mov    (%rax),%edx
lea    0xe82(%rip),%rsi
call   1070 <sync_status_tree_add@plt>
mov    -0x18(%rbp),%rdi
mov    0x2e42(%rip),%rax
mov    (%rax),%edx
lea    0xe73(%rip),%rsi
call   1070 <sync_status_tree_add@plt>
mov    -0x18(%rbp),%rdi
mov    0x2e41(%rip),%rax
mov    (%rax),%edx
lea    0xe62(%rip),%rsi
call   1070 <sync_status_tree_add@plt>
lea    0xe60(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x18(%rbp),%rdi
lea    0xe32(%rip),%rsi
call   1060 <sync_status_tree_exists@plt>
mov    %eax,-0x1c(%rbp)
mov    -0x1c(%rbp),%esi
lea    0xe4c(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x18(%rbp),%rdi
lea    0xe18(%rip),%rsi
call   1060 <sync_status_tree_exists@plt>
mov    %eax,-0x1c(%rbp)
mov    -0x1c(%rbp),%esi
lea    0xe37(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x18(%rbp),%rdi
lea    0xe32(%rip),%rsi
call   1060 <sync_status_tree_exists@plt>
mov    %eax,-0x1c(%rbp)
mov    -0x1c(%rbp),%esi
lea    0xe2a(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x18(%rbp),%rdi
lea    0xe27(%rip),%rsi
call   1060 <sync_status_tree_exists@plt>
mov    %eax,-0x1c(%rbp)
mov    -0x1c(%rbp),%esi
lea    0xe19(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x18(%rbp),%rdi
lea    0xda2(%rip),%rsi
call   1050 <sync_status_tree_del@plt>
mov    -0x18(%rbp),%rdi
lea    0xd9c(%rip),%rsi
call   1050 <sync_status_tree_del@plt>
mov    -0x18(%rbp),%rdi
lea    0xd94(%rip),%rsi
call   1050 <sync_status_tree_del@plt>
mov    -0x18(%rbp),%rdi
lea    0xde0(%rip),%rsi
call   1050 <sync_status_tree_del@plt>
lea    0xddc(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x18(%rbp),%rdi
lea    0xd54(%rip),%rsi
call   1060 <sync_status_tree_exists@plt>
mov    %eax,-0x1c(%rbp)
mov    -0x1c(%rbp),%esi
lea    0xd6e(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x18(%rbp),%rdi
lea    0xd3a(%rip),%rsi
call   1060 <sync_status_tree_exists@plt>
mov    %eax,-0x1c(%rbp)
mov    -0x1c(%rbp),%esi
lea    0xd59(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x18(%rbp),%rdi
lea    0xd6d(%rip),%rsi
call   1060 <sync_status_tree_exists@plt>
mov    %eax,-0x1c(%rbp)
mov    -0x1c(%rbp),%esi
lea    0xd5f(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
mov    -0x18(%rbp),%rdi
lea    0xd6e(%rip),%rsi
call   1060 <sync_status_tree_exists@plt>
mov    %eax,-0x1c(%rbp)
mov    -0x1c(%rbp),%esi
lea    0xd5e(%rip),%rdi
mov    $0x0,%al
call   1030 <printf@plt>
xor    %eax,%eax
add    $0x20,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rbp
push   %r15
push   %r14
push   %r13
push   %r12
push   %rbx
push   %rax
xor    %eax,%eax
call   1050 <sync_status_tree_new@plt>
mov    %rax,%rbx
mov    0x2e6c(%rip),%rbp
mov    0x0(%rbp),%edx
lea    0xe7a(%rip),%r15
mov    %rax,%rdi
mov    %r15,%rsi
call   1080 <sync_status_tree_add@plt>
mov    0x2e38(%rip),%rax
mov    (%rax),%edx
lea    0xe69(%rip),%r14
mov    %rbx,%rdi
mov    %r14,%rsi
call   1080 <sync_status_tree_add@plt>
mov    0x0(%rbp),%edx
lea    0xe5c(%rip),%rbp
mov    %rbx,%rdi
mov    %rbp,%rsi
call   1080 <sync_status_tree_add@plt>
lea    0xea7(%rip),%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
mov    %r15,%rsi
call   1070 <sync_status_tree_exists@plt>
lea    0xe3d(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1040 <printf@plt>
mov    %rbx,%rdi
mov    %r14,%rsi
call   1070 <sync_status_tree_exists@plt>
lea    0xe31(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1040 <printf@plt>
lea    0xe2e(%rip),%rsi
mov    %rbx,%rdi
call   1070 <sync_status_tree_exists@plt>
lea    0xe29(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1040 <printf@plt>
lea    0xe28(%rip),%r12
mov    %rbx,%rdi
mov    %r12,%rsi
call   1070 <sync_status_tree_exists@plt>
lea    0xe1a(%rip),%r13
mov    %r13,%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1040 <printf@plt>
mov    %rbx,%rdi
mov    %r15,%rsi
call   1060 <sync_status_tree_del@plt>
mov    %rbx,%rdi
mov    %r14,%rsi
call   1060 <sync_status_tree_del@plt>
mov    %rbx,%rdi
mov    %rbp,%rsi
call   1060 <sync_status_tree_del@plt>
lea    0xdef(%rip),%rsi
mov    %rbx,%rdi
call   1060 <sync_status_tree_del@plt>
lea    0xe00(%rip),%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
mov    %r15,%rsi
call   1070 <sync_status_tree_exists@plt>
lea    0xd87(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1040 <printf@plt>
mov    %rbx,%rdi
mov    %r14,%rsi
call   1070 <sync_status_tree_exists@plt>
lea    0xd7b(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1040 <printf@plt>
mov    %rbx,%rdi
mov    %r12,%rsi
call   1070 <sync_status_tree_exists@plt>
mov    %r13,%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1040 <printf@plt>
lea    0xd8f(%rip),%rsi
mov    %rbx,%rdi
call   1070 <sync_status_tree_exists@plt>
lea    0xd82(%rip),%rdi
mov    %eax,%esi
xor    %eax,%eax
call   1040 <printf@plt>
xor    %eax,%eax
add    $0x8,%rsp
pop    %rbx
pop    %r12
pop    %r13
pop    %r14
pop    %r15
pop    %rbp
ret

LLVM IR (-O0):
%struct.SyncStatusTree = type { i32 }
@.str = [10 x i8] c"a/b/c.txt\00"
@S_IFREG = global i32 0
@.str.1 = [8 x i8] c"a/b/c/d\00"
@S_IFDIR = global i32 0
@.str.2 = [10 x i8] c"a/xxx.txt\00"
@.str.3 = [16 x i8] c"test after add\0A\00"
@.str.4 = [15 x i8] c"a/b/c.txt: %d\0A\00"
@.str.5 = [13 x i8] c"a/b/c/d: %d\0A\00"
@.str.6 = [10 x i8] c"a/d/f.foo\00"
@.str.7 = [15 x i8] c"a/d/f.foo: %d\0A\00"
@.str.8 = [4 x i8] c"a/b\00"
@.str.9 = [9 x i8] c"a/b: %d\0A\00"
@.str.10 = [8 x i8] c"a/c.pdf\00"
@.str.11 = [16 x i8] c"test after del\0A\00"
@.str.12 = [2 x i8] c"a\00"
@.str.13 = [7 x i8] c"a: %d\0A\00"
define i32 @main(i32 %0, i8** %1) {
%3 = alloca i32
%4 = alloca i8**
%5 = alloca %struct.SyncStatusTree*
%6 = alloca i32
store i32 %0, i32* %3
store i8** %1, i8*** %4
%7 = call %struct.SyncStatusTree* (...) @sync_status_tree_new()
store %struct.SyncStatusTree* %7, %struct.SyncStatusTree** %5
%8 = load %struct.SyncStatusTree*, %struct.SyncStatusTree** %5
%9 = load i32, i32* @S_IFREG
%10 = call i32 @sync_status_tree_add(%struct.SyncStatusTree* %8, i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str, i64 0, i64 0), i32 %9)
%11 = load %struct.SyncStatusTree*, %struct.SyncStatusTree** %5
%12 = load i32, i32* @S_IFDIR
%13 = call i32 @sync_status_tree_add(%struct.SyncStatusTree* %11, i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.1, i64 0, i64 0), i32 %12)
%14 = load %struct.SyncStatusTree*, %struct.SyncStatusTree** %5
%15 = load i32, i32* @S_IFREG
%16 = call i32 @sync_status_tree_add(%struct.SyncStatusTree* %14, i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str.2, i64 0, i64 0), i32 %15)
%17 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @.str.3, i64 0, i64 0))
%18 = load %struct.SyncStatusTree*, %struct.SyncStatusTree** %5
%19 = call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %18, i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str, i64 0, i64 0))
store i32 %19, i32* %6
%20 = load i32, i32* %6
%21 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @.str.4, i64 0, i64 0), i32 %20)
%22 = load %struct.SyncStatusTree*, %struct.SyncStatusTree** %5
%23 = call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %22, i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.1, i64 0, i64 0))
store i32 %23, i32* %6
%24 = load i32, i32* %6
%25 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.5, i64 0, i64 0), i32 %24)
%26 = load %struct.SyncStatusTree*, %struct.SyncStatusTree** %5
%27 = call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %26, i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str.6, i64 0, i64 0))
store i32 %27, i32* %6
%28 = load i32, i32* %6
%29 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @.str.7, i64 0, i64 0), i32 %28)
%30 = load %struct.SyncStatusTree*, %struct.SyncStatusTree** %5
%31 = call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %30, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.8, i64 0, i64 0))
store i32 %31, i32* %6
%32 = load i32, i32* %6
%33 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str.9, i64 0, i64 0), i32 %32)
%34 = load %struct.SyncStatusTree*, %struct.SyncStatusTree** %5
%35 = call i32 @sync_status_tree_del(%struct.SyncStatusTree* %34, i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str, i64 0, i64 0))
%36 = load %struct.SyncStatusTree*, %struct.SyncStatusTree** %5
%37 = call i32 @sync_status_tree_del(%struct.SyncStatusTree* %36, i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.1, i64 0, i64 0))
%38 = load %struct.SyncStatusTree*, %struct.SyncStatusTree** %5
%39 = call i32 @sync_status_tree_del(%struct.SyncStatusTree* %38, i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str.2, i64 0, i64 0))
%40 = load %struct.SyncStatusTree*, %struct.SyncStatusTree** %5
%41 = call i32 @sync_status_tree_del(%struct.SyncStatusTree* %40, i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.10, i64 0, i64 0))
%42 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @.str.11, i64 0, i64 0))
%43 = load %struct.SyncStatusTree*, %struct.SyncStatusTree** %5
%44 = call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %43, i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str, i64 0, i64 0))
store i32 %44, i32* %6
%45 = load i32, i32* %6
%46 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @.str.4, i64 0, i64 0), i32 %45)
%47 = load %struct.SyncStatusTree*, %struct.SyncStatusTree** %5
%48 = call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %47, i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.1, i64 0, i64 0))
store i32 %48, i32* %6
%49 = load i32, i32* %6
%50 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.5, i64 0, i64 0), i32 %49)
%51 = load %struct.SyncStatusTree*, %struct.SyncStatusTree** %5
%52 = call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %51, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.8, i64 0, i64 0))
store i32 %52, i32* %6
%53 = load i32, i32* %6
%54 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str.9, i64 0, i64 0), i32 %53)
%55 = load %struct.SyncStatusTree*, %struct.SyncStatusTree** %5
%56 = call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %55, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.12, i64 0, i64 0))
store i32 %56, i32* %6
%57 = load i32, i32* %6
%58 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([7 x i8], [7 x i8]* @.str.13, i64 0, i64 0), i32 %57)
ret i32 0
}

LLVM IR (-O2):
%struct.SyncStatusTree = type { i32 }
@.str = [10 x i8] c"a/b/c.txt\00"
@S_IFREG = global i32 0
@.str.1 = [8 x i8] c"a/b/c/d\00"
@S_IFDIR = global i32 0
@.str.2 = [10 x i8] c"a/xxx.txt\00"
@.str.4 = [15 x i8] c"a/b/c.txt: %d\0A\00"
@.str.5 = [13 x i8] c"a/b/c/d: %d\0A\00"
@.str.6 = [10 x i8] c"a/d/f.foo\00"
@.str.7 = [15 x i8] c"a/d/f.foo: %d\0A\00"
@.str.8 = [4 x i8] c"a/b\00"
@.str.9 = [9 x i8] c"a/b: %d\0A\00"
@.str.10 = [8 x i8] c"a/c.pdf\00"
@.str.12 = [2 x i8] c"a\00"
@.str.13 = [7 x i8] c"a: %d\0A\00"
@str = [15 x i8] c"test after add\00"
@str.14 = [15 x i8] c"test after del\00"
define i32 @main(i32 %0, i8** nocapture readnone %1) {
%3 = tail call %struct.SyncStatusTree* (...) @sync_status_tree_new()
%4 = load i32, i32* @S_IFREG
%5 = tail call i32 @sync_status_tree_add(%struct.SyncStatusTree* %3, i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str, i64 0, i64 0), i32 %4)
%6 = load i32, i32* @S_IFDIR
%7 = tail call i32 @sync_status_tree_add(%struct.SyncStatusTree* %3, i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.1, i64 0, i64 0), i32 %6)
%8 = load i32, i32* @S_IFREG
%9 = tail call i32 @sync_status_tree_add(%struct.SyncStatusTree* %3, i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str.2, i64 0, i64 0), i32 %8)
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @str, i64 0, i64 0))
%11 = tail call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %3, i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str, i64 0, i64 0))
%12 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @.str.4, i64 0, i64 0), i32 %11)
%13 = tail call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %3, i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.1, i64 0, i64 0))
%14 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @.str.5, i64 0, i64 0), i32 %13)
%15 = tail call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %3, i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str.6, i64 0, i64 0))
%16 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @.str.7, i64 0, i64 0), i32 %15)
%17 = tail call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %3, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.8, i64 0, i64 0))
%18 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([9 x i8], [9 x i8]* @.str.9, i64 0, i64 0), i32 %17)
%19 = tail call i32 @sync_status_tree_del(%struct.SyncStatusTree* %3, i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str, i64 0, i64 0))
%20 = tail call i32 @sync_status_tree_del(%struct.SyncStatusTree* %3, i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.1, i64 0, i64 0))
%21 = tail call i32 @sync_status_tree_del(%struct.SyncStatusTree* %3, i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str.2, i64 0, i64 0))
%22 = tail call i32 @sync_status_tree_del(%struct.SyncStatusTree* %3, i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.10, i64 0, i64 0))
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @str.14, i64 0, i64 0))
%24 = tail call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %3, i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str, i64 0, i64 0))
%25 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @.str.4, i64 0, i64 0), i32 %24)
%26 = tail call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %3, i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.1, i64 0, i64 0))
%27 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @.str.5, i64 0, i64 0), i32 %26)
%28 = tail call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %3, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.8, i64 0, i64 0))
%29 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([9 x i8], [9 x i8]* @.str.9, i64 0, i64 0), i32 %28)
%30 = tail call i32 @sync_status_tree_exists(%struct.SyncStatusTree* %3, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.12, i64 0, i64 0))
%31 = tail call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([7 x i8], [7 x i8]* @.str.13, i64 0, i64 0), i32 %30)
ret i32 0
}