7
0%
master: 0%

Ran 06 Dec 2016 10:10PM UTC

Files 21

Run time 8min

Badge

Embed ▾

Committed 06 Dec 2016 09:54PM UTC coverage: 0.0%. Remained the same

Job # PROSPECT_DEV_MODE=1 TEST_SUITE=pa-tests

Build Type

push

travis-ci

Committed by

DrTodd13

Commit Message

Generalize the parfor hoisting code in all the lowering functions in mk-parfor into a function doHoistParfor.
Add code to this new function that finds allocations in the parfor and finds arraysets of arrays into arrays.
hoist_invariants for parfor hoisting now treats bits types and non-bits types different.  For bits types,
it does the same as before which is to hoist if the count of symbol defs is exactly 1.  For non-bits types,
it will not hoist if 1) the allocation of the symbol was not found in the parfor (via the aforementioned code),
2) if the number of allocations isn't exactly 1, or 3) the number of arrays stored into arrays in the parfor
is greater than zero.  This last check is sufficient for our current HPAT case but needs to be extended to a
more general handling that uses alias analysis and finer tracking of whether the allocated symbol or one of
its aliases is escaping from the parfor via an arrayset.

Run Details

0 of 10269 relevant lines covered (0.0%)

0.0 hits per line

IntelLabs / ParallelAccelerator.jl / 929 / 7
0%
master: 0%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 929.7 (PROSPECT_DEV_MODE=1 TEST_SUITE=pa-tests)

IntelLabs / ParallelAccelerator.jl / 929 / 7 0% master: 0%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 929.7 (PROSPECT_DEV_MODE=1 TEST_SUITE=pa-tests)

IntelLabs / ParallelAccelerator.jl / 929 / 7
0%
master: 0%

README BADGES
x