#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 */

/* Variables and functions */
int /*<<< orphan*/ normal(int);
int normalize(int);
int /*<<< orphan*/ printf(char *);
int /*<<< orphan*/ recursive(int);
int /*<<< orphan*/ scanf(char *, int *);
int main() {
  int number;
  printf("Digite um número inteiro:\n");
  scanf("%d", &number);
  number = normalize(number);
  printf("Forma normal:\n");
  normal(number);
  printf("\nForma recursiva:\n");
  recursive(number);
  printf("\n");
  return 0;
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
lea    0xe9a(%rip),%rdi
call   1030 <printf@plt>
lea    0xeaa(%rip),%rdi
lea    -0x8(%rbp),%rsi
call   1050 <scanf@plt>
mov    -0x8(%rbp),%edi
call   1040 <normalize@plt>
mov    %eax,-0x8(%rbp)
lea    0xe92(%rip),%rdi
call   1030 <printf@plt>
mov    -0x8(%rbp),%edi
call   1070 <normal@plt>
lea    0xe8d(%rip),%rdi
call   1030 <printf@plt>
mov    -0x8(%rbp),%edi
call   1060 <recursive@plt>
lea    0xe8a(%rip),%rdi
call   1030 <printf@plt>
xor    %eax,%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rax
lea    0xe9b(%rip),%rdi
call   1040 <puts@plt>
lea    0xe8c(%rip),%rdi
lea    0x4(%rsp),%rsi
call   1060 <scanf@plt>
mov    0x4(%rsp),%edi
call   1050 <normalize@plt>
mov    %eax,0x4(%rsp)
lea    0xe8c(%rip),%rdi
call   1040 <puts@plt>
mov    0x4(%rsp),%edi
call   1080 <normal@plt>
lea    0xe85(%rip),%rdi
call   1040 <puts@plt>
mov    0x4(%rsp),%edi
call   1070 <recursive@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
xor    %eax,%eax
pop    %rcx
ret

LLVM IR (-O0):
@.str = [28 x i8] c"Digite um n\C3\BAmero inteiro:\0A\00"
@.str.1 = [3 x i8] c"%d\00"
@.str.2 = [15 x i8] c"Forma normal:\0A\00"
@.str.3 = [19 x i8] c"\0AForma recursiva:\0A\00"
@.str.4 = [2 x i8] c"\0A\00"
define i32 @main() {
%1 = alloca i32
%2 = alloca i32
store i32 0, i32* %1
%3 = call i32 @printf(i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str, i64 0, i64 0))
%4 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.1, i64 0, i64 0), i32* %2)
%5 = load i32, i32* %2
%6 = call i32 @normalize(i32 %5)
store i32 %6, i32* %2
%7 = call i32 @printf(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @.str.2, i64 0, i64 0))
%8 = load i32, i32* %2
%9 = call i32 @normal(i32 %8)
%10 = call i32 @printf(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @.str.3, i64 0, i64 0))
%11 = load i32, i32* %2
%12 = call i32 @recursive(i32 %11)
%13 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.4, i64 0, i64 0))
ret i32 0
}

LLVM IR (-O2):
@.str.1 = [3 x i8] c"%d\00"
@str = [27 x i8] c"Digite um n\C3\BAmero inteiro:\00"
@str.5 = [14 x i8] c"Forma normal:\00"
@str.6 = [18 x i8] c"\0AForma recursiva:\00"
define i32 @main() {
%1 = alloca i32
%2 = bitcast i32* %1 to i8*
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @str, i64 0, i64 0))
%4 = call i32 @scanf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str.1, i64 0, i64 0), i32* %1)
%5 = load i32, i32* %1
%6 = call i32 @normalize(i32 %5)
store i32 %6, i32* %1
%7 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([14 x i8], [14 x i8]* @str.5, i64 0, i64 0))
%8 = load i32, i32* %1
%9 = call i32 @normal(i32 %8)
%10 = call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([18 x i8], [18 x i8]* @str.6, i64 0, i64 0))
%11 = load i32, i32* %1
%12 = call i32 @recursive(i32 %11)
%13 = call i32 @putchar(i32 10)
ret i32 0
}