Problem 697

Randomly decaying sequences: Wilson-Hilferty gamma quantile / ln(10).

View problem on Project Euler

Performance comparison

Flow source

# Project Euler 697
# Randomly decaying sequences: Wilson-Hilferty gamma quantile / ln(10).

extern {
    function log(x: f64) -> f64
    function sqrt(x: f64) -> f64
    function round(x: f64) -> f64
}

function compute(n: f64) -> f64 {
    let z: f64 = 0.6744897501960817
    let df: f64 = 2.0 * n
    let t: f64 = 1.0 - 2.0 / (9.0 * df) + z * sqrt(2.0 / (9.0 * df))
    let chi2: f64 = df * t * t * t
    return round((0.5 * chi2) / log(10.0) * 100.0) / 100.0
}

function main() -> i32 {
    printf("%.2f\n", compute(10000000.0))
    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; }

double compute_f64(double n);
int32_t main(void);




double compute_f64(double n) {
    double z = 0.6744897501960817;
    double df = (2.0 * n);
    double t = ((1.0 - (2.0 / (9.0 * df))) + (z * sqrt((2.0 / (9.0 * df)))));
    double chi2 = (((df * t) * t) * t);
    return (round((((0.5 * chi2) / log(10.0)) * 100.0)) / 100.0);
}

int32_t main(void) {
    printf("%.2f\n", compute_f64(10000000.0));
    return 0;
}

Generated MLIR

module {
  llvm.func @printf(!llvm.ptr, ...) -> i32
  llvm.mlir.global internal constant @str_0("%.2f\n\00") {addr_space = 0 : i32} : !llvm.array<6 x i8>
  func.func private @log(f64) -> f64
  func.func private @sqrt(f64) -> f64
  func.func private @round(f64) -> f64
  func.func @compute(%arg0: f64) -> f64 {
    %0 = arith.constant 0.6744897501960817 : f32
    %1 = arith.extf %0 : f32 to f64
    %2 = arith.constant 2.0 : f32
    %4 = arith.extf %2 : f32 to f64
    %3 = arith.mulf %4, %arg0 : f64
    %5 = arith.constant 1.0 : f32
    %6 = arith.constant 2.0 : f32
    %7 = arith.constant 9.0 : f32
    %9 = arith.extf %7 : f32 to f64
    %8 = arith.mulf %9, %3 : f64
    %11 = arith.extf %6 : f32 to f64
    %10 = arith.divf %11, %8 : f64
    %13 = arith.extf %5 : f32 to f64
    %12 = arith.subf %13, %10 : f64
    %14 = arith.constant 2.0 : f32
    %15 = arith.constant 9.0 : f32
    %17 = arith.extf %15 : f32 to f64
    %16 = arith.mulf %17, %3 : f64
    %19 = arith.extf %14 : f32 to f64
    %18 = arith.divf %19, %16 : f64
    %20 = math.sqrt %18 : f64
    %21 = arith.mulf %1, %20 : f64
    %22 = arith.addf %12, %21 : f64
    %23 = arith.mulf %3, %22 : f64
    %24 = arith.mulf %23, %22 : f64
    %25 = arith.mulf %24, %22 : f64
    %27 = arith.constant 0.5 : f32
    %29 = arith.extf %27 : f32 to f64
    %28 = arith.mulf %29, %25 : f64
    %30 = arith.constant 10.0 : f32
    %31 = math.log %30 : f32
    %32 = arith.divf %28, %31 : f64
    %33 = arith.constant 100.0 : f32
    %35 = arith.extf %33 : f32 to f64
    %34 = arith.mulf %32, %35 : f64
    %26 = func.call @round(%34) : (f64) -> f64
    %36 = arith.constant 100.0 : f32
    %38 = arith.extf %36 : f32 to f64
    %37 = arith.divf %26, %38 : f64
    func.return %37 : f64
  }
  func.func @main() -> i32 {
    %39 = llvm.mlir.addressof @str_0 : !llvm.ptr
    %41 = arith.constant 10000000.0 : f32
    %42 = arith.extf %41 : f32 to f64
    %40 = func.call @compute(%42) : (f64) -> f64
    %43 = llvm.call @printf(%39, %40) vararg(!llvm.func<i32 (ptr, ...)>) : (!llvm.ptr, f64) -> i32
    %44 = arith.constant 0 : i32
    func.return %44 : i32
  }
}