task_name stringlengths 4 18 | source_code stringlengths 134 74k | x86_64 stringlengths 1.07k 267k | aarch64_linux stringlengths 1.23k 271k | riscv64 stringlengths 1.42k 272k | aarch64_apple stringlengths 992 267k |
|---|---|---|---|---|---|
ackermann | /* Ackermann.c: calculate the Ackermann function (as far as that is possible),
* and discuss its properties.
Compile: cc -o ackermann ackermann.c
( Use the flag -D_SHORT_STRINGS if your compiler cannot handle multiline
strings.)
For usage information, give the command ackermann -h or see USAGE defined
below.
Author: Terry R. McConnell
trmcconn@syr.edu
Ackermann's function a(x,y) is defined by the following double
recursion:
a(x,0) = x + 1
a(0,y) = a(1,y-1)
a(x+1,y+1) = a(a(x,y+1),y).
The significance of this function is that it can be proved to be a recursive
function of two variables. Thus, in particular, a(x,x) is recursive. But it
can also be shown that a(x,x) is not primitive recursive. (The difference
between recursive and primitive recursive is that computation of a recursive
function may, in general, involve a finite but unbounded search for a solution
to an equation involving recursive functions. In the case of primitive
recursive functions there must be an a priori primitive recursive upper bound
on the number of steps in the search.)
Ackermann's function grows so quickly, especially in the y variable, that it
is completely infeasible to calculate it for more than a few small values of
y. For example, things really begin to blow up in the calculation of a(1,4).
At the outset, it is not even clear that the above equations define a function,
i.e., that the recursions will ever end. Let us begin by proving by induction
that this will indeed occur. We induct on y, and then on x for each fixed y.
(This is typical of arguments involving a.) The case y = 0 is obvious, so
we assume the following outer inductive hypothesis:
(i) The recursive depth calculating a(x,y) is finite, for every x.
(By recursive depth, we mean the total number of times "a" must be written
in successive applications of the 3 rules until a call with y = 0 occurs.)
We wish to show: the recursive depth calculating a(x,y+1) is finite for every
x. This we do by induction on x. If x = 0, then a(x,y+1) = a(1,y), and the
result follows by inductive hypothesis (i). Let us now make inductive
hypothesis (ii):
(ii) The recursive depth calculating a(x,y+1) is finite, for a given x.
There remains to show: the recursive depth calculating a(x+1,y+1) is finite.
Now a(x+1,y+1) = a(a(x,y+1),y). By (ii), a(x,y+1) is computable. Call its value
N. Then a(N,y) is computable by (i), since (i) holds for every x, in particular
for x = N.
Exercise 3.33, beginning on page 146 of Elliott Mendelson, An Introduction
to Mathematical Logic, 3rd Edition, Wadworth & Brooks/Cole, Monterey CA, 1897,
attempts to lead the reader through proofs of the main results about a(x,y).
Unfortunately, I cannot make sense out of the first several steps, though
the upshot, in part (j), seems reasonable. Part (k - IV), showing that
a is recursive, seems impossibly difficult given the tools available. Better
to wait and do exercise 5.40 after having studied Turing machines. The
last two parts showing that a(x,x)+1 is not primitive recursive are doable
and instructive using what has gone before.
Let us conclude this discussion by giving an idea of how one proves a(x,x)
is not primitive recursive. For simplicity, we deal only with functions of
one variable. The idea is to show that for any fixed primitive recursive
function f there is an integer m = m(f) such that f(x) <= a(x,m). To show
this, it suffices to prove it directly for the base functions (successor,
etc,) and to show that this property is preserved under substitution and
recursion. For example, suppose f is defined by the following particularly
simple type of recursion:
f(0) = 0, f(y+1) = h(f(y)),
for some primitive recursive h. We suppose m is such that h(x) < a(x,m) for
all x and show that f inherits this property with a different m. Indeed, take
M = m+1. Show by induction on y that f(y) <= a(y,M). This is obvious for
y = 0. Thus it suffices to show that f(y) <= a(y,M) -> f(y+1) <= a(y+1,M).
Lemma (i) a(x,y) > x
(ii) a(x,y) is increasing in x for each y.
Assuming this, we have f(y+1) = h(f(y)) <= a(f(y),m) <= a(a(y,M),m) (by (ii)
and inductive hypothesis) = a(a(y,M),M-1) = a(y+1,M).
We prove (i) by induction on y. For y = 0 it reduces to x+1 > x. Thus suppose
a(x,y) > x for all x. To show a(x,y+1) > x. First note that a(0,y+1) =
a(1,y) > 1 > 0 by inductive hypothesis. Now, if x > 1, a(x,y+1) =
a(a(x-1,y+1),y) > a(x-1,y+1), again by inductive hypothesis. Iterating this,
a(x,y+1) > a(x-1,y+1) > a(x-2,y+1) > ... > a(0,y+1) > 1. The result follows
since there are x inequalities and each one is strict.
For (ii), we prove a(x,y) < a(x+1,y) by induction on y. For y = 0 it
reduces to x+1 < x+2. Suppose a(x,y) < a(x+1,y). We must show a(x,y+1) <
a(x+1,y+1). But a(x+1,y+1) = a(a(x,y+1),y) > a(x,y+1) by (i).
Finally, suppose a(x,x)+1 were primitive recursive. Then for some m we
would have a(x,x) + 1 < a(x,m). But this is contradiction when x = m.
*/
#include "libmin.h"
#define AMAX 5 /* largest arguments to contemplate. This is waaaaaaaaaay more than sufficient! */
/* Play around with these definitions. Can you get a(1,4)? */
#define MAX_X 0xFFFF /* rows in storage array */
#define MAX_Y 0x10 /* columns in storage array */
#define MAX_DEPTH 0xffFFFF /* stack guard */
static unsigned a[MAX_X][MAX_Y]; /* Remembered values */
static unsigned depth;
static unsigned max_depth;
/* Implement Ackermann function as recursive function that remembers its values */
unsigned
ack(unsigned x, unsigned y)
{
depth++;
if (depth > MAX_DEPTH)
{
libmin_printf("Maximum stack depth %d exceeded. Abort.\n", MAX_DEPTH);
libmin_fail(1);
}
if (x >= MAX_X)
{
libmin_printf("Maximum x value %d exceeded. Abort. \n", MAX_X);
libmin_fail(1);
}
if (y >= MAX_Y)
{
libmin_printf("Maximum y value %d exceeded. Abort. \n", MAX_Y);
libmin_fail(1);
}
if (a[x][y])
return a[x][y];
if (y==0)
return a[x][0] = x+1;
if (x==0)
return a[0][y] = ack(1,y-1);
return a[x][y] = ack(ack(x-1,y),y-1);
}
int
main(void)
{
unsigned y,k;
max_depth = 0;
for(k=0;k<=AMAX;k++)
{
libmin_printf("\nx+y=%d:\n\n",k);
for(y=0;y<=k;y++)
{
depth = 0; /* stack guard */
libmin_printf("A(%d,%d) = %d\n",k-y,y,ack(k-y,y));
if (depth > max_depth)
max_depth = depth;
}
}
libmin_printf("Max recursive depth = %u\n", max_depth);
libmin_success();
return 0;
}
| .text
.intel_syntax noprefix
.file "ackermann.c"
.globl ack # -- Begin function ack
.p2align 4, 0x90
.type ack,@function
ack: # @ack
.cfi_startproc
# %bb.0:
push rbp
.cfi_def_cfa_offset 16
.cfi_offset rbp, -16
mov rbp, rsp
.cfi_def_cfa_register rbp
sub rsp, 16
mov dword ptr [rbp - 8], edi
mov dword ptr [rbp - 12], esi
mov eax, dword ptr [rip + depth]
add eax, 1
mov dword ptr [rip + depth], eax
cmp dword ptr [rip + depth], 16777215
jbe .LBB0_2
# %bb.1:
lea rdi, [rip + .L.str]
mov esi, 16777215
mov al, 0
call libmin_printf@PLT
mov edi, 1
call libmin_fail@PLT
.LBB0_2:
cmp dword ptr [rbp - 8], 65535
jb .LBB0_4
# %bb.3:
lea rdi, [rip + .L.str.1]
mov esi, 65535
mov al, 0
call libmin_printf@PLT
mov edi, 1
call libmin_fail@PLT
.LBB0_4:
cmp dword ptr [rbp - 12], 16
jb .LBB0_6
# %bb.5:
lea rdi, [rip + .L.str.2]
mov esi, 16
mov al, 0
call libmin_printf@PLT
mov edi, 1
call libmin_fail@PLT
.LBB0_6:
mov eax, dword ptr [rbp - 8]
mov ecx, eax
lea rax, [rip + a]
shl rcx, 6
add rax, rcx
mov ecx, dword ptr [rbp - 12]
# kill: def $rcx killed $ecx
cmp dword ptr [rax + 4*rcx], 0
je .LBB0_8
# %bb.7:
mov eax, dword ptr [rbp - 8]
mov ecx, eax
lea rax, [rip + a]
shl rcx, 6
add rax, rcx
mov ecx, dword ptr [rbp - 12]
# kill: def $rcx killed $ecx
mov eax, dword ptr [rax + 4*rcx]
mov dword ptr [rbp - 4], eax
jmp .LBB0_13
.LBB0_8:
cmp dword ptr [rbp - 12], 0
jne .LBB0_10
# %bb.9:
mov eax, dword ptr [rbp - 8]
add eax, 1
mov ecx, dword ptr [rbp - 8]
mov edx, ecx
lea rcx, [rip + a]
shl rdx, 6
add rcx, rdx
mov dword ptr [rcx], eax
mov dword ptr [rbp - 4], eax
jmp .LBB0_13
.LBB0_10:
cmp dword ptr [rbp - 8], 0
jne .LBB0_12
# %bb.11:
mov esi, dword ptr [rbp - 12]
sub esi, 1
mov edi, 1
call ack
mov ecx, dword ptr [rbp - 12]
mov edx, ecx
lea rcx, [rip + a]
mov dword ptr [rcx + 4*rdx], eax
mov dword ptr [rbp - 4], eax
jmp .LBB0_13
.LBB0_12:
mov edi, dword ptr [rbp - 8]
sub edi, 1
mov esi, dword ptr [rbp - 12]
call ack
mov edi, eax
mov esi, dword ptr [rbp - 12]
sub esi, 1
call ack
mov ecx, dword ptr [rbp - 8]
mov edx, ecx
lea rcx, [rip + a]
shl rdx, 6
add rcx, rdx
mov edx, dword ptr [rbp - 12]
# kill: def $rdx killed $edx
mov dword ptr [rcx + 4*rdx], eax
mov dword ptr [rbp - 4], eax
.LBB0_13:
mov eax, dword ptr [rbp - 4]
add rsp, 16
pop rbp
.cfi_def_cfa rsp, 8
ret
.Lfunc_end0:
.size ack, .Lfunc_end0-ack
.cfi_endproc
# -- End function
.globl main # -- Begin function main
.p2align 4, 0x90
.type main,@function
main: # @main
.cfi_startproc
# %bb.0:
push rbp
.cfi_def_cfa_offset 16
.cfi_offset rbp, -16
mov rbp, rsp
.cfi_def_cfa_register rbp
sub rsp, 32
mov dword ptr [rbp - 4], 0
mov dword ptr [rip + max_depth], 0
mov dword ptr [rbp - 12], 0
.LBB1_1: # =>This Loop Header: Depth=1
# Child Loop BB1_3 Depth 2
cmp dword ptr [rbp - 12], 5
ja .LBB1_10
# %bb.2: # in Loop: Header=BB1_1 Depth=1
mov esi, dword ptr [rbp - 12]
lea rdi, [rip + .L.str.3]
mov al, 0
call libmin_printf@PLT
mov dword ptr [rbp - 8], 0
.LBB1_3: # Parent Loop BB1_1 Depth=1
# => This Inner Loop Header: Depth=2
mov eax, dword ptr [rbp - 8]
cmp eax, dword ptr [rbp - 12]
ja .LBB1_8
# %bb.4: # in Loop: Header=BB1_3 Depth=2
mov dword ptr [rip + depth], 0
mov eax, dword ptr [rbp - 12]
sub eax, dword ptr [rbp - 8]
mov dword ptr [rbp - 20], eax # 4-byte Spill
mov eax, dword ptr [rbp - 8]
mov dword ptr [rbp - 16], eax # 4-byte Spill
mov edi, dword ptr [rbp - 12]
sub edi, dword ptr [rbp - 8]
mov esi, dword ptr [rbp - 8]
call ack
mov esi, dword ptr [rbp - 20] # 4-byte Reload
mov edx, dword ptr [rbp - 16] # 4-byte Reload
mov ecx, eax
lea rdi, [rip + .L.str.4]
mov al, 0
call libmin_printf@PLT
mov eax, dword ptr [rip + depth]
cmp eax, dword ptr [rip + max_depth]
jbe .LBB1_6
# %bb.5: # in Loop: Header=BB1_3 Depth=2
mov eax, dword ptr [rip + depth]
mov dword ptr [rip + max_depth], eax
.LBB1_6: # in Loop: Header=BB1_3 Depth=2
jmp .LBB1_7
.LBB1_7: # in Loop: Header=BB1_3 Depth=2
mov eax, dword ptr [rbp - 8]
add eax, 1
mov dword ptr [rbp - 8], eax
jmp .LBB1_3
.LBB1_8: # in Loop: Header=BB1_1 Depth=1
jmp .LBB1_9
.LBB1_9: # in Loop: Header=BB1_1 Depth=1
mov eax, dword ptr [rbp - 12]
add eax, 1
mov dword ptr [rbp - 12], eax
jmp .LBB1_1
.LBB1_10:
mov esi, dword ptr [rip + max_depth]
lea rdi, [rip + .L.str.5]
mov al, 0
call libmin_printf@PLT
call libmin_success@PLT
xor eax, eax
add rsp, 32
pop rbp
.cfi_def_cfa rsp, 8
ret
.Lfunc_end1:
.size main, .Lfunc_end1-main
.cfi_endproc
# -- End function
.type depth,@object # @depth
.local depth
.comm depth,4,4
.type .L.str,@object # @.str
.section .rodata.str1.1,"aMS",@progbits,1
.L.str:
.asciz "Maximum stack depth %d exceeded. Abort.\n"
.size .L.str, 41
.type .L.str.1,@object # @.str.1
.L.str.1:
.asciz "Maximum x value %d exceeded. Abort. \n"
.size .L.str.1, 38
.type .L.str.2,@object # @.str.2
.L.str.2:
.asciz "Maximum y value %d exceeded. Abort. \n"
.size .L.str.2, 38
.type a,@object # @a
.local a
.comm a,4194240,16
.type max_depth,@object # @max_depth
.local max_depth
.comm max_depth,4,4
.type .L.str.3,@object # @.str.3
.L.str.3:
.asciz "\nx+y=%d:\n\n"
.size .L.str.3, 11
.type .L.str.4,@object # @.str.4
.L.str.4:
.asciz "A(%d,%d) = %d\n"
.size .L.str.4, 15
.type .L.str.5,@object # @.str.5
.L.str.5:
.asciz "Max recursive depth = %u\n"
.size .L.str.5, 26
.ident "Ubuntu clang version 17.0.6 (9ubuntu1)"
.section ".note.GNU-stack","",@progbits
.addrsig
.addrsig_sym ack
.addrsig_sym libmin_printf
.addrsig_sym libmin_fail
.addrsig_sym libmin_success
.addrsig_sym depth
.addrsig_sym a
.addrsig_sym max_depth
| .text
.file "ackermann.c"
.globl ack // -- Begin function ack
.p2align 2
.type ack,@function
ack: // @ack
.cfi_startproc
// %bb.0:
sub sp, sp, #32
.cfi_def_cfa_offset 32
stp x29, x30, [sp, #16] // 16-byte Folded Spill
add x29, sp, #16
.cfi_def_cfa w29, 16
.cfi_offset w30, -8
.cfi_offset w29, -16
str w0, [sp, #8]
str w1, [sp, #4]
adrp x8, depth
ldr w9, [x8, :lo12:depth]
add w9, w9, #1
str w9, [x8, :lo12:depth]
ldr w8, [x8, :lo12:depth]
mov w9, #16777215 // =0xffffff
subs w8, w8, w9
cset w8, ls
tbnz w8, #0, .LBB0_2
b .LBB0_1
.LBB0_1:
adrp x0, .L.str
add x0, x0, :lo12:.L.str
mov w1, #16777215 // =0xffffff
bl libmin_printf
mov w0, #1 // =0x1
bl libmin_fail
b .LBB0_2
.LBB0_2:
ldr w8, [sp, #8]
mov w9, #65535 // =0xffff
subs w8, w8, w9
cset w8, lo
tbnz w8, #0, .LBB0_4
b .LBB0_3
.LBB0_3:
adrp x0, .L.str.1
add x0, x0, :lo12:.L.str.1
mov w1, #65535 // =0xffff
bl libmin_printf
mov w0, #1 // =0x1
bl libmin_fail
b .LBB0_4
.LBB0_4:
ldr w8, [sp, #4]
subs w8, w8, #16
cset w8, lo
tbnz w8, #0, .LBB0_6
b .LBB0_5
.LBB0_5:
adrp x0, .L.str.2
add x0, x0, :lo12:.L.str.2
mov w1, #16 // =0x10
bl libmin_printf
mov w0, #1 // =0x1
bl libmin_fail
b .LBB0_6
.LBB0_6:
ldr w8, [sp, #8]
mov w9, w8
adrp x8, a
add x8, x8, :lo12:a
add x8, x8, x9, lsl #6
ldr w9, [sp, #4]
// kill: def $x9 killed $w9
ldr w8, [x8, x9, lsl #2]
subs w8, w8, #0
cset w8, eq
tbnz w8, #0, .LBB0_8
b .LBB0_7
.LBB0_7:
ldr w8, [sp, #8]
mov w9, w8
adrp x8, a
add x8, x8, :lo12:a
add x8, x8, x9, lsl #6
ldr w9, [sp, #4]
// kill: def $x9 killed $w9
ldr w8, [x8, x9, lsl #2]
stur w8, [x29, #-4]
b .LBB0_13
.LBB0_8:
ldr w8, [sp, #4]
subs w8, w8, #0
cset w8, ne
tbnz w8, #0, .LBB0_10
b .LBB0_9
.LBB0_9:
ldr w8, [sp, #8]
add w8, w8, #1
ldr w9, [sp, #8]
// kill: def $x9 killed $w9
lsl x10, x9, #6
adrp x9, a
add x9, x9, :lo12:a
str w8, [x9, x10]
stur w8, [x29, #-4]
b .LBB0_13
.LBB0_10:
ldr w8, [sp, #8]
subs w8, w8, #0
cset w8, ne
tbnz w8, #0, .LBB0_12
b .LBB0_11
.LBB0_11:
ldr w8, [sp, #4]
mov w0, #1 // =0x1
subs w1, w8, #1
bl ack
ldr w8, [sp, #4]
mov w9, w8
adrp x8, a
add x8, x8, :lo12:a
str w0, [x8, x9, lsl #2]
stur w0, [x29, #-4]
b .LBB0_13
.LBB0_12:
ldr w8, [sp, #8]
subs w0, w8, #1
ldr w1, [sp, #4]
bl ack
ldr w8, [sp, #4]
subs w1, w8, #1
bl ack
ldr w8, [sp, #8]
mov w9, w8
adrp x8, a
add x8, x8, :lo12:a
add x8, x8, x9, lsl #6
ldr w9, [sp, #4]
// kill: def $x9 killed $w9
str w0, [x8, x9, lsl #2]
stur w0, [x29, #-4]
b .LBB0_13
.LBB0_13:
ldur w0, [x29, #-4]
.cfi_def_cfa wsp, 32
ldp x29, x30, [sp, #16] // 16-byte Folded Reload
add sp, sp, #32
.cfi_def_cfa_offset 0
.cfi_restore w30
.cfi_restore w29
ret
.Lfunc_end0:
.size ack, .Lfunc_end0-ack
.cfi_endproc
// -- End function
.globl main // -- Begin function main
.p2align 2
.type main,@function
main: // @main
.cfi_startproc
// %bb.0:
sub sp, sp, #48
.cfi_def_cfa_offset 48
stp x29, x30, [sp, #32] // 16-byte Folded Spill
add x29, sp, #32
.cfi_def_cfa w29, 16
.cfi_offset w30, -8
.cfi_offset w29, -16
stur wzr, [x29, #-4]
adrp x8, max_depth
str wzr, [x8, :lo12:max_depth]
stur wzr, [x29, #-12]
b .LBB1_1
.LBB1_1: // =>This Loop Header: Depth=1
// Child Loop BB1_3 Depth 2
ldur w8, [x29, #-12]
subs w8, w8, #5
cset w8, hi
tbnz w8, #0, .LBB1_10
b .LBB1_2
.LBB1_2: // in Loop: Header=BB1_1 Depth=1
ldur w1, [x29, #-12]
adrp x0, .L.str.3
add x0, x0, :lo12:.L.str.3
bl libmin_printf
stur wzr, [x29, #-8]
b .LBB1_3
.LBB1_3: // Parent Loop BB1_1 Depth=1
// => This Inner Loop Header: Depth=2
ldur w8, [x29, #-8]
ldur w9, [x29, #-12]
subs w8, w8, w9
cset w8, hi
tbnz w8, #0, .LBB1_8
b .LBB1_4
.LBB1_4: // in Loop: Header=BB1_3 Depth=2
adrp x8, depth
str x8, [sp, #8] // 8-byte Folded Spill
str wzr, [x8, :lo12:depth]
ldur w8, [x29, #-12]
ldur w9, [x29, #-8]
subs w8, w8, w9
str w8, [sp] // 4-byte Folded Spill
ldur w8, [x29, #-8]
str w8, [sp, #4] // 4-byte Folded Spill
ldur w8, [x29, #-12]
ldur w9, [x29, #-8]
subs w0, w8, w9
ldur w1, [x29, #-8]
bl ack
ldr w1, [sp] // 4-byte Folded Reload
ldr w2, [sp, #4] // 4-byte Folded Reload
mov w3, w0
adrp x0, .L.str.4
add x0, x0, :lo12:.L.str.4
bl libmin_printf
ldr x8, [sp, #8] // 8-byte Folded Reload
ldr w8, [x8, :lo12:depth]
adrp x9, max_depth
ldr w9, [x9, :lo12:max_depth]
subs w8, w8, w9
cset w8, ls
tbnz w8, #0, .LBB1_6
b .LBB1_5
.LBB1_5: // in Loop: Header=BB1_3 Depth=2
adrp x8, depth
ldr w8, [x8, :lo12:depth]
adrp x9, max_depth
str w8, [x9, :lo12:max_depth]
b .LBB1_6
.LBB1_6: // in Loop: Header=BB1_3 Depth=2
b .LBB1_7
.LBB1_7: // in Loop: Header=BB1_3 Depth=2
ldur w8, [x29, #-8]
add w8, w8, #1
stur w8, [x29, #-8]
b .LBB1_3
.LBB1_8: // in Loop: Header=BB1_1 Depth=1
b .LBB1_9
.LBB1_9: // in Loop: Header=BB1_1 Depth=1
ldur w8, [x29, #-12]
add w8, w8, #1
stur w8, [x29, #-12]
b .LBB1_1
.LBB1_10:
adrp x8, max_depth
ldr w1, [x8, :lo12:max_depth]
adrp x0, .L.str.5
add x0, x0, :lo12:.L.str.5
bl libmin_printf
bl libmin_success
mov w0, wzr
.cfi_def_cfa wsp, 48
ldp x29, x30, [sp, #32] // 16-byte Folded Reload
add sp, sp, #48
.cfi_def_cfa_offset 0
.cfi_restore w30
.cfi_restore w29
ret
.Lfunc_end1:
.size main, .Lfunc_end1-main
.cfi_endproc
// -- End function
.type depth,@object // @depth
.local depth
.comm depth,4,4
.type .L.str,@object // @.str
.section .rodata.str1.1,"aMS",@progbits,1
.L.str:
.asciz "Maximum stack depth %d exceeded. Abort.\n"
.size .L.str, 41
.type .L.str.1,@object // @.str.1
.L.str.1:
.asciz "Maximum x value %d exceeded. Abort. \n"
.size .L.str.1, 38
.type .L.str.2,@object // @.str.2
.L.str.2:
.asciz "Maximum y value %d exceeded. Abort. \n"
.size .L.str.2, 38
.type a,@object // @a
.local a
.comm a,4194240,4
.type max_depth,@object // @max_depth
.local max_depth
.comm max_depth,4,4
.type .L.str.3,@object // @.str.3
.L.str.3:
.asciz "\nx+y=%d:\n\n"
.size .L.str.3, 11
.type .L.str.4,@object // @.str.4
.L.str.4:
.asciz "A(%d,%d) = %d\n"
.size .L.str.4, 15
.type .L.str.5,@object // @.str.5
.L.str.5:
.asciz "Max recursive depth = %u\n"
.size .L.str.5, 26
.ident "Ubuntu clang version 17.0.6 (9ubuntu1)"
.section ".note.GNU-stack","",@progbits
.addrsig
.addrsig_sym ack
.addrsig_sym libmin_printf
.addrsig_sym libmin_fail
.addrsig_sym libmin_success
.addrsig_sym depth
.addrsig_sym a
.addrsig_sym max_depth
| .text
.attribute 4, 16
.attribute 5, "rv64i2p1_m2p0_a2p1_f2p2_d2p2_c2p0_zicsr2p0_zifencei2p0"
.file "ackermann.c"
.globl ack # -- Begin function ack
.p2align 1
.type ack,@function
ack: # @ack
.cfi_startproc
# %bb.0:
addi sp, sp, -32
.cfi_def_cfa_offset 32
sd ra, 24(sp) # 8-byte Folded Spill
sd s0, 16(sp) # 8-byte Folded Spill
.cfi_offset ra, -8
.cfi_offset s0, -16
addi s0, sp, 32
.cfi_def_cfa s0, 0
# kill: def $x12 killed $x11
# kill: def $x12 killed $x10
sw a0, -24(s0)
sw a1, -28(s0)
.Lpcrel_hi0:
auipc a0, %pcrel_hi(depth)
addi a0, a0, %pcrel_lo(.Lpcrel_hi0)
lw a1, 0(a0)
addiw a1, a1, 1
sw a1, 0(a0)
lbu a0, 3(a0)
beqz a0, .LBB0_2
j .LBB0_1
.LBB0_1:
.Lpcrel_hi1:
auipc a0, %pcrel_hi(.L.str)
addi a0, a0, %pcrel_lo(.Lpcrel_hi1)
lui a1, 4096
addiw a1, a1, -1
call libmin_printf@plt
li a0, 1
call libmin_fail@plt
j .LBB0_2
.LBB0_2:
lw a0, -24(s0)
lui a1, 16
addiw a1, a1, -1
bltu a0, a1, .LBB0_4
j .LBB0_3
.LBB0_3:
.Lpcrel_hi2:
auipc a0, %pcrel_hi(.L.str.1)
addi a0, a0, %pcrel_lo(.Lpcrel_hi2)
lui a1, 16
addiw a1, a1, -1
call libmin_printf@plt
li a0, 1
call libmin_fail@plt
j .LBB0_4
.LBB0_4:
lw a0, -28(s0)
li a1, 16
bltu a0, a1, .LBB0_6
j .LBB0_5
.LBB0_5:
.Lpcrel_hi3:
auipc a0, %pcrel_hi(.L.str.2)
addi a0, a0, %pcrel_lo(.Lpcrel_hi3)
li a1, 16
call libmin_printf@plt
li a0, 1
call libmin_fail@plt
j .LBB0_6
.LBB0_6:
lwu a0, -24(s0)
slli a1, a0, 6
.Lpcrel_hi4:
auipc a0, %pcrel_hi(a)
addi a0, a0, %pcrel_lo(.Lpcrel_hi4)
add a0, a0, a1
lwu a1, -28(s0)
slli a1, a1, 2
add a0, a0, a1
lw a0, 0(a0)
beqz a0, .LBB0_8
j .LBB0_7
.LBB0_7:
lwu a0, -24(s0)
slli a1, a0, 6
.Lpcrel_hi5:
auipc a0, %pcrel_hi(a)
addi a0, a0, %pcrel_lo(.Lpcrel_hi5)
add a0, a0, a1
lwu a1, -28(s0)
slli a1, a1, 2
add a0, a0, a1
lw a0, 0(a0)
sw a0, -20(s0)
j .LBB0_13
.LBB0_8:
lw a0, -28(s0)
bnez a0, .LBB0_10
j .LBB0_9
.LBB0_9:
lwu a1, -24(s0)
addiw a0, a1, 1
slli a2, a1, 6
.Lpcrel_hi6:
auipc a1, %pcrel_hi(a)
addi a1, a1, %pcrel_lo(.Lpcrel_hi6)
add a1, a1, a2
sw a0, 0(a1)
sw a0, -20(s0)
j .LBB0_13
.LBB0_10:
lw a0, -24(s0)
bnez a0, .LBB0_12
j .LBB0_11
.LBB0_11:
lw a0, -28(s0)
addiw a1, a0, -1
li a0, 1
call ack
lwu a1, -28(s0)
slli a2, a1, 2
.Lpcrel_hi7:
auipc a1, %pcrel_hi(a)
addi a1, a1, %pcrel_lo(.Lpcrel_hi7)
add a1, a1, a2
sw a0, 0(a1)
sw a0, -20(s0)
j .LBB0_13
.LBB0_12:
lw a0, -24(s0)
addiw a0, a0, -1
lw a1, -28(s0)
call ack
lw a1, -28(s0)
addiw a1, a1, -1
call ack
lwu a1, -24(s0)
slli a2, a1, 6
.Lpcrel_hi8:
auipc a1, %pcrel_hi(a)
addi a1, a1, %pcrel_lo(.Lpcrel_hi8)
add a1, a1, a2
lwu a2, -28(s0)
slli a2, a2, 2
add a1, a1, a2
sw a0, 0(a1)
sw a0, -20(s0)
j .LBB0_13
.LBB0_13:
lw a0, -20(s0)
ld ra, 24(sp) # 8-byte Folded Reload
ld s0, 16(sp) # 8-byte Folded Reload
addi sp, sp, 32
ret
.Lfunc_end0:
.size ack, .Lfunc_end0-ack
.cfi_endproc
# -- End function
.globl main # -- Begin function main
.p2align 1
.type main,@function
main: # @main
.cfi_startproc
# %bb.0:
addi sp, sp, -64
.cfi_def_cfa_offset 64
sd ra, 56(sp) # 8-byte Folded Spill
sd s0, 48(sp) # 8-byte Folded Spill
.cfi_offset ra, -8
.cfi_offset s0, -16
addi s0, sp, 64
.cfi_def_cfa s0, 0
li a0, 0
sw a0, -20(s0)
.Lpcrel_hi9:
auipc a1, %pcrel_hi(max_depth)
addi a1, a1, %pcrel_lo(.Lpcrel_hi9)
sw a0, 0(a1)
sw a0, -28(s0)
j .LBB1_1
.LBB1_1: # =>This Loop Header: Depth=1
# Child Loop BB1_3 Depth 2
lw a1, -28(s0)
li a0, 5
bltu a0, a1, .LBB1_10
j .LBB1_2
.LBB1_2: # in Loop: Header=BB1_1 Depth=1
lw a1, -28(s0)
.Lpcrel_hi10:
auipc a0, %pcrel_hi(.L.str.3)
addi a0, a0, %pcrel_lo(.Lpcrel_hi10)
call libmin_printf@plt
li a0, 0
sw a0, -24(s0)
j .LBB1_3
.LBB1_3: # Parent Loop BB1_1 Depth=1
# => This Inner Loop Header: Depth=2
lw a1, -24(s0)
lw a0, -28(s0)
bltu a0, a1, .LBB1_8
j .LBB1_4
.LBB1_4: # in Loop: Header=BB1_3 Depth=2
.Lpcrel_hi11:
auipc a0, %pcrel_hi(depth)
addi a1, a0, %pcrel_lo(.Lpcrel_hi11)
sd a1, -40(s0) # 8-byte Folded Spill
li a0, 0
sw a0, 0(a1)
lw a0, -28(s0)
lw a1, -24(s0)
sd a1, -48(s0) # 8-byte Folded Spill
subw a0, a0, a1
sd a0, -56(s0) # 8-byte Folded Spill
call ack
ld a1, -56(s0) # 8-byte Folded Reload
ld a2, -48(s0) # 8-byte Folded Reload
mv a3, a0
.Lpcrel_hi12:
auipc a0, %pcrel_hi(.L.str.4)
addi a0, a0, %pcrel_lo(.Lpcrel_hi12)
call libmin_printf@plt
# kill: def $x11 killed $x10
ld a0, -40(s0) # 8-byte Folded Reload
lw a1, 0(a0)
.Lpcrel_hi13:
auipc a0, %pcrel_hi(max_depth)
addi a0, a0, %pcrel_lo(.Lpcrel_hi13)
lw a0, 0(a0)
bgeu a0, a1, .LBB1_6
j .LBB1_5
.LBB1_5: # in Loop: Header=BB1_3 Depth=2
.Lpcrel_hi14:
auipc a0, %pcrel_hi(depth)
addi a0, a0, %pcrel_lo(.Lpcrel_hi14)
lw a0, 0(a0)
.Lpcrel_hi15:
auipc a1, %pcrel_hi(max_depth)
addi a1, a1, %pcrel_lo(.Lpcrel_hi15)
sw a0, 0(a1)
j .LBB1_6
.LBB1_6: # in Loop: Header=BB1_3 Depth=2
j .LBB1_7
.LBB1_7: # in Loop: Header=BB1_3 Depth=2
lw a0, -24(s0)
addiw a0, a0, 1
sw a0, -24(s0)
j .LBB1_3
.LBB1_8: # in Loop: Header=BB1_1 Depth=1
j .LBB1_9
.LBB1_9: # in Loop: Header=BB1_1 Depth=1
lw a0, -28(s0)
addiw a0, a0, 1
sw a0, -28(s0)
j .LBB1_1
.LBB1_10:
.Lpcrel_hi16:
auipc a0, %pcrel_hi(max_depth)
addi a0, a0, %pcrel_lo(.Lpcrel_hi16)
lw a1, 0(a0)
.Lpcrel_hi17:
auipc a0, %pcrel_hi(.L.str.5)
addi a0, a0, %pcrel_lo(.Lpcrel_hi17)
call libmin_printf@plt
call libmin_success@plt
li a0, 0
ld ra, 56(sp) # 8-byte Folded Reload
ld s0, 48(sp) # 8-byte Folded Reload
addi sp, sp, 64
ret
.Lfunc_end1:
.size main, .Lfunc_end1-main
.cfi_endproc
# -- End function
.type depth,@object # @depth
.section .sbss,"aw",@nobits
.p2align 2
depth:
.word 0 # 0x0
.size depth, 4
.type .L.str,@object # @.str
.section .rodata.str1.1,"aMS",@progbits,1
.L.str:
.asciz "Maximum stack depth %d exceeded. Abort.\n"
.size .L.str, 41
.type .L.str.1,@object # @.str.1
.L.str.1:
.asciz "Maximum x value %d exceeded. Abort. \n"
.size .L.str.1, 38
.type .L.str.2,@object # @.str.2
.L.str.2:
.asciz "Maximum y value %d exceeded. Abort. \n"
.size .L.str.2, 38
.type a,@object # @a
.local a
.comm a,4194240,4
.type max_depth,@object # @max_depth
.section .sbss,"aw",@nobits
.p2align 2
max_depth:
.word 0 # 0x0
.size max_depth, 4
.type .L.str.3,@object # @.str.3
.section .rodata.str1.1,"aMS",@progbits,1
.L.str.3:
.asciz "\nx+y=%d:\n\n"
.size .L.str.3, 11
.type .L.str.4,@object # @.str.4
.L.str.4:
.asciz "A(%d,%d) = %d\n"
.size .L.str.4, 15
.type .L.str.5,@object # @.str.5
.L.str.5:
.asciz "Max recursive depth = %u\n"
.size .L.str.5, 26
.ident "Ubuntu clang version 17.0.6 (9ubuntu1)"
.section ".note.GNU-stack","",@progbits
.addrsig
.addrsig_sym ack
.addrsig_sym libmin_printf
.addrsig_sym libmin_fail
.addrsig_sym libmin_success
.addrsig_sym depth
.addrsig_sym a
.addrsig_sym max_depth
| .section __TEXT,__text,regular,pure_instructions
.build_version macos, 16, 0
.globl _ack ; -- Begin function ack
.p2align 2
_ack: ; @ack
.cfi_startproc
; %bb.0:
sub sp, sp, #48
stp x29, x30, [sp, #32] ; 16-byte Folded Spill
add x29, sp, #32
.cfi_def_cfa w29, 16
.cfi_offset w30, -8
.cfi_offset w29, -16
stur w0, [x29, #-8]
stur w1, [x29, #-12]
adrp x8, _depth@PAGE
ldr w9, [x8, _depth@PAGEOFF]
add w9, w9, #1
str w9, [x8, _depth@PAGEOFF]
ldr w8, [x8, _depth@PAGEOFF]
mov w9, #16777215 ; =0xffffff
subs w8, w8, w9
cset w8, ls
tbnz w8, #0, LBB0_2
b LBB0_1
LBB0_1:
mov x9, sp
mov x8, #16777215 ; =0xffffff
str x8, [x9]
adrp x0, l_.str@PAGE
add x0, x0, l_.str@PAGEOFF
bl _libmin_printf
mov w0, #1 ; =0x1
bl _libmin_fail
b LBB0_2
LBB0_2:
ldur w8, [x29, #-8]
mov w9, #65535 ; =0xffff
subs w8, w8, w9
cset w8, lo
tbnz w8, #0, LBB0_4
b LBB0_3
LBB0_3:
mov x9, sp
mov x8, #65535 ; =0xffff
str x8, [x9]
adrp x0, l_.str.1@PAGE
add x0, x0, l_.str.1@PAGEOFF
bl _libmin_printf
mov w0, #1 ; =0x1
bl _libmin_fail
b LBB0_4
LBB0_4:
ldur w8, [x29, #-12]
subs w8, w8, #16
cset w8, lo
tbnz w8, #0, LBB0_6
b LBB0_5
LBB0_5:
mov x9, sp
mov x8, #16 ; =0x10
str x8, [x9]
adrp x0, l_.str.2@PAGE
add x0, x0, l_.str.2@PAGEOFF
bl _libmin_printf
mov w0, #1 ; =0x1
bl _libmin_fail
b LBB0_6
LBB0_6:
ldur w8, [x29, #-8]
mov x9, x8
adrp x8, _a@PAGE
add x8, x8, _a@PAGEOFF
add x8, x8, x9, lsl #6
ldur w9, [x29, #-12]
; kill: def $x9 killed $w9
ldr w8, [x8, x9, lsl #2]
subs w8, w8, #0
cset w8, eq
tbnz w8, #0, LBB0_8
b LBB0_7
LBB0_7:
ldur w8, [x29, #-8]
mov x9, x8
adrp x8, _a@PAGE
add x8, x8, _a@PAGEOFF
add x8, x8, x9, lsl #6
ldur w9, [x29, #-12]
; kill: def $x9 killed $w9
ldr w8, [x8, x9, lsl #2]
stur w8, [x29, #-4]
b LBB0_13
LBB0_8:
ldur w8, [x29, #-12]
subs w8, w8, #0
cset w8, ne
tbnz w8, #0, LBB0_10
b LBB0_9
LBB0_9:
ldur w8, [x29, #-8]
add w8, w8, #1
ldur w9, [x29, #-8]
; kill: def $x9 killed $w9
lsl x10, x9, #6
adrp x9, _a@PAGE
add x9, x9, _a@PAGEOFF
str w8, [x9, x10]
stur w8, [x29, #-4]
b LBB0_13
LBB0_10:
ldur w8, [x29, #-8]
subs w8, w8, #0
cset w8, ne
tbnz w8, #0, LBB0_12
b LBB0_11
LBB0_11:
ldur w8, [x29, #-12]
mov w0, #1 ; =0x1
subs w1, w8, #1
bl _ack
ldur w8, [x29, #-12]
mov x9, x8
adrp x8, _a@PAGE
add x8, x8, _a@PAGEOFF
str w0, [x8, x9, lsl #2]
stur w0, [x29, #-4]
b LBB0_13
LBB0_12:
ldur w8, [x29, #-8]
subs w0, w8, #1
ldur w1, [x29, #-12]
bl _ack
ldur w8, [x29, #-12]
subs w1, w8, #1
bl _ack
ldur w8, [x29, #-8]
mov x9, x8
adrp x8, _a@PAGE
add x8, x8, _a@PAGEOFF
add x8, x8, x9, lsl #6
ldur w9, [x29, #-12]
; kill: def $x9 killed $w9
str w0, [x8, x9, lsl #2]
stur w0, [x29, #-4]
b LBB0_13
LBB0_13:
ldur w0, [x29, #-4]
ldp x29, x30, [sp, #32] ; 16-byte Folded Reload
add sp, sp, #48
ret
.cfi_endproc
; -- End function
.globl _main ; -- Begin function main
.p2align 2
_main: ; @main
.cfi_startproc
; %bb.0:
sub sp, sp, #80
stp x29, x30, [sp, #64] ; 16-byte Folded Spill
add x29, sp, #64
.cfi_def_cfa w29, 16
.cfi_offset w30, -8
.cfi_offset w29, -16
stur wzr, [x29, #-4]
adrp x8, _max_depth@PAGE
str wzr, [x8, _max_depth@PAGEOFF]
stur wzr, [x29, #-12]
b LBB1_1
LBB1_1: ; =>This Loop Header: Depth=1
; Child Loop BB1_3 Depth 2
ldur w8, [x29, #-12]
subs w8, w8, #5
cset w8, hi
tbnz w8, #0, LBB1_10
b LBB1_2
LBB1_2: ; in Loop: Header=BB1_1 Depth=1
ldur w9, [x29, #-12]
; implicit-def: $x8
mov x8, x9
mov x9, sp
str x8, [x9]
adrp x0, l_.str.3@PAGE
add x0, x0, l_.str.3@PAGEOFF
bl _libmin_printf
stur wzr, [x29, #-8]
b LBB1_3
LBB1_3: ; Parent Loop BB1_1 Depth=1
; => This Inner Loop Header: Depth=2
ldur w8, [x29, #-8]
ldur w9, [x29, #-12]
subs w8, w8, w9
cset w8, hi
tbnz w8, #0, LBB1_8
b LBB1_4
LBB1_4: ; in Loop: Header=BB1_3 Depth=2
adrp x8, _depth@PAGE
stur x8, [x29, #-24] ; 8-byte Folded Spill
str wzr, [x8, _depth@PAGEOFF]
ldur w8, [x29, #-12]
ldur w9, [x29, #-8]
subs w8, w8, w9
str w8, [sp, #28] ; 4-byte Folded Spill
ldur w9, [x29, #-8]
; implicit-def: $x8
mov x8, x9
str x8, [sp, #32] ; 8-byte Folded Spill
ldur w8, [x29, #-12]
ldur w9, [x29, #-8]
subs w0, w8, w9
ldur w1, [x29, #-8]
bl _ack
ldr w11, [sp, #28] ; 4-byte Folded Reload
ldr x8, [sp, #32] ; 8-byte Folded Reload
mov x9, sp
; implicit-def: $x10
mov x10, x11
str x10, [x9]
str x8, [x9, #8]
; implicit-def: $x8
mov x8, x0
str x8, [x9, #16]
adrp x0, l_.str.4@PAGE
add x0, x0, l_.str.4@PAGEOFF
bl _libmin_printf
ldur x8, [x29, #-24] ; 8-byte Folded Reload
ldr w8, [x8, _depth@PAGEOFF]
adrp x9, _max_depth@PAGE
ldr w9, [x9, _max_depth@PAGEOFF]
subs w8, w8, w9
cset w8, ls
tbnz w8, #0, LBB1_6
b LBB1_5
LBB1_5: ; in Loop: Header=BB1_3 Depth=2
adrp x8, _depth@PAGE
ldr w8, [x8, _depth@PAGEOFF]
adrp x9, _max_depth@PAGE
str w8, [x9, _max_depth@PAGEOFF]
b LBB1_6
LBB1_6: ; in Loop: Header=BB1_3 Depth=2
b LBB1_7
LBB1_7: ; in Loop: Header=BB1_3 Depth=2
ldur w8, [x29, #-8]
add w8, w8, #1
stur w8, [x29, #-8]
b LBB1_3
LBB1_8: ; in Loop: Header=BB1_1 Depth=1
b LBB1_9
LBB1_9: ; in Loop: Header=BB1_1 Depth=1
ldur w8, [x29, #-12]
add w8, w8, #1
stur w8, [x29, #-12]
b LBB1_1
LBB1_10:
adrp x8, _max_depth@PAGE
ldr w9, [x8, _max_depth@PAGEOFF]
; implicit-def: $x8
mov x8, x9
mov x9, sp
str x8, [x9]
adrp x0, l_.str.5@PAGE
add x0, x0, l_.str.5@PAGEOFF
bl _libmin_printf
bl _libmin_success
mov w0, #0 ; =0x0
ldp x29, x30, [sp, #64] ; 16-byte Folded Reload
add sp, sp, #80
ret
.cfi_endproc
; -- End function
.zerofill __DATA,__bss,_depth,4,2 ; @depth
.section __TEXT,__cstring,cstring_literals
l_.str: ; @.str
.asciz "Maximum stack depth %d exceeded. Abort.\n"
l_.str.1: ; @.str.1
.asciz "Maximum x value %d exceeded. Abort. \n"
l_.str.2: ; @.str.2
.asciz "Maximum y value %d exceeded. Abort. \n"
.zerofill __DATA,__bss,_a,4194240,2 ; @a
.zerofill __DATA,__bss,_max_depth,4,2 ; @max_depth
l_.str.3: ; @.str.3
.asciz "\nx+y=%d:\n\n"
l_.str.4: ; @.str.4
.asciz "A(%d,%d) = %d\n"
l_.str.5: ; @.str.5
.asciz "Max recursive depth = %u\n"
.subsections_via_symbols
|
anagram | "/*\n * Anagram program by Raymond Chen,\n * inspired by a similar program by Brian Scearce\n *\n (...TRUNCATED) | "\t.text\n\t.intel_syntax noprefix\n\t.file\t\"anagram.c\"\n\t.globl\tFatal (...TRUNCATED) | "\t.text\n\t.file\t\"anagram.c\"\n\t.globl\tFatal // -- Begin function Fat(...TRUNCATED) | "\t.text\n\t.attribute\t4, 16\n\t.attribute\t5, \"rv64i2p1_m2p0_a2p1_f2p2_d2p2_c2p0_zicsr2p0_zifence(...TRUNCATED) | "\t.section\t__TEXT,__text,regular,pure_instructions\n\t.build_version macos, 16, 0\n\t.globl\t_Fata(...TRUNCATED) |
audio-codec | "/**\n * @file\n * @author [sunzhenliang](https://github.com/HiSunzhenliang)\n * @brief A-law algori(...TRUNCATED) | "\t.text\n\t.intel_syntax noprefix\n\t.file\t\"audio-codec.c\"\n\t.globl\tencode (...TRUNCATED) | "\t.text\n\t.file\t\"audio-codec.c\"\n\t.globl\tencode // -- Begin function(...TRUNCATED) | "\t.text\n\t.attribute\t4, 16\n\t.attribute\t5, \"rv64i2p1_m2p0_a2p1_f2p2_d2p2_c2p0_zicsr2p0_zifence(...TRUNCATED) | "\t.section\t__TEXT,__text,regular,pure_instructions\n\t.build_version macos, 16, 0\n\t.globl\t_enco(...TRUNCATED) |
avl-tree | "/* A balanced binary search tree(AVLTree) implementation\n * Written by Coleman\n * Released under (...TRUNCATED) | "\t.text\n\t.intel_syntax noprefix\n\t.file\t\"avl-tree.c\"\n\t.globl\tprintTree (...TRUNCATED) | "\t.text\n\t.file\t\"avl-tree.c\"\n\t.globl\tprintTree // -- Begin function pr(...TRUNCATED) | "\t.text\n\t.attribute\t4, 16\n\t.attribute\t5, \"rv64i2p1_m2p0_a2p1_f2p2_d2p2_c2p0_zicsr2p0_zifence(...TRUNCATED) | "\t.section\t__TEXT,__text,regular,pure_instructions\n\t.build_version macos, 16, 0\n\t.globl\t_prin(...TRUNCATED) |
banner | "/*\n * Copyright (c) 1980, 1993, 1994\n *\tThe Regents of the University of California. All rights(...TRUNCATED) | "\t.text\n\t.intel_syntax noprefix\n\t.file\t\"banner.c\"\n\t.globl\tmain (...TRUNCATED) | "\t.text\n\t.file\t\"banner.c\"\n\t.globl\tmain // -- Begin function main(...TRUNCATED) | "\t.text\n\t.attribute\t4, 16\n\t.attribute\t5, \"rv64i2p1_m2p0_a2p1_f2p2_d2p2_c2p0_zicsr2p0_zifence(...TRUNCATED) | "\t.section\t__TEXT,__text,regular,pure_instructions\n\t.build_version macos, 16, 0\n\t.globl\t_main(...TRUNCATED) |
blake2b | "/**\n * @addtogroup hash Hash algorithms\n * @{\n * @file\n * @author [Daniel Murrow](https://githu(...TRUNCATED) | "\t.text\n\t.intel_syntax noprefix\n\t.file\t\"blake2b.c\"\n\t.globl\tblake2b (...TRUNCATED) | "\t.text\n\t.file\t\"blake2b.c\"\n\t.globl\tblake2b // -- Begin function bla(...TRUNCATED) | "\t.text\n\t.attribute\t4, 16\n\t.attribute\t5, \"rv64i2p1_m2p0_a2p1_f2p2_d2p2_c2p0_zicsr2p0_zifence(...TRUNCATED) | "\t.section\t__TEXT,__text,regular,pure_instructions\n\t.build_version macos, 16, 0\n\t.globl\t_blak(...TRUNCATED) |
bloom-filter | "#include \"libmin.h\"\n#include \"tinybloom.h\"\n\n#define NUM_ITEMS 2048\n#define NUM_BUCKETS NUM_(...TRUNCATED) | "\t.text\n\t.intel_syntax noprefix\n\t.file\t\"bloom-filter.c\"\n\t.globl\tbad_search (...TRUNCATED) | "\t.text\n\t.file\t\"bloom-filter.c\"\n\t.globl\tbad_search // -- Begin functio(...TRUNCATED) | "\t.text\n\t.attribute\t4, 16\n\t.attribute\t5, \"rv64i2p1_m2p0_a2p1_f2p2_d2p2_c2p0_zicsr2p0_zifence(...TRUNCATED) | "\t.section\t__TEXT,__text,regular,pure_instructions\n\t.build_version macos, 16, 0\n\t.globl\t_bad_(...TRUNCATED) |
boyer-moore-search | "/* C Program for Bad Character Heuristic of Boyer\nMoore String Matching Algorithm */\n// SOURCE: h(...TRUNCATED) | "\t.text\n\t.intel_syntax noprefix\n\t.file\t\"boyer-moore-search.c\"\n\t.globl\tbadCharHeuristic (...TRUNCATED) | "\t.text\n\t.file\t\"boyer-moore-search.c\"\n\t.globl\tbadCharHeuristic // -- Begin f(...TRUNCATED) | "\t.text\n\t.attribute\t4, 16\n\t.attribute\t5, \"rv64i2p1_m2p0_a2p1_f2p2_d2p2_c2p0_zicsr2p0_zifence(...TRUNCATED) | "\t.section\t__TEXT,__text,regular,pure_instructions\n\t.build_version macos, 16, 0\n\t.globl\t_badC(...TRUNCATED) |
bubble-sort | "#include \"libmin.h\"\n\n// supported sizes: 256 (default), 512, 1024, 2048\n#define DATASET_SIZE 2(...TRUNCATED) | "\t.text\n\t.intel_syntax noprefix\n\t.file\t\"bubble-sort.c\"\n\t.globl\tprint_data (...TRUNCATED) | "\t.text\n\t.file\t\"bubble-sort.c\"\n\t.globl\tprint_data // -- Begin function(...TRUNCATED) | "\t.text\n\t.attribute\t4, 16\n\t.attribute\t5, \"rv64i2p1_m2p0_a2p1_f2p2_d2p2_c2p0_zicsr2p0_zifence(...TRUNCATED) | "\t.section\t__TEXT,__text,regular,pure_instructions\n\t.build_version macos, 16, 0\n\t.globl\t_prin(...TRUNCATED) |
c-interp | "#include \"libmin.h\"\n#include \"hello-c.h\"\n\nMFILE hello = \n{\n \"hello.c\",\n __hello_sz,\n(...TRUNCATED) | "\t.text\n\t.intel_syntax noprefix\n\t.file\t\"c-interp.c\"\n\t.globl\tnext (...TRUNCATED) | "\t.text\n\t.file\t\"c-interp.c\"\n\t.globl\tnext // -- Begin function ne(...TRUNCATED) | "\t.text\n\t.attribute\t4, 16\n\t.attribute\t5, \"rv64i2p1_m2p0_a2p1_f2p2_d2p2_c2p0_zicsr2p0_zifence(...TRUNCATED) | "\t.section\t__TEXT,__text,regular,pure_instructions\n\t.build_version macos, 16, 0\n\t.globl\t_next(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 16