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

/* Variables and functions */
int /*<<< orphan*/ remove_edge(struct graph *, int, int);
void remove_edge5(struct graph *g, int a, int b, int c, int d, int e) {
  remove_edge(g, a, b);
  remove_edge(g, b, c);
  remove_edge(g, c, d);
  remove_edge(g, d, e);
}


x86 assembly (clang, -O0):
<remove_edge5>:
push   %rbp
mov    %rsp,%rbp
sub    $0x20,%rsp
mov    %rdi,-0x8(%rbp)
mov    %esi,-0xc(%rbp)
mov    %edx,-0x10(%rbp)
mov    %ecx,-0x14(%rbp)
mov    %r8d,-0x18(%rbp)
mov    %r9d,-0x1c(%rbp)
mov    -0x8(%rbp),%rdi
mov    -0xc(%rbp),%esi
mov    -0x10(%rbp),%edx
call   1030 <remove_edge@plt>
mov    -0x8(%rbp),%rdi
mov    -0x10(%rbp),%esi
mov    -0x14(%rbp),%edx
call   1030 <remove_edge@plt>
mov    -0x8(%rbp),%rdi
mov    -0x14(%rbp),%esi
mov    -0x18(%rbp),%edx
call   1030 <remove_edge@plt>
mov    -0x8(%rbp),%rdi
mov    -0x18(%rbp),%esi
mov    -0x1c(%rbp),%edx
call   1030 <remove_edge@plt>
add    $0x20,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<remove_edge5>:
push   %rbp
push   %r15
push   %r14
push   %r12
push   %rbx
mov    %r9d,%r14d
mov    %r8d,%r15d
mov    %ecx,%r12d
mov    %edx,%ebp
mov    %rdi,%rbx
call   1030 <remove_edge@plt>
mov    %rbx,%rdi
mov    %ebp,%esi
mov    %r12d,%edx
call   1030 <remove_edge@plt>
mov    %rbx,%rdi
mov    %r12d,%esi
mov    %r15d,%edx
call   1030 <remove_edge@plt>
mov    %rbx,%rdi
mov    %r15d,%esi
mov    %r14d,%edx
pop    %rbx
pop    %r12
pop    %r14
pop    %r15
pop    %rbp
jmp    1030 <remove_edge@plt>

LLVM IR (-O0):
%struct.graph = type { i32 }
define void @remove_edge5(%struct.graph* %0, i32 %1, i32 %2, i32 %3, i32 %4, i32 %5) {
%7 = alloca %struct.graph*
%8 = alloca i32
%9 = alloca i32
%10 = alloca i32
%11 = alloca i32
%12 = alloca i32
store %struct.graph* %0, %struct.graph** %7
store i32 %1, i32* %8
store i32 %2, i32* %9
store i32 %3, i32* %10
store i32 %4, i32* %11
store i32 %5, i32* %12
%13 = load %struct.graph*, %struct.graph** %7
%14 = load i32, i32* %8
%15 = load i32, i32* %9
%16 = call i32 @remove_edge(%struct.graph* %13, i32 %14, i32 %15)
%17 = load %struct.graph*, %struct.graph** %7
%18 = load i32, i32* %9
%19 = load i32, i32* %10
%20 = call i32 @remove_edge(%struct.graph* %17, i32 %18, i32 %19)
%21 = load %struct.graph*, %struct.graph** %7
%22 = load i32, i32* %10
%23 = load i32, i32* %11
%24 = call i32 @remove_edge(%struct.graph* %21, i32 %22, i32 %23)
%25 = load %struct.graph*, %struct.graph** %7
%26 = load i32, i32* %11
%27 = load i32, i32* %12
%28 = call i32 @remove_edge(%struct.graph* %25, i32 %26, i32 %27)
ret void
}

LLVM IR (-O2):
%struct.graph = type { i32 }
define void @remove_edge5(%struct.graph* %0, i32 %1, i32 %2, i32 %3, i32 %4, i32 %5) {
%7 = tail call i32 @remove_edge(%struct.graph* %0, i32 %1, i32 %2)
%8 = tail call i32 @remove_edge(%struct.graph* %0, i32 %2, i32 %3)
%9 = tail call i32 @remove_edge(%struct.graph* %0, i32 %3, i32 %4)
%10 = tail call i32 @remove_edge(%struct.graph* %0, i32 %4, i32 %5)
ret void
}