bitbake: toastergui: stop covered task graph traversal early
This patch stops the breadth-frist graph traversal for finding covering tasks after the finding the first level of executed tasks. The reasoning is that the first level of executed tasks is the actually relevent information on how a task was covered. (Bitbake rev: 06294c5d3b512fb849fc1eedc9d5ea344f535bec) Signed-off-by: Alexandru DAMIAN <alexandru.damian@intel.com> Signed-off-by: Richard Purdie <richard.purdie@linuxfoundation.org>
This commit is contained in:
parent
63e5d478f5
commit
2d1d6a8ee6
|
@ -357,6 +357,8 @@ def generateCoveredList2( revlist = [] ):
|
|||
covered_list = [ x for x in revlist if x.outcome == Task.OUTCOME_COVERED ]
|
||||
while len(covered_list):
|
||||
revlist = [ x for x in revlist if x.outcome != Task.OUTCOME_COVERED ]
|
||||
if len(revlist) > 0:
|
||||
return revlist
|
||||
|
||||
newlist = _find_task_revdep_list(covered_list)
|
||||
|
||||
|
@ -379,10 +381,7 @@ def task( request, build_id, task_id ):
|
|||
coveredBy = '';
|
||||
if ( task.outcome == Task.OUTCOME_COVERED ):
|
||||
# _list = generateCoveredList( task )
|
||||
_list = generateCoveredList2( _find_task_revdep( task ) )
|
||||
coveredBy = [ ]
|
||||
for t in _list:
|
||||
coveredBy.append( t )
|
||||
coveredBy = sorted(generateCoveredList2( _find_task_revdep( task ) ), key = lambda x: x.recipe.name)
|
||||
log_head = ''
|
||||
log_body = ''
|
||||
if task.outcome == task.OUTCOME_FAILED:
|
||||
|
|
Loading…
Reference in New Issue