Fcalva/cyclone
1
0
Fork 0
mirror of https://github.com/justinethier/cyclone.git synced 2025-05-24 20:45:06 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

Cleanup and bug fixes

Browse source
This commit is contained in:
Justin Ethier 2019-01-04 16:07:17 -05:00
parent b2fceb8a49
commit 3ce15462dc
1 changed files with 28 additions and 19 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

47
scheme/cyclone/cps-opt-analyze-call-graph.scm
View file

@ -22,32 +22,33 @@
) )
)) ))
;; TODO: ;; symbol -> hash-table -> boolean
;; analyze call graph. not exactly sure how this is going to work yet, but the goal is to be able to figure out which
;; variables a primitive call is dependent upon. We then need to be able to query if any of those variables are mutated
;; (ideally in fnc body) in which case we cannot inline the prim call.
;;
;; Notes:
;; Should we pass a copy of the current call graph and then dump it off when a new variable is encountered? In which case, when do we reset the graph? Maybe we just build it up as an a-list as we go, so it resets itself automatically? Then each a-list can exist as part of analysis DB for the variable... would that work?
;; Is it OK to inline code replacing ref, based on call graph data from lookup table? ;; Is it OK to inline code replacing ref, based on call graph data from lookup table?
(define (inline-ok-from-call-graph? ref tbl) (define (inline-ok-from-call-graph? ref tbl)
(and-let* ((vars (hash-table-ref/default tbl ref #f)) ;(let ((result
((pair? vars)) (let ((vars (hash-table-ref/default tbl ref #f)))
)
(call/cc (call/cc
(lambda (return) (lambda (return)
(for-each (when (pair? vars)
(lambda (v) ;; If there are vars, make sure each one is safe to inline
(and-let* ((adb-var (adb:get/default v #f))) (for-each
(when (not (adbv:inlinable adb-var)) (lambda (v)
;(trace:error `(cannot inline ,ref)) (and-let* ((adb-var (adb:get/default v #f)))
(return #f)) (when (not (adbv:inlinable adb-var))
;(trace:error `(cannot inline ,ref))
(return #f))
)
) )
) (cdr vars))) ;; Skip ref itself
(cdr vars)) ;; Skip ref itself
(return #t))))) (return #t)))))
;)
;(trace:error `(inline-ok-from-call-graph? ,result ,ref ,(hash-table-ref/default tbl ref #f)))
;result))
;; Analyze call graph. The goal is to be able to figure out which variables a primitive call
;; is dependent upon. We then need to be able to query if any of those variables are mutated
;; (ideally in fnc body) in which case we cannot inline the prim call.
(define (analyze:build-call-graph sexp) (define (analyze:build-call-graph sexp)
;; Add new entry for each var as it is found... ;; Add new entry for each var as it is found...
(define lookup-tbl (make-hash-table)) (define lookup-tbl (make-hash-table))
@ -128,6 +129,14 @@
(define sexp (define sexp
'( '(
;; Test case from compiler benchmark.
;; The original code is:
;; (define (test obj)
;; (let ((m (length (queue->list objects-dumped))))
;; (queue-put! objects-dumped obj)
;; (queue-put! object-queue obj)
;; m))
(define test (define test
(lambda (lambda
(k$38 obj$5$11) (k$38 obj$5$11)