syndicate-lang
/
syndicate-2017
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

consider more potential schedulings of events

This commit is contained in:
Sam Caldwell 2019-07-01 17:17:13 -04:00
parent 9a21a811a3
commit e018359204
1 changed files with 24 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

37
racket/typed/proto.rkt
View File

@ -260,13 +260,20 @@
(define prev (if (empty? path/r) from (first path/r))) (define prev (if (empty? path/r) from (first path/r)))
(define txn# (state-transitions (hash-ref orig-st#+ to))) (define txn# (state-transitions (hash-ref orig-st#+ to)))
(define visited+ (set-add visited to)) (define visited+ (set-add visited to))
(define new-events (route-internal (hash-ref assertion# prev) (define new-state-changes (route-internal (hash-ref assertion# prev)
(hash-ref assertion# to))) (hash-ref assertion# to)))
;; TODO - this is saying something about how the implementation schedules handlers; (define state-changes* (for/list ([D (in-set new-state-changes)]
;; It could be doing something like exploring (append with (permutations new-events)) #:when (hash-has-key? txn# D))
(define started (for/list ([fn (in-set (set-subtract to prev))]) (StartOf fn))) D))
(define stopped (for/list ([fn (in-set (set-subtract prev to))]) (StopOf fn))) (define started (for*/list ([fn (in-set (set-subtract to prev))]
(define new-events* (append started stopped (set->list new-events))) [D (in-value (StartOf fn))]
#:when (hash-has-key? txn# D))
D))
(define stopped (for*/list ([fn (in-set (set-subtract prev to))]
[D (in-value (StopOf fn))]
#:when (hash-has-key? txn# D))
D))
(define new-events (append started stopped state-changes*))
;; (Listof D+) -> (Listof WorkItem) ;; (Listof D+) -> (Listof WorkItem)
;; Try to dispatch the first relevant pending event, which yields a ;; Try to dispatch the first relevant pending event, which yields a
@ -306,15 +313,19 @@
(append more-pending internal-effs) (append more-pending internal-effs)
(append effs more-effs)))])) (append effs more-effs)))]))
(define pending (append with new-events*)) ;; NOTE: knowledge of scheduling used here
(define pending* (define pending*
(if (hash-has-key? txn# DataflowEvt) (for*/list ([schedule (in-permutations new-events)]
(list pending (cons DataflowEvt pending)) [evts (in-value (append with schedule))]
(list pending))) [df? (in-list (if (hash-has-key? txn# DataflowEvt)
(list #t #f)
(list #f)))])
(if df? (cons DataflowEvt evts) evts)))
(define induced-work (map pending-evts->work-items pending*)) (define induced-work (map pending-evts->work-items pending*))
(define induced-work* (flatten induced-work)) (define induced-work* (remove-duplicates (flatten induced-work)))
(cond (cond
[(empty? (first induced-work)) [(ormap empty? induced-work)
;; this is the end of some path
(define new-paths-work (define new-paths-work
(for*/list (#:unless (set-member? visited to) (for*/list (#:unless (set-member? visited to)
[(D txns) (in-hash txn#)] [(D txns) (in-hash txn#)]