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

/* Variables and functions */
int /*<<< orphan*/ EXIT_SUCCESS;
int /*<<< orphan*/ delete_table(struct hash_table **);
int /*<<< orphan*/ exit(int /*<<< orphan*/);
int /*<<< orphan*/ init_table(struct hash_table **, int);
int insert_data(struct hash_table *, char *, char *);
int /*<<< orphan*/ print_table(struct hash_table *);
int /*<<< orphan*/ printf(char *, ...);
int /*<<< orphan*/ remove_data(struct hash_table *, char *);
int /*<<< orphan*/ scanf(char *, ...);
char *search(struct hash_table *, char *);
int main() {
  printf("\nHash Table - Linear Probing\n\n");
  int option;
  struct hash_table *ht = NULL;
  while (1) {
    printf("\nEnter the option number:\n");
    printf("1. Create a hash table \n");
    printf("2. Insert data \n");
    printf("3. Remove data \n");
    printf("4. Search data\n");
    printf("5. Delete hash table \n");
    printf("6. Print Table\n");
    printf("7. Exit\n");
    printf("\n\n");
    printf("Enter the option number: ");
    scanf("%d", &option);
    int val;
    char key[50], data[50];
    switch (option) {
    case 1:
      printf("Enter the size of the table ");
      scanf("%d", &val);
      init_table(&ht, val);
      break;
    case 2:
      printf("Enter key to be inserted: ");
      scanf("%s", key);
      printf("Enter data to be inserted: ");
      scanf("%s", data);
      if (ht) {
        if ((insert_data(ht, key, data) == -1))
          printf("No space left in hash table!\n");
      }
      break;
    case 3:
      printf("Enter key to be removed: ");
      scanf("%s", key);
      remove_data(ht, key);
      break;
    case 4:
      printf("Enter key to search:");
      scanf(" %s", key);
      char *find = search(ht, key);
      if (find)
        printf("Data found: %s\n", find);
      break;
    case 5:
      delete_table(&ht);
      break;
    case 6:
      print_table(ht);
      break;
    case 7:
      exit(EXIT_SUCCESS);
      break;
    default:
      printf("Invalid Option\n");
    }
  }
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0xb0,%rsp
movl   $0x0,-0x4(%rbp)
lea    0xe73(%rip),%rdi
mov    $0x0,%al
call   1060 <printf@plt>
movq   $0x0,-0x10(%rbp)
lea    0xe7c(%rip),%rdi
xor    %eax,%eax
mov    %al,-0xa1(%rbp)
call   1060 <printf@plt>
mov    -0xa1(%rbp),%al
lea    0xe7d(%rip),%rdi
call   1060 <printf@plt>
mov    -0xa1(%rbp),%al
lea    0xe84(%rip),%rdi
call   1060 <printf@plt>
mov    -0xa1(%rbp),%al
lea    0xe83(%rip),%rdi
call   1060 <printf@plt>
mov    -0xa1(%rbp),%al
lea    0xe82(%rip),%rdi
call   1060 <printf@plt>
mov    -0xa1(%rbp),%al
lea    0xe80(%rip),%rdi
call   1060 <printf@plt>
mov    -0xa1(%rbp),%al
lea    0xe85(%rip),%rdi
call   1060 <printf@plt>
mov    -0xa1(%rbp),%al
lea    0xe83(%rip),%rdi
call   1060 <printf@plt>
mov    -0xa1(%rbp),%al
lea    0xde1(%rip),%rdi
call   1060 <printf@plt>
mov    -0xa1(%rbp),%al
lea    0xe68(%rip),%rdi
call   1060 <printf@plt>
mov    -0xa1(%rbp),%al
lea    0xe70(%rip),%rdi
lea    -0x8(%rbp),%rsi
call   1090 <scanf@plt>
mov    -0x8(%rbp),%eax
add    $0xffffffff,%eax
mov    %eax,%ecx
mov    %rcx,-0xa0(%rbp)
sub    $0x6,%eax
ja     141f <main+0x28f>
mov    -0xa0(%rbp),%rax
lea    0xd56(%rip),%rcx
movslq (%rcx,%rax,4),%rax
add    %rcx,%rax
jmp    *%rax
lea    0xe34(%rip),%rdi
mov    $0x0,%al
call   1060 <printf@plt>
lea    0xe23(%rip),%rdi
lea    -0x14(%rbp),%rsi
mov    $0x0,%al
call   1090 <scanf@plt>
mov    -0x14(%rbp),%esi
lea    -0x10(%rbp),%rdi
call   1050 <init_table@plt>
jmp    142d <main+0x29d>
lea    0xe20(%rip),%rdi
mov    $0x0,%al
call   1060 <printf@plt>
lea    -0x50(%rbp),%rsi
lea    0xe93(%rip),%rdi
mov    $0x0,%al
call   1090 <scanf@plt>
lea    0xe1b(%rip),%rdi
mov    $0x0,%al
call   1060 <printf@plt>
lea    -0x90(%rbp),%rsi
lea    0xe70(%rip),%rdi
mov    $0x0,%al
call   1090 <scanf@plt>
cmpq   $0x0,-0x10(%rbp)
je     1362 <main+0x1d2>
mov    -0x10(%rbp),%rdi
lea    -0x50(%rbp),%rsi
lea    -0x90(%rbp),%rdx
call   1030 <insert_data@plt>
cmp    $0xffffffff,%eax
jne    135d <main+0x1cd>
lea    0xdec(%rip),%rdi
mov    $0x0,%al
call   1060 <printf@plt>
jmp    1362 <main+0x1d2>
jmp    142d <main+0x29d>
lea    0xdf2(%rip),%rdi
mov    $0x0,%al
call   1060 <printf@plt>
lea    -0x50(%rbp),%rsi
lea    0xe10(%rip),%rdi
mov    $0x0,%al
call   1090 <scanf@plt>
mov    -0x10(%rbp),%rdi
lea    -0x50(%rbp),%rsi
call   10a0 <remove_data@plt>
jmp    142d <main+0x29d>
lea    0xdda(%rip),%rdi
mov    $0x0,%al
call   1060 <printf@plt>
lea    -0x50(%rbp),%rsi
lea    0xddd(%rip),%rdi
mov    $0x0,%al
call   1090 <scanf@plt>
mov    -0x10(%rbp),%rdi
lea    -0x50(%rbp),%rsi
call   1070 <search@plt>
mov    %rax,-0x98(%rbp)
cmpq   $0x0,-0x98(%rbp)
je     13f0 <main+0x260>
mov    -0x98(%rbp),%rsi
lea    0xdaa(%rip),%rdi
mov    $0x0,%al
call   1060 <printf@plt>
jmp    142d <main+0x29d>
lea    -0x10(%rbp),%rdi
call   1080 <delete_table@plt>
jmp    142d <main+0x29d>
mov    -0x10(%rbp),%rdi
call   1040 <print_table@plt>
jmp    142d <main+0x29d>
mov    0x2bc8(%rip),%rax
mov    (%rax),%edi
call   10b0 <exit@plt>
lea    0xd7d(%rip),%rdi
mov    $0x0,%al
call   1060 <printf@plt>
jmp    11b8 <main+0x28>

x86 assembly (clang, -O2):
<main>:
push   %rbp
push   %r15
push   %r14
push   %r13
push   %r12
push   %rbx
sub    $0x88,%rsp
lea    0xf18(%rip),%rdi
call   1050 <puts@plt>
movq   $0x0,(%rsp)
lea    0xf20(%rip),%r15
lea    0xe49(%rip),%rbp
lea    0xe5c(%rip),%r13
lea    0xc(%rsp),%r12
lea    0xe1a(%rip),%rbx
jmp    1200 <main+0x60>
mov    (%rsp),%rdi
call   1040 <print_table@plt>
cs nopw 0x0(%rax,%rax,1)
nopl   0x0(%rax,%rax,1)
lea    0xee7(%rip),%rdi
call   1050 <puts@plt>
lea    0xef5(%rip),%rdi
call   1050 <puts@plt>
lea    0xf01(%rip),%rdi
call   1050 <puts@plt>
lea    0xf05(%rip),%rdi
call   1050 <puts@plt>
lea    0xf09(%rip),%rdi
call   1050 <puts@plt>
lea    0xf0c(%rip),%rdi
call   1050 <puts@plt>
lea    0xf16(%rip),%rdi
call   1050 <puts@plt>
lea    0xf19(%rip),%rdi
call   1050 <puts@plt>
mov    %r15,%rdi
call   1050 <puts@plt>
mov    %rbp,%rdi
xor    %eax,%eax
call   1070 <printf@plt>
mov    %r13,%rdi
mov    %r12,%rsi
xor    %eax,%eax
call   10a0 <scanf@plt>
mov    0xc(%rsp),%eax
add    $0xffffffff,%eax
cmp    $0x6,%eax
ja     12c2 <main+0x122>
movslq (%rbx,%rax,4),%rax
add    %rbx,%rax
jmp    *%rax
lea    0xd9e(%rip),%rdi
xor    %eax,%eax
call   1070 <printf@plt>
mov    %r13,%rdi
lea    0x10(%rsp),%rsi
xor    %eax,%eax
call   10a0 <scanf@plt>
mov    0x10(%rsp),%esi
mov    %rsp,%rdi
call   1060 <init_table@plt>
jmp    1200 <main+0x60>
lea    0xed0(%rip),%rdi
call   1050 <puts@plt>
jmp    1200 <main+0x60>
lea    0xd7c(%rip),%rdi
xor    %eax,%eax
call   1070 <printf@plt>
mov    %r13,%r14
mov    %r12,%r13
lea    0xdcf(%rip),%r12
mov    %r12,%rdi
lea    0x10(%rsp),%rsi
xor    %eax,%eax
call   10a0 <scanf@plt>
lea    0xd6d(%rip),%rdi
xor    %eax,%eax
call   1070 <printf@plt>
mov    %r12,%rdi
mov    %r13,%r12
mov    %r14,%r13
lea    0x50(%rsp),%rsi
xor    %eax,%eax
call   10a0 <scanf@plt>
mov    (%rsp),%rdi
test   %rdi,%rdi
je     1200 <main+0x60>
lea    0x10(%rsp),%rsi
lea    0x50(%rsp),%rdx
call   1030 <insert_data@plt>
cmp    $0xffffffff,%eax
jne    1200 <main+0x60>
lea    0xe30(%rip),%rdi
call   1050 <puts@plt>
jmp    1200 <main+0x60>
lea    0xd30(%rip),%rdi
xor    %eax,%eax
call   1070 <printf@plt>
lea    0xd52(%rip),%rdi
mov    %r15,%rbp
lea    0x10(%rsp),%r15
mov    %r15,%rsi
xor    %eax,%eax
call   10a0 <scanf@plt>
mov    (%rsp),%rdi
mov    %r15,%rsi
mov    %rbp,%r15
lea    0xc8e(%rip),%rbp
call   10b0 <remove_data@plt>
jmp    1200 <main+0x60>
lea    0xd08(%rip),%rdi
xor    %eax,%eax
call   1070 <printf@plt>
lea    0xd0f(%rip),%rdi
lea    0x10(%rsp),%rbp
mov    %rbp,%rsi
xor    %eax,%eax
call   10a0 <scanf@plt>
mov    (%rsp),%rdi
mov    %rbp,%rsi
lea    0xc52(%rip),%rbp
call   1080 <search@plt>
test   %rax,%rax
je     1200 <main+0x60>
lea    0xce1(%rip),%rdi
mov    %rax,%rsi
xor    %eax,%eax
call   1070 <printf@plt>
jmp    1200 <main+0x60>
mov    %rsp,%rdi
call   1090 <delete_table@plt>
jmp    1200 <main+0x60>
mov    0x2bde(%rip),%rax
mov    (%rax),%edi
call   10c0 <exit@plt>

LLVM IR (-O0):
%struct.hash_table = type { i32 }
@.str = [31 x i8] c"\0AHash Table - Linear Probing\0A\0A\00"
@.str.1 = [27 x i8] c"\0AEnter the option number:\0A\00"
@.str.2 = [25 x i8] c"1. Create a hash table \0A\00"
@.str.3 = [17 x i8] c"2. Insert data \0A\00"
@.str.4 = [17 x i8] c"3. Remove data \0A\00"
@.str.5 = [16 x i8] c"4. Search data\0A\00"
@.str.6 = [23 x i8] c"5. Delete hash table \0A\00"
@.str.7 = [16 x i8] c"6. Print Table\0A\00"
@.str.8 = [9 x i8] c"7. Exit\0A\00"
@.str.9 = [3 x i8] c"\0A\0A\00"
@.str.10 = [26 x i8] c"Enter the option number: \00"
@.str.11 = [3 x i8] c"%d\00"
@.str.12 = [29 x i8] c"Enter the size of the table \00"
@.str.13 = [27 x i8] c"Enter key to be inserted: \00"
@.str.14 = [3 x i8] c"%s\00"
@.str.15 = [28 x i8] c"Enter data to be inserted: \00"
@.str.16 = [30 x i8] c"No space left in hash table!\0A\00"
@.str.17 = [26 x i8] c"Enter key to be removed: \00"
@.str.18 = [21 x i8] c"Enter key to search:\00"
@.str.19 = [4 x i8] c" %s\00"
@.str.20 = [16 x i8] c"Data found: %s\0A\00"
@EXIT_SUCCESS = global i32 0
@.str.21 = [16 x i8] c"Invalid Option\0A\00"
define i32 @main() {
%1 = alloca i32
%2 = alloca i32
%3 = alloca %struct.hash_table*
%4 = alloca i32
%5 = alloca [50 x i8]
%6 = alloca [50 x i8]
%7 = alloca i8*
store i32 0, i32* %1
%8 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([31 x i8], [31 x i8]* @.str, i64 0, i64 0))
store %struct.hash_table* null, %struct.hash_table** %3
br label %9
9: ; preds = %0, %76
%10 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.1, i64 0, i64 0))
%11 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.2, i64 0, i64 0))
%12 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([17 x i8], [17 x i8]* @.str.3, i64 0, i64 0))
%13 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([17 x i8], [17 x i8]* @.str.4, i64 0, i64 0))
%14 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @.str.5, i64 0, i64 0))
%15 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([23 x i8], [23 x i8]* @.str.6, i64 0, i64 0))
%16 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @.str.7, i64 0, i64 0))
%17 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str.8, i64 0, i64 0))
%18 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.9, i64 0, i64 0))
%19 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.10, i64 0, i64 0))
%20 = call i32 (i8*, ...) @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.11, i64 0, i64 0), i32* %2)
%21 = load i32, i32* %2
switch i32 %21, label %74 [
i32 1, label %22
i32 2, label %27
i32 3, label %46
i32 4, label %53
i32 5, label %66
i32 6, label %68
i32 7, label %71
]
22: ; preds = %9
%23 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.12, i64 0, i64 0))
%24 = call i32 (i8*, ...) @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.11, i64 0, i64 0), i32* %4)
%25 = load i32, i32* %4
%26 = call i32 @init_table(%struct.hash_table** %3, i32 %25)
br label %76
27: ; preds = %9
%28 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.13, i64 0, i64 0))
%29 = getelementptr inbounds [50 x i8], [50 x i8]* %5, i64 0, i64 0
%30 = call i32 (i8*, ...) @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.14, i64 0, i64 0), i8* %29)
%31 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str.15, i64 0, i64 0))
%32 = getelementptr inbounds [50 x i8], [50 x i8]* %6, i64 0, i64 0
%33 = call i32 (i8*, ...) @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.14, i64 0, i64 0), i8* %32)
%34 = load %struct.hash_table*, %struct.hash_table** %3
%35 = icmp ne %struct.hash_table* %34, null
br i1 %35, label %36, label %45
36: ; preds = %27
%37 = load %struct.hash_table*, %struct.hash_table** %3
%38 = getelementptr inbounds [50 x i8], [50 x i8]* %5, i64 0, i64 0
%39 = getelementptr inbounds [50 x i8], [50 x i8]* %6, i64 0, i64 0
%40 = call i32 @insert_data(%struct.hash_table* %37, i8* %38, i8* %39)
%41 = icmp eq i32 %40, -1
br i1 %41, label %42, label %44
42: ; preds = %36
%43 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([30 x i8], [30 x i8]* @.str.16, i64 0, i64 0))
br label %44
44: ; preds = %42, %36
br label %45
45: ; preds = %44, %27
br label %76
46: ; preds = %9
%47 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.17, i64 0, i64 0))
%48 = getelementptr inbounds [50 x i8], [50 x i8]* %5, i64 0, i64 0
%49 = call i32 (i8*, ...) @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.14, i64 0, i64 0), i8* %48)
%50 = load %struct.hash_table*, %struct.hash_table** %3
%51 = getelementptr inbounds [50 x i8], [50 x i8]* %5, i64 0, i64 0
%52 = call i32 @remove_data(%struct.hash_table* %50, i8* %51)
br label %76
53: ; preds = %9
%54 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([21 x i8], [21 x i8]* @.str.18, i64 0, i64 0))
%55 = getelementptr inbounds [50 x i8], [50 x i8]* %5, i64 0, i64 0
%56 = call i32 (i8*, ...) @scanf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.19, i64 0, i64 0), i8* %55)
%57 = load %struct.hash_table*, %struct.hash_table** %3
%58 = getelementptr inbounds [50 x i8], [50 x i8]* %5, i64 0, i64 0
%59 = call i8* @search(%struct.hash_table* %57, i8* %58)
store i8* %59, i8** %7
%60 = load i8*, i8** %7
%61 = icmp ne i8* %60, null
br i1 %61, label %62, label %65
62: ; preds = %53
%63 = load i8*, i8** %7
%64 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @.str.20, i64 0, i64 0), i8* %63)
br label %65
65: ; preds = %62, %53
br label %76
66: ; preds = %9
%67 = call i32 @delete_table(%struct.hash_table** %3)
br label %76
68: ; preds = %9
%69 = load %struct.hash_table*, %struct.hash_table** %3
%70 = call i32 @print_table(%struct.hash_table* %69)
br label %76
71: ; preds = %9
%72 = load i32, i32* @EXIT_SUCCESS
%73 = call i32 @exit(i32 %72)
unreachable
74: ; preds = %9
%75 = call i32 (i8*, ...) @printf(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @.str.21, i64 0, i64 0))
br label %76
76: ; preds = %74, %68, %66, %65, %46, %45, %22
br label %9
}

LLVM IR (-O2):
%struct.hash_table = type { i32 }
@.str.10 = [26 x i8] c"Enter the option number: \00"
@.str.11 = [3 x i8] c"%d\00"
@.str.12 = [29 x i8] c"Enter the size of the table \00"
@.str.13 = [27 x i8] c"Enter key to be inserted: \00"
@.str.14 = [3 x i8] c"%s\00"
@.str.15 = [28 x i8] c"Enter data to be inserted: \00"
@.str.17 = [26 x i8] c"Enter key to be removed: \00"
@.str.18 = [21 x i8] c"Enter key to search:\00"
@.str.19 = [4 x i8] c" %s\00"
@.str.20 = [16 x i8] c"Data found: %s\0A\00"
@EXIT_SUCCESS = global i32 0
@str = [30 x i8] c"\0AHash Table - Linear Probing\0A\00"
@str.22 = [26 x i8] c"\0AEnter the option number:\00"
@str.23 = [24 x i8] c"1. Create a hash table \00"
@str.24 = [16 x i8] c"2. Insert data \00"
@str.25 = [16 x i8] c"3. Remove data \00"
@str.26 = [15 x i8] c"4. Search data\00"
@str.27 = [22 x i8] c"5. Delete hash table \00"
@str.28 = [15 x i8] c"6. Print Table\00"
@str.29 = [8 x i8] c"7. Exit\00"
@str.30 = [2 x i8] c"\0A\00"
@str.31 = [29 x i8] c"No space left in hash table!\00"
@str.32 = [15 x i8] c"Invalid Option\00"
define i32 @main() {
%1 = alloca i32
%2 = alloca %struct.hash_table*
%3 = alloca i32
%4 = alloca [50 x i8]
%5 = alloca [50 x i8]
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([30 x i8], [30 x i8]* @str, i64 0, i64 0))
%7 = bitcast i32* %1 to i8*
%8 = bitcast %struct.hash_table** %2 to i8*
store %struct.hash_table* null, %struct.hash_table** %2
%9 = bitcast i32* %3 to i8*
%10 = getelementptr inbounds [50 x i8], [50 x i8]* %4, i64 0, i64 0
%11 = getelementptr inbounds [50 x i8], [50 x i8]* %5, i64 0, i64 0
br label %12
12: ; preds = %65, %0
%13 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str.22, i64 0, i64 0))
%14 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str.23, i64 0, i64 0))
%15 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([16 x i8], [16 x i8]* @str.24, i64 0, i64 0))
%16 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([16 x i8], [16 x i8]* @str.25, i64 0, i64 0))
%17 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @str.26, i64 0, i64 0))
%18 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([22 x i8], [22 x i8]* @str.27, i64 0, i64 0))
%19 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @str.28, i64 0, i64 0))
%20 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([8 x i8], [8 x i8]* @str.29, i64 0, i64 0))
%21 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([2 x i8], [2 x i8]* @str.30, i64 0, i64 0))
%22 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @.str.10, i64 0, i64 0))
%23 = call i32 (i8*, ...) @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.11, i64 0, i64 0), i32* %1)
%24 = load i32, i32* %1
switch i32 %24, label %63 [
i32 1, label %25
i32 2, label %30
i32 3, label %42
i32 4, label %47
i32 5, label %55
i32 6, label %57
i32 7, label %60
]
25: ; preds = %12
%26 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([29 x i8], [29 x i8]* @.str.12, i64 0, i64 0))
%27 = call i32 (i8*, ...) @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.11, i64 0, i64 0), i32* %3)
%28 = load i32, i32* %3
%29 = call i32 @init_table(%struct.hash_table** %2, i32 %28)
br label %65
30: ; preds = %12
%31 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @.str.13, i64 0, i64 0))
%32 = call i32 (i8*, ...) @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.14, i64 0, i64 0), i8* %10)
%33 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @.str.15, i64 0, i64 0))
%34 = call i32 (i8*, ...) @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.14, i64 0, i64 0), i8* %11)
%35 = load %struct.hash_table*, %struct.hash_table** %2
%36 = icmp eq %struct.hash_table* %35, null
br i1 %36, label %65, label %37
37: ; preds = %30
%38 = call i32 @insert_data(%struct.hash_table* %35, i8* %10, i8* %11)
%39 = icmp eq i32 %38, -1
br i1 %39, label %40, label %65
40: ; preds = %37
%41 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([29 x i8], [29 x i8]* @str.31, i64 0, i64 0))
br label %65
42: ; preds = %12
%43 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @.str.17, i64 0, i64 0))
%44 = call i32 (i8*, ...) @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.14, i64 0, i64 0), i8* %10)
%45 = load %struct.hash_table*, %struct.hash_table** %2
%46 = call i32 @remove_data(%struct.hash_table* %45, i8* %10)
br label %65
47: ; preds = %12
%48 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([21 x i8], [21 x i8]* @.str.18, i64 0, i64 0))
%49 = call i32 (i8*, ...) @scanf(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @.str.19, i64 0, i64 0), i8* %10)
%50 = load %struct.hash_table*, %struct.hash_table** %2
%51 = call i8* @search(%struct.hash_table* %50, i8* %10)
%52 = icmp eq i8* %51, null
br i1 %52, label %65, label %53
53: ; preds = %47
%54 = call i32 (i8*, ...) @printf(i8* dereferenceable(1) getelementptr inbounds ([16 x i8], [16 x i8]* @.str.20, i64 0, i64 0), i8* %51)
br label %65
55: ; preds = %12
%56 = call i32 @delete_table(%struct.hash_table** %2)
br label %65
57: ; preds = %12
%58 = load %struct.hash_table*, %struct.hash_table** %2
%59 = call i32 @print_table(%struct.hash_table* %58)
br label %65
60: ; preds = %12
%61 = load i32, i32* @EXIT_SUCCESS
%62 = call i32 @exit(i32 %61)
unreachable
63: ; preds = %12
%64 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @str.32, i64 0, i64 0))
br label %65
65: ; preds = %47, %53, %30, %40, %37, %63, %57, %55, %42, %25
br label %12
}