Problem 208
Robot Walks: closed paths of 70 five-degree arcs.
View problem on Project Euler
Performance comparison
| Metric | Our solution | Best known |
| Time complexity | O(n) | O(n * s) |
| Space complexity | O(n) | O(s) |
| Approach | Flow solution | Path counting DP |
| Verdict | Unknown |
Flow source
# Project Euler 208
# Robot Walks: closed paths of 70 five-degree arcs.
extern {
function calloc(n: i64, size: i64) -> ptr<void>
function free(p: ptr<void>) -> void
}
let mut NUM_VISITED: ptr<i32> = null
let mut MAX_PER: i32 = 0
let mut CACHE: ptr<i64> = null
const UNKNOWN: i64 = 0 - 1
function search(arcs_left: i32, current_arc: i32) -> i64 {
if arcs_left == 0 {
if current_arc != 0 { return 0 }
if NUM_VISITED[0] != NUM_VISITED[1] { return 0 }
if NUM_VISITED[2] != NUM_VISITED[3] { return 0 }
if NUM_VISITED[0] != NUM_VISITED[2] { return 0 }
return 1
}
let idf: i64 = (MAX_PER + 1) as i64
let mut key: i64 = current_arc as i64
let mut i: i32 = 0
while i < 5 {
key = key * idf + (NUM_VISITED[i] as i64)
i = i + 1
}
if CACHE[key] != UNKNOWN {
return CACHE[key]
}
let mut result: i64 = 0
let turn_left: i32 = (current_arc + 1) % 5
if NUM_VISITED[turn_left] < MAX_PER {
NUM_VISITED[turn_left] = NUM_VISITED[turn_left] + 1
result = result + search(arcs_left - 1, turn_left)
NUM_VISITED[turn_left] = NUM_VISITED[turn_left] - 1
}
let turn_right: i32 = (current_arc + 4) % 5
if NUM_VISITED[turn_right] < MAX_PER {
NUM_VISITED[turn_right] = NUM_VISITED[turn_right] + 1
result = result + search(arcs_left - 1, turn_right)
NUM_VISITED[turn_right] = NUM_VISITED[turn_right] - 1
}
CACHE[key] = result
return result
}
function main() -> i32 {
let num_arcs: i32 = 70
MAX_PER = num_arcs / 5
let mut size: i64 = 5
let mut p: i32 = 0
while p < 5 {
size = size * ((MAX_PER + 1) as i64)
p = p + 1
}
CACHE = calloc(size, 8)
NUM_VISITED = calloc(5, 4)
if CACHE == null || NUM_VISITED == null { return 1 }
let mut i: i64 = 0
while i < size {
CACHE[i] = UNKNOWN
i = i + 1
}
printf("%lld\n", search(num_arcs, 0))
free(CACHE)
free(NUM_VISITED)
return 0
}
Generated C
#include <stdint.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* Flow runtime helpers */
typedef struct flow_temp_node { struct flow_temp_node* next; } flow_temp_node;
static flow_temp_node* flow_temp_head = NULL;
static int flow_temp_atexit_set = 0;
__attribute__((unused)) static void flow_temp_free_all(void) {
while (flow_temp_head) {
flow_temp_node* n = flow_temp_head;
flow_temp_head = n->next;
free(n);
}
}
__attribute__((unused)) static void* flow_temp_alloc(size_t nbytes) {
flow_temp_node* node = (flow_temp_node*)malloc(sizeof(flow_temp_node) + nbytes);
if (!node) return NULL;
node->next = flow_temp_head;
flow_temp_head = node;
if (!flow_temp_atexit_set) {
flow_temp_atexit_set = 1;
atexit(flow_temp_free_all);
}
return (void*)(node + 1);
}
#ifndef FLOW_DIAG
#define FLOW_DIAG(msg) fprintf(stderr, "%s", (msg))
#endif
#ifndef FLOW_LOG
#define FLOW_LOG(fmt, ...) printf(fmt, __VA_ARGS__)
#endif
#ifndef FLOW_LOG_EMPTY
#define FLOW_LOG_EMPTY(fmt) printf(fmt)
#endif
static char* flow_strcat(const char* a, const char* b) {
size_t la = strlen(a ? a : ""), lb = strlen(b ? b : "");
char* r = (char*)flow_temp_alloc(la + lb + 1);
if (!r) return NULL;
if (la) memcpy(r, a, la);
if (lb) memcpy(r + la, b, lb);
r[la + lb] = '\0';
return r;
}
#define __flow_in_arr(arr, val) __extension__ ({ \
int _found = 0; \
size_t _n = sizeof(arr)/sizeof((arr)[0]); \
for (size_t _i = 0; _i < _n; _i++) { \
if ((arr)[_i] == (val)) { _found = 1; break; } \
} _found; })
/* Unified fault handler (MISRA #279) — override with -DFLOW_FAULT_HANDLER=fn */
#ifndef FLOW_FAULT_HANDLER
__attribute__((unused)) static inline void flow_fault_handler(const char* msg) {
fprintf(stderr, "flow: %s\n", msg ? msg : "fault");
abort();
#if defined(__GNUC__) || defined(__clang__)
__builtin_unreachable();
#endif
}
#else
#define flow_fault_handler FLOW_FAULT_HANDLER
#endif
#define flow_div_by_zero_handler() flow_fault_handler("division by zero")
#define flow_shift_ub_handler() flow_fault_handler("invalid shift (amount out of range or left-shift of negative)")
#ifndef FLOW_CHECKED_DIV
#define FLOW_CHECKED_DIV(L, R) (((R) != 0) ? ((L) / (R)) : (flow_div_by_zero_handler(), (L) * 0))
#endif
#ifndef FLOW_CHECKED_MOD
#define FLOW_CHECKED_MOD(L, R) (((R) != 0) ? ((L) % (R)) : (flow_div_by_zero_handler(), (L) * 0))
#endif
#ifndef FLOW_CHECKED_SHL
#define FLOW_CHECKED_SHL(L, R) ((((R) >= 0) && ((unsigned long long)(R) < (sizeof(L) * 8ull)) && ((L) >= 0)) ? ((L) << (R)) : (flow_shift_ub_handler(), (L) * 0))
#endif
#ifndef FLOW_CHECKED_SHR
#define FLOW_CHECKED_SHR(L, R) ((((R) >= 0) && ((unsigned long long)(R) < (sizeof(L) * 8ull))) ? ((L) >> (R)) : (flow_shift_ub_handler(), (L) * 0))
#endif
#include <math.h>
void* _ui_state = NULL;
static inline float i32_to_f32(int32_t v) { return (float)v; }
/* Host stub for @gpu kernels (device codegen replaces this). */
static inline int32_t gpu_thread_id(void) { return 0; }
int64_t search_i32_i32(int32_t arcs_left, int32_t current_arc);
int32_t main(void);
static const int64_t UNKNOWN = (0 - 1);
/* Module statics */
static int32_t* NUM_VISITED = NULL;
static int32_t MAX_PER = 0;
static int64_t* CACHE = NULL;
int64_t search_i32_i32(int32_t arcs_left, int32_t current_arc) {
if (arcs_left == 0) {
if (current_arc != 0) {
return 0;
}
if (NUM_VISITED[0] != NUM_VISITED[1]) {
return 0;
}
if (NUM_VISITED[2] != NUM_VISITED[3]) {
return 0;
}
if (NUM_VISITED[0] != NUM_VISITED[2]) {
return 0;
}
return 1;
}
int64_t idf = ((int64_t)((MAX_PER + 1)));
int64_t key = ((int64_t)(current_arc));
int32_t i = 0;
while (i < 5) {
key = ((key * idf) + ((int64_t)(NUM_VISITED[i])));
i = (i + 1);
}
if (CACHE[key] != UNKNOWN) {
return CACHE[key];
}
int64_t result = 0;
int32_t turn_left = FLOW_CHECKED_MOD(((current_arc + 1)), (5));
if (NUM_VISITED[turn_left] < MAX_PER) {
NUM_VISITED[turn_left] = (NUM_VISITED[turn_left] + 1);
result = (result + search_i32_i32((arcs_left - 1), turn_left));
NUM_VISITED[turn_left] = (NUM_VISITED[turn_left] - 1);
}
int32_t turn_right = FLOW_CHECKED_MOD(((current_arc + 4)), (5));
if (NUM_VISITED[turn_right] < MAX_PER) {
NUM_VISITED[turn_right] = (NUM_VISITED[turn_right] + 1);
result = (result + search_i32_i32((arcs_left - 1), turn_right));
NUM_VISITED[turn_right] = (NUM_VISITED[turn_right] - 1);
}
CACHE[key] = result;
return result;
}
int32_t main(void) {
int32_t num_arcs = 70;
MAX_PER = FLOW_CHECKED_DIV((num_arcs), (5));
int64_t size = 5;
int32_t p = 0;
while (p < 5) {
size = (size * ((int64_t)((MAX_PER + 1))));
p = (p + 1);
}
CACHE = calloc(size, 8);
NUM_VISITED = calloc(5, 4);
if ((CACHE == NULL || NUM_VISITED == NULL)) {
return 1;
}
int64_t i = 0;
while (i < size) {
CACHE[i] = UNKNOWN;
i = (i + 1);
}
printf("%lld\n", search_i32_i32(num_arcs, 0));
free(CACHE);
free(NUM_VISITED);
return 0;
}
Generated MLIR
module {
llvm.func @printf(!llvm.ptr, ...) -> i32
llvm.mlir.global internal constant @str_0("%lld\n\00") {addr_space = 0 : i32} : !llvm.array<6 x i8>
func.func private @calloc(i64, i64) -> !llvm.ptr
func.func private @free(!llvm.ptr) -> ()
// Module static: NUM_VISITED
llvm.mlir.global internal @NUM_VISITED() {addr_space = 0 : i32} : !llvm.ptr {
%0 = llvm.mlir.zero : !llvm.ptr
llvm.return %0 : !llvm.ptr
}
// Module static: MAX_PER
llvm.mlir.global internal @MAX_PER(0 : i32) : i32
// Module static: CACHE
llvm.mlir.global internal @CACHE() {addr_space = 0 : i32} : !llvm.ptr {
%1 = llvm.mlir.zero : !llvm.ptr
llvm.return %1 : !llvm.ptr
}
// Constant: UNKNOWN
llvm.mlir.global internal constant @UNKNOWN(-1 : i64) : i64
func.func @search(%arg0: i32, %arg1: i32) -> i64 {
%2 = arith.constant 0 : i32
%3 = arith.cmpi eq, %arg0, %2 : i32
cf.cond_br %3, ^bb0, ^bb1
^bb0:
%4 = arith.constant 0 : i32
%5 = arith.cmpi ne, %arg1, %4 : i32
cf.cond_br %5, ^bb3, ^bb4
^bb3:
%6 = arith.constant 0 : i32
%7 = arith.extsi %6 : i32 to i64
func.return %7 : i64
^bb4:
cf.br ^bb5
^bb5:
%9 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%10 = llvm.load %9 : !llvm.ptr -> !llvm.ptr
%11 = arith.constant 0 : i32
%12 = arith.extsi %11 : i32 to i64
%13 = llvm.getelementptr %10[%12] : (!llvm.ptr, i64) -> !llvm.ptr, i32
%8 = llvm.load %13 : !llvm.ptr -> i32
%15 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%16 = llvm.load %15 : !llvm.ptr -> !llvm.ptr
%17 = arith.constant 1 : i32
%18 = arith.extsi %17 : i32 to i64
%19 = llvm.getelementptr %16[%18] : (!llvm.ptr, i64) -> !llvm.ptr, i32
%14 = llvm.load %19 : !llvm.ptr -> i32
%20 = arith.cmpi ne, %8, %14 : i32
cf.cond_br %20, ^bb6, ^bb7
^bb6:
%21 = arith.constant 0 : i32
%22 = arith.extsi %21 : i32 to i64
func.return %22 : i64
^bb7:
cf.br ^bb8
^bb8:
%24 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%25 = llvm.load %24 : !llvm.ptr -> !llvm.ptr
%26 = arith.constant 2 : i32
%27 = arith.extsi %26 : i32 to i64
%28 = llvm.getelementptr %25[%27] : (!llvm.ptr, i64) -> !llvm.ptr, i32
%23 = llvm.load %28 : !llvm.ptr -> i32
%30 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%31 = llvm.load %30 : !llvm.ptr -> !llvm.ptr
%32 = arith.constant 3 : i32
%33 = arith.extsi %32 : i32 to i64
%34 = llvm.getelementptr %31[%33] : (!llvm.ptr, i64) -> !llvm.ptr, i32
%29 = llvm.load %34 : !llvm.ptr -> i32
%35 = arith.cmpi ne, %23, %29 : i32
cf.cond_br %35, ^bb9, ^bb10
^bb9:
%36 = arith.constant 0 : i32
%37 = arith.extsi %36 : i32 to i64
func.return %37 : i64
^bb10:
cf.br ^bb11
^bb11:
%39 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%40 = llvm.load %39 : !llvm.ptr -> !llvm.ptr
%41 = arith.constant 0 : i32
%42 = arith.extsi %41 : i32 to i64
%43 = llvm.getelementptr %40[%42] : (!llvm.ptr, i64) -> !llvm.ptr, i32
%38 = llvm.load %43 : !llvm.ptr -> i32
%45 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%46 = llvm.load %45 : !llvm.ptr -> !llvm.ptr
%47 = arith.constant 2 : i32
%48 = arith.extsi %47 : i32 to i64
%49 = llvm.getelementptr %46[%48] : (!llvm.ptr, i64) -> !llvm.ptr, i32
%44 = llvm.load %49 : !llvm.ptr -> i32
%50 = arith.cmpi ne, %38, %44 : i32
cf.cond_br %50, ^bb12, ^bb13
^bb12:
%51 = arith.constant 0 : i32
%52 = arith.extsi %51 : i32 to i64
func.return %52 : i64
^bb13:
cf.br ^bb14
^bb14:
%53 = arith.constant 1 : i32
%54 = arith.extsi %53 : i32 to i64
func.return %54 : i64
^bb1:
cf.br ^bb2
^bb2:
%55 = llvm.mlir.addressof @MAX_PER : !llvm.ptr
%56 = llvm.load %55 : !llvm.ptr -> i32
%57 = arith.constant 1 : i32
%58 = arith.addi %56, %57 : i32
%59 = arith.extsi %58 : i32 to i64
%60 = arith.extsi %arg1 : i32 to i64
%61 = llvm.mlir.constant(1 : i64) : i64
%62 = llvm.alloca %61 x i64 : (i64) -> !llvm.ptr
llvm.store %60, %62 : i64, !llvm.ptr
%63 = arith.constant 0 : i32
%64 = llvm.mlir.constant(1 : i64) : i64
%65 = llvm.alloca %64 x i32 : (i64) -> !llvm.ptr
llvm.store %63, %65 : i32, !llvm.ptr
cf.br ^bb15
^bb15:
%66 = llvm.load %65 : !llvm.ptr -> i32
%67 = arith.constant 5 : i32
%68 = arith.cmpi slt, %66, %67 : i32
cf.cond_br %68, ^bb16, ^bb17
^bb16:
%69 = llvm.load %62 : !llvm.ptr -> i64
%70 = arith.muli %69, %59 : i64
%72 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%73 = llvm.load %72 : !llvm.ptr -> !llvm.ptr
%74 = llvm.load %65 : !llvm.ptr -> i32
%75 = arith.extsi %74 : i32 to i64
%76 = llvm.getelementptr %73[%75] : (!llvm.ptr, i64) -> !llvm.ptr, i32
%71 = llvm.load %76 : !llvm.ptr -> i32
%77 = arith.extsi %71 : i32 to i64
%78 = arith.addi %70, %77 : i64
llvm.store %78, %62 : i64, !llvm.ptr
%79 = llvm.load %65 : !llvm.ptr -> i32
%80 = arith.constant 1 : i32
%81 = arith.addi %79, %80 : i32
llvm.store %81, %65 : i32, !llvm.ptr
cf.br ^bb15
^bb17:
%83 = llvm.mlir.addressof @CACHE : !llvm.ptr
%84 = llvm.load %83 : !llvm.ptr -> !llvm.ptr
%85 = llvm.load %62 : !llvm.ptr -> i64
%86 = llvm.getelementptr %84[%85] : (!llvm.ptr, i64) -> !llvm.ptr, i64
%82 = llvm.load %86 : !llvm.ptr -> i64
%87 = llvm.mlir.addressof @UNKNOWN : !llvm.ptr
%88 = llvm.load %87 : !llvm.ptr -> i64
%89 = arith.cmpi ne, %82, %88 : i64
cf.cond_br %89, ^bb18, ^bb19
^bb18:
%91 = llvm.mlir.addressof @CACHE : !llvm.ptr
%92 = llvm.load %91 : !llvm.ptr -> !llvm.ptr
%93 = llvm.load %62 : !llvm.ptr -> i64
%94 = llvm.getelementptr %92[%93] : (!llvm.ptr, i64) -> !llvm.ptr, i64
%90 = llvm.load %94 : !llvm.ptr -> i64
func.return %90 : i64
^bb19:
cf.br ^bb20
^bb20:
%95 = arith.constant 0 : i32
%96 = arith.extsi %95 : i32 to i64
%97 = llvm.mlir.constant(1 : i64) : i64
%98 = llvm.alloca %97 x i64 : (i64) -> !llvm.ptr
llvm.store %96, %98 : i64, !llvm.ptr
%99 = arith.constant 1 : i32
%100 = arith.addi %arg1, %99 : i32
%101 = arith.constant 5 : i32
%102 = arith.remsi %100, %101 : i32
%104 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%105 = llvm.load %104 : !llvm.ptr -> !llvm.ptr
%106 = arith.extsi %102 : i32 to i64
%107 = llvm.getelementptr %105[%106] : (!llvm.ptr, i64) -> !llvm.ptr, i32
%103 = llvm.load %107 : !llvm.ptr -> i32
%108 = llvm.mlir.addressof @MAX_PER : !llvm.ptr
%109 = llvm.load %108 : !llvm.ptr -> i32
%110 = arith.cmpi slt, %103, %109 : i32
cf.cond_br %110, ^bb21, ^bb22
^bb21:
%112 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%113 = llvm.load %112 : !llvm.ptr -> !llvm.ptr
%114 = arith.extsi %102 : i32 to i64
%115 = llvm.getelementptr %113[%114] : (!llvm.ptr, i64) -> !llvm.ptr, i32
%111 = llvm.load %115 : !llvm.ptr -> i32
%116 = arith.constant 1 : i32
%117 = arith.addi %111, %116 : i32
%118 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%119 = llvm.load %118 : !llvm.ptr -> !llvm.ptr
%120 = arith.extsi %102 : i32 to i64
%121 = llvm.getelementptr %119[%120] : (!llvm.ptr, i64) -> !llvm.ptr, i32
llvm.store %117, %121 : i32, !llvm.ptr
%122 = llvm.load %98 : !llvm.ptr -> i64
%124 = arith.constant 1 : i32
%125 = arith.subi %arg0, %124 : i32
%123 = func.call @search(%125, %102) : (i32, i32) -> i64
%126 = arith.addi %122, %123 : i64
llvm.store %126, %98 : i64, !llvm.ptr
%128 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%129 = llvm.load %128 : !llvm.ptr -> !llvm.ptr
%130 = arith.extsi %102 : i32 to i64
%131 = llvm.getelementptr %129[%130] : (!llvm.ptr, i64) -> !llvm.ptr, i32
%127 = llvm.load %131 : !llvm.ptr -> i32
%132 = arith.constant 1 : i32
%133 = arith.subi %127, %132 : i32
%134 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%135 = llvm.load %134 : !llvm.ptr -> !llvm.ptr
%136 = arith.extsi %102 : i32 to i64
%137 = llvm.getelementptr %135[%136] : (!llvm.ptr, i64) -> !llvm.ptr, i32
llvm.store %133, %137 : i32, !llvm.ptr
cf.br ^bb23
^bb22:
cf.br ^bb23
^bb23:
%138 = arith.constant 4 : i32
%139 = arith.addi %arg1, %138 : i32
%140 = arith.constant 5 : i32
%141 = arith.remsi %139, %140 : i32
%143 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%144 = llvm.load %143 : !llvm.ptr -> !llvm.ptr
%145 = arith.extsi %141 : i32 to i64
%146 = llvm.getelementptr %144[%145] : (!llvm.ptr, i64) -> !llvm.ptr, i32
%142 = llvm.load %146 : !llvm.ptr -> i32
%147 = llvm.mlir.addressof @MAX_PER : !llvm.ptr
%148 = llvm.load %147 : !llvm.ptr -> i32
%149 = arith.cmpi slt, %142, %148 : i32
cf.cond_br %149, ^bb24, ^bb25
^bb24:
%151 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%152 = llvm.load %151 : !llvm.ptr -> !llvm.ptr
%153 = arith.extsi %141 : i32 to i64
%154 = llvm.getelementptr %152[%153] : (!llvm.ptr, i64) -> !llvm.ptr, i32
%150 = llvm.load %154 : !llvm.ptr -> i32
%155 = arith.constant 1 : i32
%156 = arith.addi %150, %155 : i32
%157 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%158 = llvm.load %157 : !llvm.ptr -> !llvm.ptr
%159 = arith.extsi %141 : i32 to i64
%160 = llvm.getelementptr %158[%159] : (!llvm.ptr, i64) -> !llvm.ptr, i32
llvm.store %156, %160 : i32, !llvm.ptr
%161 = llvm.load %98 : !llvm.ptr -> i64
%163 = arith.constant 1 : i32
%164 = arith.subi %arg0, %163 : i32
%162 = func.call @search(%164, %141) : (i32, i32) -> i64
%165 = arith.addi %161, %162 : i64
llvm.store %165, %98 : i64, !llvm.ptr
%167 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%168 = llvm.load %167 : !llvm.ptr -> !llvm.ptr
%169 = arith.extsi %141 : i32 to i64
%170 = llvm.getelementptr %168[%169] : (!llvm.ptr, i64) -> !llvm.ptr, i32
%166 = llvm.load %170 : !llvm.ptr -> i32
%171 = arith.constant 1 : i32
%172 = arith.subi %166, %171 : i32
%173 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%174 = llvm.load %173 : !llvm.ptr -> !llvm.ptr
%175 = arith.extsi %141 : i32 to i64
%176 = llvm.getelementptr %174[%175] : (!llvm.ptr, i64) -> !llvm.ptr, i32
llvm.store %172, %176 : i32, !llvm.ptr
cf.br ^bb26
^bb25:
cf.br ^bb26
^bb26:
%177 = llvm.load %98 : !llvm.ptr -> i64
%178 = llvm.mlir.addressof @CACHE : !llvm.ptr
%179 = llvm.load %178 : !llvm.ptr -> !llvm.ptr
%180 = llvm.load %62 : !llvm.ptr -> i64
%181 = llvm.getelementptr %179[%180] : (!llvm.ptr, i64) -> !llvm.ptr, i64
llvm.store %177, %181 : i64, !llvm.ptr
%182 = llvm.load %98 : !llvm.ptr -> i64
func.return %182 : i64
}
func.func @main() -> i32 {
%183 = arith.constant 70 : i32
%184 = arith.constant 5 : i32
%185 = arith.divsi %183, %184 : i32
%186 = llvm.mlir.addressof @MAX_PER : !llvm.ptr
llvm.store %185, %186 : i32, !llvm.ptr
%187 = arith.constant 5 : i32
%188 = arith.extsi %187 : i32 to i64
%189 = llvm.mlir.constant(1 : i64) : i64
%190 = llvm.alloca %189 x i64 : (i64) -> !llvm.ptr
llvm.store %188, %190 : i64, !llvm.ptr
%191 = arith.constant 0 : i32
%192 = llvm.mlir.constant(1 : i64) : i64
%193 = llvm.alloca %192 x i32 : (i64) -> !llvm.ptr
llvm.store %191, %193 : i32, !llvm.ptr
cf.br ^bb27
^bb27:
%194 = llvm.load %193 : !llvm.ptr -> i32
%195 = arith.constant 5 : i32
%196 = arith.cmpi slt, %194, %195 : i32
cf.cond_br %196, ^bb28, ^bb29
^bb28:
%197 = llvm.load %190 : !llvm.ptr -> i64
%198 = llvm.mlir.addressof @MAX_PER : !llvm.ptr
%199 = llvm.load %198 : !llvm.ptr -> i32
%200 = arith.constant 1 : i32
%201 = arith.addi %199, %200 : i32
%202 = arith.extsi %201 : i32 to i64
%203 = arith.muli %197, %202 : i64
llvm.store %203, %190 : i64, !llvm.ptr
%204 = llvm.load %193 : !llvm.ptr -> i32
%205 = arith.constant 1 : i32
%206 = arith.addi %204, %205 : i32
llvm.store %206, %193 : i32, !llvm.ptr
cf.br ^bb27
^bb29:
%208 = llvm.load %190 : !llvm.ptr -> i64
%209 = arith.constant 8 : i32
%210 = arith.extsi %209 : i32 to i64
%207 = func.call @calloc(%208, %210) : (i64, i64) -> !llvm.ptr
%211 = llvm.mlir.addressof @CACHE : !llvm.ptr
llvm.store %207, %211 : !llvm.ptr, !llvm.ptr
%213 = arith.constant 5 : i32
%214 = arith.constant 4 : i32
%215 = arith.extsi %213 : i32 to i64
%216 = arith.extsi %214 : i32 to i64
%212 = func.call @calloc(%215, %216) : (i64, i64) -> !llvm.ptr
%217 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
llvm.store %212, %217 : !llvm.ptr, !llvm.ptr
%218 = llvm.mlir.addressof @CACHE : !llvm.ptr
%219 = llvm.load %218 : !llvm.ptr -> !llvm.ptr
%220 = llvm.mlir.zero : !llvm.ptr
%221 = llvm.icmp "eq" %219, %220 : !llvm.ptr
%222 = scf.if %221 -> (i1) {
%223 = arith.constant true
scf.yield %223 : i1
} else {
%224 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%225 = llvm.load %224 : !llvm.ptr -> !llvm.ptr
%226 = llvm.mlir.zero : !llvm.ptr
%227 = llvm.icmp "eq" %225, %226 : !llvm.ptr
scf.yield %227 : i1
}
cf.cond_br %222, ^bb30, ^bb31
^bb30:
%228 = arith.constant 1 : i32
func.return %228 : i32
^bb31:
cf.br ^bb32
^bb32:
%229 = arith.constant 0 : i32
%230 = arith.extsi %229 : i32 to i64
%231 = llvm.mlir.constant(1 : i64) : i64
%232 = llvm.alloca %231 x i64 : (i64) -> !llvm.ptr
llvm.store %230, %232 : i64, !llvm.ptr
cf.br ^bb33
^bb33:
%233 = llvm.load %232 : !llvm.ptr -> i64
%234 = llvm.load %190 : !llvm.ptr -> i64
%235 = arith.cmpi slt, %233, %234 : i64
cf.cond_br %235, ^bb34, ^bb35
^bb34:
%236 = llvm.mlir.addressof @UNKNOWN : !llvm.ptr
%237 = llvm.load %236 : !llvm.ptr -> i64
%238 = llvm.mlir.addressof @CACHE : !llvm.ptr
%239 = llvm.load %238 : !llvm.ptr -> !llvm.ptr
%240 = llvm.load %232 : !llvm.ptr -> i64
%241 = llvm.getelementptr %239[%240] : (!llvm.ptr, i64) -> !llvm.ptr, i64
llvm.store %237, %241 : i64, !llvm.ptr
%242 = llvm.load %232 : !llvm.ptr -> i64
%243 = arith.constant 1 : i32
%245 = arith.extsi %243 : i32 to i64
%244 = arith.addi %242, %245 : i64
llvm.store %244, %232 : i64, !llvm.ptr
cf.br ^bb33
^bb35:
%246 = llvm.mlir.addressof @str_0 : !llvm.ptr
%248 = arith.constant 0 : i32
%247 = func.call @search(%183, %248) : (i32, i32) -> i64
%249 = llvm.call @printf(%246, %247) vararg(!llvm.func<i32 (ptr, ...)>) : (!llvm.ptr, i64) -> i32
%251 = llvm.mlir.addressof @CACHE : !llvm.ptr
%252 = llvm.load %251 : !llvm.ptr -> !llvm.ptr
func.call @free(%252) : (!llvm.ptr) -> ()
%254 = llvm.mlir.addressof @NUM_VISITED : !llvm.ptr
%255 = llvm.load %254 : !llvm.ptr -> !llvm.ptr
func.call @free(%255) : (!llvm.ptr) -> ()
%256 = arith.constant 0 : i32
func.return %256 : i32
}
}