#lang racket/base ;; The Computer Language Benchmarks Game ;; http://shootout.alioth.debian.org/ ;; contributed by Eli Barzilay ;; parallelized by Sam Tobin-Hochstadt (require racket/require (for-syntax racket/base) racket/future (filtered-in (lambda (n) (regexp-replace #rx"unsafe-" n "")) racket/unsafe/ops) (only-in racket/flonum make-flvector) racket/cmdline future-visualizer) (define LIMIT-SQR 4.0) (define ITERATIONS 50) (define-values (N total-futures) (command-line #:args (n f) (values (string->number n) (string->number f)))) (define N.0 (fx->fl N)) (define 2/N (fl/ 2.0 N.0)) (define Crs (let ([v (make-flvector N)]) (for ([x (in-range N)]) (flvector-set! v x (fl- (fl/ (fx->fl (fx* 2 x)) N.0) 1.5))) v)) (define bpr (ceiling (/ N 8))) (define bitmap (make-bytes (* N bpr))) (define-syntax (let-n s) (syntax-case s () [(_ N bs E) (for/fold ([E #'E]) ([_ (syntax-e #'N)]) #`(let bs #,E))])) (define-syntax-rule (M Cr Ci) (let loop ([i 0] [Zr 0.0] [Zi 0.0]) (cond [(fl> (fl+ (fl* Zr Zr) (fl* Zi Zi)) LIMIT-SQR) 0] [(fx= i ITERATIONS) 1] [else (let-n 5 ([Zr (fl+ (fl- (fl* Zr Zr) (fl* Zi Zi)) Cr)] [Zi (fl+ (fl* 2.0 (fl* Zr Zi)) Ci)]) (loop (fx+ i 5) Zr Zi))]))) (printf "P4\n~a ~a\n" N N) (define stride (/ N total-futures)) (visualize-futures (for-each touch (for/list ([y* (in-range N 0 (- stride))]) (future (lambda () (for ([y (in-range y* (- y* stride) -1)]) (define Ci (fl- (fl* 2/N (fx->fl y)) 1.0)) (let loop-x ([x 0] [bitnum 0] [byteacc 0] [aindex (fx* bpr (fx- N y))]) (cond [(fx< x N) (define Cr (flvector-ref Crs x)) (define byteacc* (fx+ (fxlshift byteacc 1) (M Cr Ci))) (cond [(fx= bitnum 7) (bytes-set! bitmap aindex byteacc*) (loop-x (fx+ x 1) 0 0 (fx+ aindex 1))] [else (loop-x (fx+ x 1) (fx+ bitnum 1) byteacc* aindex)])] [else (when (fx> bitnum 0) (bytes-set! bitmap aindex (fxlshift byteacc (fx- 8 (fxand N #x7)))))]))))))) (void (write-bytes bitmap)) )