runqueue.py 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618
  1. #!/usr/bin/env python
  2. # ex:ts=4:sw=4:sts=4:et
  3. # -*- tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*-
  4. """
  5. BitBake 'RunQueue' implementation
  6. Handles preparation and execution of a queue of tasks
  7. """
  8. # Copyright (C) 2006 Richard Purdie
  9. #
  10. # This program is free software; you can redistribute it and/or modify
  11. # it under the terms of the GNU General Public License version 2 as
  12. # published by the Free Software Foundation.
  13. #
  14. # This program is distributed in the hope that it will be useful,
  15. # but WITHOUT ANY WARRANTY; without even the implied warranty of
  16. # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  17. # GNU General Public License for more details.
  18. #
  19. # You should have received a copy of the GNU General Public License along
  20. # with this program; if not, write to the Free Software Foundation, Inc.,
  21. # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  22. from bb import msg, data, event, mkdirhier, utils
  23. from sets import Set
  24. import bb, os, sys
  25. import signal
  26. class TaskFailure(Exception):
  27. """Exception raised when a task in a runqueue fails"""
  28. def __init__(self, x):
  29. self.args = x
  30. class RunQueueStats:
  31. """
  32. Holds statistics on the tasks handled by the associated runQueue
  33. """
  34. def __init__(self):
  35. self.completed = 0
  36. self.skipped = 0
  37. self.failed = 0
  38. def taskFailed(self):
  39. self.failed = self.failed + 1
  40. def taskCompleted(self):
  41. self.completed = self.completed + 1
  42. def taskSkipped(self):
  43. self.skipped = self.skipped + 1
  44. class RunQueue:
  45. """
  46. BitBake Run Queue implementation
  47. """
  48. def __init__(self, cooker, cfgData, dataCache, taskData, targets):
  49. self.reset_runqueue()
  50. self.cooker = cooker
  51. self.dataCache = dataCache
  52. self.taskData = taskData
  53. self.targets = targets
  54. self.number_tasks = int(bb.data.getVar("BB_NUMBER_THREADS", cfgData) or 1)
  55. def reset_runqueue(self):
  56. self.runq_fnid = []
  57. self.runq_task = []
  58. self.runq_depends = []
  59. self.runq_revdeps = []
  60. self.runq_weight = []
  61. self.prio_map = []
  62. def get_user_idstring(self, task):
  63. fn = self.taskData.fn_index[self.runq_fnid[task]]
  64. taskname = self.runq_task[task]
  65. return "%s, %s" % (fn, taskname)
  66. def prepare_runqueue(self):
  67. """
  68. Turn a set of taskData into a RunQueue and compute data needed
  69. to optimise the execution order.
  70. """
  71. depends = []
  72. runq_weight1 = []
  73. runq_build = []
  74. runq_done = []
  75. taskData = self.taskData
  76. if len(taskData.tasks_name) == 0:
  77. # Nothing to do
  78. return
  79. bb.msg.note(1, bb.msg.domain.RunQueue, "Preparing runqueue")
  80. for task in range(len(taskData.tasks_name)):
  81. fnid = taskData.tasks_fnid[task]
  82. fn = taskData.fn_index[fnid]
  83. task_deps = self.dataCache.task_deps[fn]
  84. if fnid not in taskData.failed_fnids:
  85. depends = taskData.tasks_tdepends[task]
  86. # Resolve Depends
  87. if 'deptask' in task_deps and taskData.tasks_name[task] in task_deps['deptask']:
  88. taskname = task_deps['deptask'][taskData.tasks_name[task]]
  89. for depid in taskData.depids[fnid]:
  90. # Won't be in build_targets if ASSUME_PROVIDED
  91. if depid in taskData.build_targets:
  92. depdata = taskData.build_targets[depid][0]
  93. if depdata is not None:
  94. dep = taskData.fn_index[depdata]
  95. depends.append(taskData.gettask_id(dep, taskname))
  96. # Resolve Runtime Depends
  97. if 'rdeptask' in task_deps and taskData.tasks_name[task] in task_deps['rdeptask']:
  98. taskname = task_deps['rdeptask'][taskData.tasks_name[task]]
  99. for depid in taskData.rdepids[fnid]:
  100. if depid in taskData.run_targets:
  101. depdata = taskData.run_targets[depid][0]
  102. if depdata is not None:
  103. dep = taskData.fn_index[depdata]
  104. depends.append(taskData.gettask_id(dep, taskname))
  105. idepends = taskData.tasks_idepends[task]
  106. for idepend in idepends:
  107. depid = int(idepend.split(":")[0])
  108. if depid in taskData.build_targets:
  109. # Won't be in build_targets if ASSUME_PROVIDED
  110. depdata = taskData.build_targets[depid][0]
  111. if depdata is not None:
  112. dep = taskData.fn_index[depdata]
  113. depends.append(taskData.gettask_id(dep, idepend.split(":")[1]))
  114. def add_recursive_build(depid):
  115. """
  116. Add build depends of depid to depends
  117. (if we've not see it before)
  118. (calls itself recursively)
  119. """
  120. if str(depid) in dep_seen:
  121. return
  122. dep_seen.append(depid)
  123. if depid in taskData.build_targets:
  124. depdata = taskData.build_targets[depid][0]
  125. if depdata is not None:
  126. dep = taskData.fn_index[depdata]
  127. # Need to avoid creating new tasks here
  128. taskid = taskData.gettask_id(dep, taskname, False)
  129. if taskid is not None:
  130. depends.append(taskid)
  131. fnid = taskData.tasks_fnid[taskid]
  132. else:
  133. fnid = taskData.getfn_id(dep)
  134. for nextdepid in taskData.depids[fnid]:
  135. if nextdepid not in dep_seen:
  136. add_recursive_build(nextdepid)
  137. for nextdepid in taskData.rdepids[fnid]:
  138. if nextdepid not in rdep_seen:
  139. add_recursive_run(nextdepid)
  140. idepends = taskData.tasks_idepends[depid]
  141. for idepend in idepends:
  142. nextdepid = int(idepend.split(":")[0])
  143. if nextdepid not in dep_seen:
  144. add_recursive_build(nextdepid)
  145. def add_recursive_run(rdepid):
  146. """
  147. Add runtime depends of rdepid to depends
  148. (if we've not see it before)
  149. (calls itself recursively)
  150. """
  151. if str(rdepid) in rdep_seen:
  152. return
  153. rdep_seen.append(rdepid)
  154. if rdepid in taskData.run_targets:
  155. depdata = taskData.run_targets[rdepid][0]
  156. if depdata is not None:
  157. dep = taskData.fn_index[depdata]
  158. # Need to avoid creating new tasks here
  159. taskid = taskData.gettask_id(dep, taskname, False)
  160. if taskid is not None:
  161. depends.append(taskid)
  162. fnid = taskData.tasks_fnid[taskid]
  163. else:
  164. fnid = taskData.getfn_id(dep)
  165. for nextdepid in taskData.depids[fnid]:
  166. if nextdepid not in dep_seen:
  167. add_recursive_build(nextdepid)
  168. for nextdepid in taskData.rdepids[fnid]:
  169. if nextdepid not in rdep_seen:
  170. add_recursive_run(nextdepid)
  171. idepends = taskData.tasks_idepends[rdepid]
  172. for idepend in idepends:
  173. nextdepid = int(idepend.split(":")[0])
  174. if nextdepid not in dep_seen:
  175. add_recursive_build(nextdepid)
  176. # Resolve Recursive Runtime Depends
  177. # Also includes all thier build depends, intertask depends and runtime depends
  178. if 'recrdeptask' in task_deps and taskData.tasks_name[task] in task_deps['recrdeptask']:
  179. for taskname in task_deps['recrdeptask'][taskData.tasks_name[task]].split():
  180. dep_seen = []
  181. rdep_seen = []
  182. idep_seen = []
  183. for depid in taskData.depids[fnid]:
  184. add_recursive_build(depid)
  185. for rdepid in taskData.rdepids[fnid]:
  186. add_recursive_run(rdepid)
  187. for idepend in idepends:
  188. depid = int(idepend.split(":")[0])
  189. add_recursive_build(depid)
  190. #Prune self references
  191. if task in depends:
  192. newdep = []
  193. bb.msg.debug(2, bb.msg.domain.RunQueue, "Task %s (%s %s) contains self reference! %s" % (task, taskData.fn_index[taskData.tasks_fnid[task]], taskData.tasks_name[task], depends))
  194. for dep in depends:
  195. if task != dep:
  196. newdep.append(dep)
  197. depends = newdep
  198. self.runq_fnid.append(taskData.tasks_fnid[task])
  199. self.runq_task.append(taskData.tasks_name[task])
  200. self.runq_depends.append(Set(depends))
  201. self.runq_revdeps.append(Set())
  202. self.runq_weight.append(0)
  203. runq_weight1.append(0)
  204. runq_build.append(0)
  205. runq_done.append(0)
  206. bb.msg.note(2, bb.msg.domain.RunQueue, "Marking Active Tasks")
  207. def mark_active(listid, depth):
  208. """
  209. Mark an item as active along with its depends
  210. (calls itself recursively)
  211. """
  212. if runq_build[listid] == 1:
  213. return
  214. runq_build[listid] = 1
  215. depends = self.runq_depends[listid]
  216. for depend in depends:
  217. mark_active(depend, depth+1)
  218. for target in self.targets:
  219. targetid = taskData.getbuild_id(target[0])
  220. if targetid not in taskData.build_targets:
  221. continue
  222. if targetid in taskData.failed_deps:
  223. continue
  224. fnid = taskData.build_targets[targetid][0]
  225. # Remove stamps for targets if force mode active
  226. if self.cooker.configuration.force:
  227. fn = taskData.fn_index[fnid]
  228. bb.msg.note(2, bb.msg.domain.RunQueue, "Remove stamp %s, %s" % (target[1], fn))
  229. bb.build.del_stamp(target[1], self.dataCache, fn)
  230. if fnid in taskData.failed_fnids:
  231. continue
  232. listid = taskData.tasks_lookup[fnid][target[1]]
  233. mark_active(listid, 1)
  234. # Prune inactive tasks
  235. maps = []
  236. delcount = 0
  237. for listid in range(len(self.runq_fnid)):
  238. if runq_build[listid-delcount] == 1:
  239. maps.append(listid-delcount)
  240. else:
  241. del self.runq_fnid[listid-delcount]
  242. del self.runq_task[listid-delcount]
  243. del self.runq_depends[listid-delcount]
  244. del self.runq_weight[listid-delcount]
  245. del runq_weight1[listid-delcount]
  246. del runq_build[listid-delcount]
  247. del runq_done[listid-delcount]
  248. del self.runq_revdeps[listid-delcount]
  249. delcount = delcount + 1
  250. maps.append(-1)
  251. if len(self.runq_fnid) == 0:
  252. if not taskData.abort:
  253. bb.msg.note(1, bb.msg.domain.RunQueue, "All possible tasks have been run but build incomplete (--continue mode). See errors above for incomplete tasks.")
  254. return
  255. bb.msg.fatal(bb.msg.domain.RunQueue, "No active tasks and not in --continue mode?! Please report this bug.")
  256. bb.msg.note(2, bb.msg.domain.RunQueue, "Pruned %s inactive tasks, %s left" % (delcount, len(self.runq_fnid)))
  257. for listid in range(len(self.runq_fnid)):
  258. newdeps = []
  259. origdeps = self.runq_depends[listid]
  260. for origdep in origdeps:
  261. if maps[origdep] == -1:
  262. bb.msg.fatal(bb.msg.domain.RunQueue, "Invalid mapping - Should never happen!")
  263. newdeps.append(maps[origdep])
  264. self.runq_depends[listid] = Set(newdeps)
  265. bb.msg.note(2, bb.msg.domain.RunQueue, "Assign Weightings")
  266. for listid in range(len(self.runq_fnid)):
  267. for dep in self.runq_depends[listid]:
  268. self.runq_revdeps[dep].add(listid)
  269. endpoints = []
  270. for listid in range(len(self.runq_fnid)):
  271. revdeps = self.runq_revdeps[listid]
  272. if len(revdeps) == 0:
  273. runq_done[listid] = 1
  274. self.runq_weight[listid] = 1
  275. endpoints.append(listid)
  276. for dep in revdeps:
  277. if dep in self.runq_depends[listid]:
  278. #self.dump_data(taskData)
  279. bb.msg.fatal(bb.msg.domain.RunQueue, "Task %s (%s) has circular dependency on %s (%s)" % (taskData.fn_index[self.runq_fnid[dep]], self.runq_task[dep] , taskData.fn_index[self.runq_fnid[listid]], self.runq_task[listid]))
  280. runq_weight1[listid] = len(revdeps)
  281. bb.msg.note(2, bb.msg.domain.RunQueue, "Compute totals (have %s endpoint(s))" % len(endpoints))
  282. while 1:
  283. next_points = []
  284. for listid in endpoints:
  285. for revdep in self.runq_depends[listid]:
  286. self.runq_weight[revdep] = self.runq_weight[revdep] + self.runq_weight[listid]
  287. runq_weight1[revdep] = runq_weight1[revdep] - 1
  288. if runq_weight1[revdep] == 0:
  289. next_points.append(revdep)
  290. runq_done[revdep] = 1
  291. endpoints = next_points
  292. if len(next_points) == 0:
  293. break
  294. # Sanity Checks
  295. for task in range(len(self.runq_fnid)):
  296. if runq_done[task] == 0:
  297. seen = []
  298. deps_seen = []
  299. def print_chain(taskid, finish):
  300. seen.append(taskid)
  301. for revdep in self.runq_revdeps[taskid]:
  302. if runq_done[revdep] == 0 and revdep not in seen and not finish:
  303. bb.msg.error(bb.msg.domain.RunQueue, "Task %s (%s) (depends: %s)" % (revdep, self.get_user_idstring(revdep), self.runq_depends[revdep]))
  304. if revdep in deps_seen:
  305. bb.msg.error(bb.msg.domain.RunQueue, "Chain ends at Task %s (%s)" % (revdep, self.get_user_idstring(revdep)))
  306. finish = True
  307. return
  308. for dep in self.runq_depends[revdep]:
  309. deps_seen.append(dep)
  310. print_chain(revdep, finish)
  311. print_chain(task, False)
  312. bb.msg.fatal(bb.msg.domain.RunQueue, "Task %s (%s) not processed!\nThis is probably a circular dependency (the chain might be printed above)." % (task, self.get_user_idstring(task)))
  313. if runq_weight1[task] != 0:
  314. bb.msg.fatal(bb.msg.domain.RunQueue, "Task %s (%s) count not zero!" % (task, self.get_user_idstring(task)))
  315. # Make a weight sorted map
  316. from copy import deepcopy
  317. sortweight = deepcopy(self.runq_weight)
  318. sortweight.sort()
  319. copyweight = deepcopy(self.runq_weight)
  320. self.prio_map = []
  321. for weight in sortweight:
  322. idx = copyweight.index(weight)
  323. self.prio_map.append(idx)
  324. copyweight[idx] = -1
  325. self.prio_map.reverse()
  326. #self.dump_data(taskData)
  327. def execute_runqueue(self):
  328. """
  329. Run the tasks in a queue prepared by prepare_runqueue
  330. Upon failure, optionally try to recover the build using any alternate providers
  331. (if the abort on failure configuration option isn't set)
  332. """
  333. failures = 0
  334. while 1:
  335. failed_fnids = []
  336. try:
  337. self.execute_runqueue_internal()
  338. finally:
  339. if self.master_process:
  340. failed_fnids = self.finish_runqueue()
  341. if len(failed_fnids) == 0:
  342. return failures
  343. if self.taskData.abort:
  344. raise bb.runqueue.TaskFailure(failed_fnids)
  345. for fnid in failed_fnids:
  346. #print "Failure: %s %s %s" % (fnid, self.taskData.fn_index[fnid], self.runq_task[fnid])
  347. self.taskData.fail_fnid(fnid)
  348. failures = failures + 1
  349. self.reset_runqueue()
  350. self.prepare_runqueue()
  351. def execute_runqueue_initVars(self):
  352. self.stats = RunQueueStats()
  353. self.active_builds = 0
  354. self.runq_buildable = []
  355. self.runq_running = []
  356. self.runq_complete = []
  357. self.build_pids = {}
  358. self.failed_fnids = []
  359. self.master_process = True
  360. # Mark initial buildable tasks
  361. for task in range(len(self.runq_fnid)):
  362. self.runq_running.append(0)
  363. self.runq_complete.append(0)
  364. if len(self.runq_depends[task]) == 0:
  365. self.runq_buildable.append(1)
  366. else:
  367. self.runq_buildable.append(0)
  368. def task_complete(self, task):
  369. """
  370. Mark a task as completed
  371. Look at the reverse dependencies and mark any task with
  372. completed dependencies as buildable
  373. """
  374. self.runq_complete[task] = 1
  375. for revdep in self.runq_revdeps[task]:
  376. if self.runq_running[revdep] == 1:
  377. continue
  378. if self.runq_buildable[revdep] == 1:
  379. continue
  380. alldeps = 1
  381. for dep in self.runq_depends[revdep]:
  382. if self.runq_complete[dep] != 1:
  383. alldeps = 0
  384. if alldeps == 1:
  385. self.runq_buildable[revdep] = 1
  386. fn = self.taskData.fn_index[self.runq_fnid[revdep]]
  387. taskname = self.runq_task[revdep]
  388. bb.msg.debug(1, bb.msg.domain.RunQueue, "Marking task %s (%s, %s) as buildable" % (revdep, fn, taskname))
  389. def get_next_task(self):
  390. """
  391. Return the id of the highest priority task that is buildable
  392. """
  393. for task1 in range(len(self.runq_fnid)):
  394. task = self.prio_map[task1]
  395. if self.runq_running[task] == 1:
  396. continue
  397. if self.runq_buildable[task] == 1:
  398. return task
  399. return None
  400. def execute_runqueue_internal(self):
  401. """
  402. Run the tasks in a queue prepared by prepare_runqueue
  403. """
  404. bb.msg.note(1, bb.msg.domain.RunQueue, "Executing runqueue")
  405. self.execute_runqueue_initVars()
  406. if len(self.runq_fnid) == 0:
  407. # nothing to do
  408. return []
  409. def sigint_handler(signum, frame):
  410. raise KeyboardInterrupt
  411. # Find any tasks with current stamps and remove them from the queue
  412. for task1 in range(len(self.runq_fnid)):
  413. task = self.prio_map[task1]
  414. fn = self.taskData.fn_index[self.runq_fnid[task]]
  415. taskname = self.runq_task[task]
  416. if bb.build.stamp_is_current(taskname, self.dataCache, fn):
  417. bb.msg.debug(2, bb.msg.domain.RunQueue, "Stamp current task %s (%s)" % (task, self.get_user_idstring(task)))
  418. self.runq_running[task] = 1
  419. self.task_complete(task)
  420. self.stats.taskCompleted()
  421. self.stats.taskSkipped()
  422. while True:
  423. task = self.get_next_task()
  424. if task is not None:
  425. fn = self.taskData.fn_index[self.runq_fnid[task]]
  426. taskname = self.runq_task[task]
  427. if bb.build.stamp_is_current(taskname, self.dataCache, fn):
  428. bb.msg.debug(2, bb.msg.domain.RunQueue, "Stamp current task %s (%s)" % (task, self.get_user_idstring(task)))
  429. self.runq_running[task] = 1
  430. self.task_complete(task)
  431. self.stats.taskCompleted()
  432. self.stats.taskSkipped()
  433. continue
  434. bb.msg.note(1, bb.msg.domain.RunQueue, "Running task %d of %d (ID: %s, %s)" % (self.stats.completed + self.active_builds + 1, len(self.runq_fnid), task, self.get_user_idstring(task)))
  435. try:
  436. pid = os.fork()
  437. except OSError, e:
  438. bb.msg.fatal(bb.msg.domain.RunQueue, "fork failed: %d (%s)" % (e.errno, e.strerror))
  439. if pid == 0:
  440. # Bypass master process' handling
  441. self.master_process = False
  442. # Stop Ctrl+C being sent to children
  443. # signal.signal(signal.SIGINT, signal.SIG_IGN)
  444. # Make the child the process group leader
  445. os.setpgid(0, 0)
  446. newsi = os.open('/dev/null', os.O_RDWR)
  447. os.dup2(newsi, sys.stdin.fileno())
  448. self.cooker.configuration.cmd = taskname[3:]
  449. try:
  450. self.cooker.tryBuild(fn, False)
  451. except bb.build.EventException:
  452. bb.msg.error(bb.msg.domain.Build, "Build of " + fn + " " + taskname + " failed")
  453. sys.exit(1)
  454. except:
  455. bb.msg.error(bb.msg.domain.Build, "Build of " + fn + " " + taskname + " failed")
  456. raise
  457. sys.exit(0)
  458. self.build_pids[pid] = task
  459. self.runq_running[task] = 1
  460. self.active_builds = self.active_builds + 1
  461. if self.active_builds < self.number_tasks:
  462. continue
  463. if self.active_builds > 0:
  464. result = os.waitpid(-1, 0)
  465. self.active_builds = self.active_builds - 1
  466. task = self.build_pids[result[0]]
  467. if result[1] != 0:
  468. del self.build_pids[result[0]]
  469. bb.msg.error(bb.msg.domain.RunQueue, "Task %s (%s) failed" % (task, self.get_user_idstring(task)))
  470. self.failed_fnids.append(self.runq_fnid[task])
  471. self.stats.taskFailed()
  472. break
  473. self.task_complete(task)
  474. self.stats.taskCompleted()
  475. del self.build_pids[result[0]]
  476. continue
  477. return
  478. def finish_runqueue(self):
  479. try:
  480. while self.active_builds > 0:
  481. bb.msg.note(1, bb.msg.domain.RunQueue, "Waiting for %s active tasks to finish" % self.active_builds)
  482. tasknum = 1
  483. for k, v in self.build_pids.iteritems():
  484. bb.msg.note(1, bb.msg.domain.RunQueue, "%s: %s (%s)" % (tasknum, self.get_user_idstring(v), k))
  485. tasknum = tasknum + 1
  486. result = os.waitpid(-1, 0)
  487. task = self.build_pids[result[0]]
  488. if result[1] != 0:
  489. bb.msg.error(bb.msg.domain.RunQueue, "Task %s (%s) failed" % (task, self.get_user_idstring(task)))
  490. self.failed_fnids.append(self.runq_fnid[task])
  491. self.stats.taskFailed()
  492. del self.build_pids[result[0]]
  493. self.active_builds = self.active_builds - 1
  494. bb.msg.note(1, bb.msg.domain.RunQueue, "Tasks Summary: Attempted %d tasks of which %d didn't need to be rerun and %d failed." % (self.stats.completed, self.stats.skipped, self.stats.failed))
  495. return self.failed_fnids
  496. except KeyboardInterrupt:
  497. bb.msg.note(1, bb.msg.domain.RunQueue, "Sending SIGINT to remaining %s tasks" % self.active_builds)
  498. for k, v in self.build_pids.iteritems():
  499. try:
  500. os.kill(-k, signal.SIGINT)
  501. except:
  502. pass
  503. raise
  504. # Sanity Checks
  505. for task in range(len(self.runq_fnid)):
  506. if self.runq_buildable[task] == 0:
  507. bb.msg.error(bb.msg.domain.RunQueue, "Task %s never buildable!" % task)
  508. if self.runq_running[task] == 0:
  509. bb.msg.error(bb.msg.domain.RunQueue, "Task %s never ran!" % task)
  510. if self.runq_complete[task] == 0:
  511. bb.msg.error(bb.msg.domain.RunQueue, "Task %s never completed!" % task)
  512. bb.msg.note(1, bb.msg.domain.RunQueue, "Tasks Summary: Attempted %d tasks of which %d didn't need to be rerun and %d failed." % (self.stats.completed, self.stats.skipped, self.stats.failed))
  513. return self.failed_fnids
  514. def dump_data(self, taskQueue):
  515. """
  516. Dump some debug information on the internal data structures
  517. """
  518. bb.msg.debug(3, bb.msg.domain.RunQueue, "run_tasks:")
  519. for task in range(len(self.runq_fnid)):
  520. bb.msg.debug(3, bb.msg.domain.RunQueue, " (%s)%s - %s: %s Deps %s RevDeps %s" % (task,
  521. taskQueue.fn_index[self.runq_fnid[task]],
  522. self.runq_task[task],
  523. self.runq_weight[task],
  524. self.runq_depends[task],
  525. self.runq_revdeps[task]))
  526. bb.msg.debug(3, bb.msg.domain.RunQueue, "sorted_tasks:")
  527. for task1 in range(len(self.runq_fnid)):
  528. if task1 in self.prio_map:
  529. task = self.prio_map[task1]
  530. bb.msg.debug(3, bb.msg.domain.RunQueue, " (%s)%s - %s: %s Deps %s RevDeps %s" % (task,
  531. taskQueue.fn_index[self.runq_fnid[task]],
  532. self.runq_task[task],
  533. self.runq_weight[task],
  534. self.runq_depends[task],
  535. self.runq_revdeps[task]))