runqueue.py 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646
  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-2007 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. self.multi_provider_whitelist = (bb.data.getVar("MULTI_PROVIDER_WHITELIST", cfgData) or "").split()
  56. def reset_runqueue(self):
  57. self.runq_fnid = []
  58. self.runq_task = []
  59. self.runq_depends = []
  60. self.runq_revdeps = []
  61. self.runq_weight = []
  62. self.prio_map = []
  63. def get_user_idstring(self, task):
  64. fn = self.taskData.fn_index[self.runq_fnid[task]]
  65. taskname = self.runq_task[task]
  66. return "%s, %s" % (fn, taskname)
  67. def prepare_runqueue(self):
  68. """
  69. Turn a set of taskData into a RunQueue and compute data needed
  70. to optimise the execution order.
  71. """
  72. depends = []
  73. runq_weight1 = []
  74. runq_build = []
  75. runq_done = []
  76. taskData = self.taskData
  77. if len(taskData.tasks_name) == 0:
  78. # Nothing to do
  79. return
  80. bb.msg.note(1, bb.msg.domain.RunQueue, "Preparing runqueue")
  81. for task in range(len(taskData.tasks_name)):
  82. fnid = taskData.tasks_fnid[task]
  83. fn = taskData.fn_index[fnid]
  84. task_deps = self.dataCache.task_deps[fn]
  85. if fnid not in taskData.failed_fnids:
  86. depends = taskData.tasks_tdepends[task]
  87. # Resolve Depends
  88. if 'deptask' in task_deps and taskData.tasks_name[task] in task_deps['deptask']:
  89. taskname = task_deps['deptask'][taskData.tasks_name[task]]
  90. for depid in taskData.depids[fnid]:
  91. # Won't be in build_targets if ASSUME_PROVIDED
  92. if depid in taskData.build_targets:
  93. depdata = taskData.build_targets[depid][0]
  94. if depdata is not None:
  95. dep = taskData.fn_index[depdata]
  96. depends.append(taskData.gettask_id(dep, taskname))
  97. # Resolve Runtime Depends
  98. if 'rdeptask' in task_deps and taskData.tasks_name[task] in task_deps['rdeptask']:
  99. taskname = task_deps['rdeptask'][taskData.tasks_name[task]]
  100. for depid in taskData.rdepids[fnid]:
  101. if depid in taskData.run_targets:
  102. depdata = taskData.run_targets[depid][0]
  103. if depdata is not None:
  104. dep = taskData.fn_index[depdata]
  105. depends.append(taskData.gettask_id(dep, taskname))
  106. idepends = taskData.tasks_idepends[task]
  107. for idepend in idepends:
  108. depid = int(idepend.split(":")[0])
  109. if depid in taskData.build_targets:
  110. # Won't be in build_targets if ASSUME_PROVIDED
  111. depdata = taskData.build_targets[depid][0]
  112. if depdata is not None:
  113. dep = taskData.fn_index[depdata]
  114. depends.append(taskData.gettask_id(dep, idepend.split(":")[1]))
  115. def add_recursive_build(depid, depfnid):
  116. """
  117. Add build depends of depid to depends
  118. (if we've not see it before)
  119. (calls itself recursively)
  120. """
  121. if str(depid) in dep_seen:
  122. return
  123. dep_seen.append(depid)
  124. if depid in taskData.build_targets:
  125. depdata = taskData.build_targets[depid][0]
  126. if depdata is not None:
  127. dep = taskData.fn_index[depdata]
  128. idepends = []
  129. # Need to avoid creating new tasks here
  130. taskid = taskData.gettask_id(dep, taskname, False)
  131. if taskid is not None:
  132. depends.append(taskid)
  133. fnid = taskData.tasks_fnid[taskid]
  134. idepends = taskData.tasks_idepends[taskid]
  135. #print "Added %s (%s) due to %s" % (taskid, taskData.fn_index[fnid], taskData.fn_index[depfnid])
  136. else:
  137. fnid = taskData.getfn_id(dep)
  138. for nextdepid in taskData.depids[fnid]:
  139. if nextdepid not in dep_seen:
  140. add_recursive_build(nextdepid, fnid)
  141. for nextdepid in taskData.rdepids[fnid]:
  142. if nextdepid not in rdep_seen:
  143. add_recursive_run(nextdepid, fnid)
  144. for idepend in idepends:
  145. nextdepid = int(idepend.split(":")[0])
  146. if nextdepid not in dep_seen:
  147. add_recursive_build(nextdepid, fnid)
  148. def add_recursive_run(rdepid, depfnid):
  149. """
  150. Add runtime depends of rdepid to depends
  151. (if we've not see it before)
  152. (calls itself recursively)
  153. """
  154. if str(rdepid) in rdep_seen:
  155. return
  156. rdep_seen.append(rdepid)
  157. if rdepid in taskData.run_targets:
  158. depdata = taskData.run_targets[rdepid][0]
  159. if depdata is not None:
  160. dep = taskData.fn_index[depdata]
  161. idepends = []
  162. # Need to avoid creating new tasks here
  163. taskid = taskData.gettask_id(dep, taskname, False)
  164. if taskid is not None:
  165. depends.append(taskid)
  166. fnid = taskData.tasks_fnid[taskid]
  167. idepends = taskData.tasks_idepends[taskid]
  168. #print "Added %s (%s) due to %s" % (taskid, taskData.fn_index[fnid], taskData.fn_index[depfnid])
  169. else:
  170. fnid = taskData.getfn_id(dep)
  171. for nextdepid in taskData.depids[fnid]:
  172. if nextdepid not in dep_seen:
  173. add_recursive_build(nextdepid, fnid)
  174. for nextdepid in taskData.rdepids[fnid]:
  175. if nextdepid not in rdep_seen:
  176. add_recursive_run(nextdepid, fnid)
  177. for idepend in idepends:
  178. nextdepid = int(idepend.split(":")[0])
  179. if nextdepid not in dep_seen:
  180. add_recursive_build(nextdepid, fnid)
  181. # Resolve Recursive Runtime Depends
  182. # Also includes all thier build depends, intertask depends and runtime depends
  183. if 'recrdeptask' in task_deps and taskData.tasks_name[task] in task_deps['recrdeptask']:
  184. for taskname in task_deps['recrdeptask'][taskData.tasks_name[task]].split():
  185. dep_seen = []
  186. rdep_seen = []
  187. idep_seen = []
  188. for depid in taskData.depids[fnid]:
  189. add_recursive_build(depid, fnid)
  190. for rdepid in taskData.rdepids[fnid]:
  191. add_recursive_run(rdepid, fnid)
  192. for idepend in idepends:
  193. depid = int(idepend.split(":")[0])
  194. add_recursive_build(depid, fnid)
  195. #Prune self references
  196. if task in depends:
  197. newdep = []
  198. 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))
  199. for dep in depends:
  200. if task != dep:
  201. newdep.append(dep)
  202. depends = newdep
  203. self.runq_fnid.append(taskData.tasks_fnid[task])
  204. self.runq_task.append(taskData.tasks_name[task])
  205. self.runq_depends.append(Set(depends))
  206. self.runq_revdeps.append(Set())
  207. self.runq_weight.append(0)
  208. runq_weight1.append(0)
  209. runq_build.append(0)
  210. runq_done.append(0)
  211. bb.msg.note(2, bb.msg.domain.RunQueue, "Marking Active Tasks")
  212. def mark_active(listid, depth):
  213. """
  214. Mark an item as active along with its depends
  215. (calls itself recursively)
  216. """
  217. if runq_build[listid] == 1:
  218. return
  219. runq_build[listid] = 1
  220. depends = self.runq_depends[listid]
  221. for depend in depends:
  222. mark_active(depend, depth+1)
  223. for target in self.targets:
  224. targetid = taskData.getbuild_id(target[0])
  225. if targetid not in taskData.build_targets:
  226. continue
  227. if targetid in taskData.failed_deps:
  228. continue
  229. fnid = taskData.build_targets[targetid][0]
  230. # Remove stamps for targets if force mode active
  231. if self.cooker.configuration.force:
  232. fn = taskData.fn_index[fnid]
  233. bb.msg.note(2, bb.msg.domain.RunQueue, "Remove stamp %s, %s" % (target[1], fn))
  234. bb.build.del_stamp(target[1], self.dataCache, fn)
  235. if fnid in taskData.failed_fnids:
  236. continue
  237. listid = taskData.tasks_lookup[fnid][target[1]]
  238. mark_active(listid, 1)
  239. # Prune inactive tasks
  240. maps = []
  241. delcount = 0
  242. for listid in range(len(self.runq_fnid)):
  243. if runq_build[listid-delcount] == 1:
  244. maps.append(listid-delcount)
  245. else:
  246. del self.runq_fnid[listid-delcount]
  247. del self.runq_task[listid-delcount]
  248. del self.runq_depends[listid-delcount]
  249. del self.runq_weight[listid-delcount]
  250. del runq_weight1[listid-delcount]
  251. del runq_build[listid-delcount]
  252. del runq_done[listid-delcount]
  253. del self.runq_revdeps[listid-delcount]
  254. delcount = delcount + 1
  255. maps.append(-1)
  256. if len(self.runq_fnid) == 0:
  257. if not taskData.abort:
  258. 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.")
  259. return
  260. bb.msg.fatal(bb.msg.domain.RunQueue, "No active tasks and not in --continue mode?! Please report this bug.")
  261. bb.msg.note(2, bb.msg.domain.RunQueue, "Pruned %s inactive tasks, %s left" % (delcount, len(self.runq_fnid)))
  262. for listid in range(len(self.runq_fnid)):
  263. newdeps = []
  264. origdeps = self.runq_depends[listid]
  265. for origdep in origdeps:
  266. if maps[origdep] == -1:
  267. bb.msg.fatal(bb.msg.domain.RunQueue, "Invalid mapping - Should never happen!")
  268. newdeps.append(maps[origdep])
  269. self.runq_depends[listid] = Set(newdeps)
  270. bb.msg.note(2, bb.msg.domain.RunQueue, "Assign Weightings")
  271. for listid in range(len(self.runq_fnid)):
  272. for dep in self.runq_depends[listid]:
  273. self.runq_revdeps[dep].add(listid)
  274. endpoints = []
  275. for listid in range(len(self.runq_fnid)):
  276. revdeps = self.runq_revdeps[listid]
  277. if len(revdeps) == 0:
  278. runq_done[listid] = 1
  279. self.runq_weight[listid] = 1
  280. endpoints.append(listid)
  281. for dep in revdeps:
  282. if dep in self.runq_depends[listid]:
  283. #self.dump_data(taskData)
  284. 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]))
  285. runq_weight1[listid] = len(revdeps)
  286. bb.msg.note(2, bb.msg.domain.RunQueue, "Compute totals (have %s endpoint(s))" % len(endpoints))
  287. while 1:
  288. next_points = []
  289. for listid in endpoints:
  290. for revdep in self.runq_depends[listid]:
  291. self.runq_weight[revdep] = self.runq_weight[revdep] + self.runq_weight[listid]
  292. runq_weight1[revdep] = runq_weight1[revdep] - 1
  293. if runq_weight1[revdep] == 0:
  294. next_points.append(revdep)
  295. runq_done[revdep] = 1
  296. endpoints = next_points
  297. if len(next_points) == 0:
  298. break
  299. # Sanity Checks
  300. for task in range(len(self.runq_fnid)):
  301. if runq_done[task] == 0:
  302. seen = []
  303. deps_seen = []
  304. def print_chain(taskid, finish):
  305. seen.append(taskid)
  306. for revdep in self.runq_revdeps[taskid]:
  307. if runq_done[revdep] == 0 and revdep not in seen and not finish:
  308. bb.msg.error(bb.msg.domain.RunQueue, "Task %s (%s) (depends: %s)" % (revdep, self.get_user_idstring(revdep), self.runq_depends[revdep]))
  309. if revdep in deps_seen:
  310. bb.msg.error(bb.msg.domain.RunQueue, "Chain ends at Task %s (%s)" % (revdep, self.get_user_idstring(revdep)))
  311. finish = True
  312. return
  313. for dep in self.runq_depends[revdep]:
  314. deps_seen.append(dep)
  315. print_chain(revdep, finish)
  316. print_chain(task, False)
  317. 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)))
  318. if runq_weight1[task] != 0:
  319. bb.msg.fatal(bb.msg.domain.RunQueue, "Task %s (%s) count not zero!" % (task, self.get_user_idstring(task)))
  320. # Check for mulitple taska building the same provider
  321. prov_list = {}
  322. seen_fn = []
  323. for task in range(len(self.runq_fnid)):
  324. fn = taskData.fn_index[self.runq_fnid[task]]
  325. if fn in seen_fn:
  326. continue
  327. seen_fn.append(fn)
  328. for prov in self.dataCache.fn_provides[fn]:
  329. if prov not in prov_list:
  330. prov_list[prov] = [fn]
  331. elif fn not in prov_list[prov]:
  332. prov_list[prov].append(fn)
  333. error = False
  334. for prov in prov_list:
  335. if len(prov_list[prov]) > 1 and prov not in self.multi_provider_whitelist:
  336. error = True
  337. bb.msg.error(bb.msg.domain.RunQueue, "Multiple files due to be built which all provide %s (%s)" % (prov, " ".join(prov_list[prov])))
  338. #if error:
  339. # bb.msg.fatal(bb.msg.domain.RunQueue, "Corrupted metadata configuration detected, aborting...")
  340. # Make a weight sorted map
  341. from copy import deepcopy
  342. sortweight = deepcopy(self.runq_weight)
  343. sortweight.sort()
  344. copyweight = deepcopy(self.runq_weight)
  345. self.prio_map = []
  346. for weight in sortweight:
  347. idx = copyweight.index(weight)
  348. self.prio_map.append(idx)
  349. copyweight[idx] = -1
  350. self.prio_map.reverse()
  351. #self.dump_data(taskData)
  352. def execute_runqueue(self):
  353. """
  354. Run the tasks in a queue prepared by prepare_runqueue
  355. Upon failure, optionally try to recover the build using any alternate providers
  356. (if the abort on failure configuration option isn't set)
  357. """
  358. failures = 0
  359. while 1:
  360. failed_fnids = []
  361. try:
  362. self.execute_runqueue_internal()
  363. finally:
  364. if self.master_process:
  365. failed_fnids = self.finish_runqueue()
  366. if len(failed_fnids) == 0:
  367. return failures
  368. if self.taskData.abort:
  369. raise bb.runqueue.TaskFailure(failed_fnids)
  370. for fnid in failed_fnids:
  371. #print "Failure: %s %s %s" % (fnid, self.taskData.fn_index[fnid], self.runq_task[fnid])
  372. self.taskData.fail_fnid(fnid)
  373. failures = failures + 1
  374. self.reset_runqueue()
  375. self.prepare_runqueue()
  376. def execute_runqueue_initVars(self):
  377. self.stats = RunQueueStats()
  378. self.active_builds = 0
  379. self.runq_buildable = []
  380. self.runq_running = []
  381. self.runq_complete = []
  382. self.build_pids = {}
  383. self.failed_fnids = []
  384. self.master_process = True
  385. # Mark initial buildable tasks
  386. for task in range(len(self.runq_fnid)):
  387. self.runq_running.append(0)
  388. self.runq_complete.append(0)
  389. if len(self.runq_depends[task]) == 0:
  390. self.runq_buildable.append(1)
  391. else:
  392. self.runq_buildable.append(0)
  393. def task_complete(self, task):
  394. """
  395. Mark a task as completed
  396. Look at the reverse dependencies and mark any task with
  397. completed dependencies as buildable
  398. """
  399. self.runq_complete[task] = 1
  400. for revdep in self.runq_revdeps[task]:
  401. if self.runq_running[revdep] == 1:
  402. continue
  403. if self.runq_buildable[revdep] == 1:
  404. continue
  405. alldeps = 1
  406. for dep in self.runq_depends[revdep]:
  407. if self.runq_complete[dep] != 1:
  408. alldeps = 0
  409. if alldeps == 1:
  410. self.runq_buildable[revdep] = 1
  411. fn = self.taskData.fn_index[self.runq_fnid[revdep]]
  412. taskname = self.runq_task[revdep]
  413. bb.msg.debug(1, bb.msg.domain.RunQueue, "Marking task %s (%s, %s) as buildable" % (revdep, fn, taskname))
  414. def get_next_task(self):
  415. """
  416. Return the id of the highest priority task that is buildable
  417. """
  418. for task1 in range(len(self.runq_fnid)):
  419. task = self.prio_map[task1]
  420. if self.runq_running[task] == 1:
  421. continue
  422. if self.runq_buildable[task] == 1:
  423. return task
  424. return None
  425. def execute_runqueue_internal(self):
  426. """
  427. Run the tasks in a queue prepared by prepare_runqueue
  428. """
  429. bb.msg.note(1, bb.msg.domain.RunQueue, "Executing runqueue")
  430. self.execute_runqueue_initVars()
  431. if len(self.runq_fnid) == 0:
  432. # nothing to do
  433. return []
  434. def sigint_handler(signum, frame):
  435. raise KeyboardInterrupt
  436. # Find any tasks with current stamps and remove them from the queue
  437. for task1 in range(len(self.runq_fnid)):
  438. task = self.prio_map[task1]
  439. fn = self.taskData.fn_index[self.runq_fnid[task]]
  440. taskname = self.runq_task[task]
  441. if bb.build.stamp_is_current(taskname, self.dataCache, fn):
  442. bb.msg.debug(2, bb.msg.domain.RunQueue, "Stamp current task %s (%s)" % (task, self.get_user_idstring(task)))
  443. self.runq_running[task] = 1
  444. self.task_complete(task)
  445. self.stats.taskCompleted()
  446. self.stats.taskSkipped()
  447. while True:
  448. task = self.get_next_task()
  449. if task is not None:
  450. fn = self.taskData.fn_index[self.runq_fnid[task]]
  451. taskname = self.runq_task[task]
  452. if bb.build.stamp_is_current(taskname, self.dataCache, fn):
  453. bb.msg.debug(2, bb.msg.domain.RunQueue, "Stamp current task %s (%s)" % (task, self.get_user_idstring(task)))
  454. self.runq_running[task] = 1
  455. self.task_complete(task)
  456. self.stats.taskCompleted()
  457. self.stats.taskSkipped()
  458. continue
  459. 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)))
  460. try:
  461. pid = os.fork()
  462. except OSError, e:
  463. bb.msg.fatal(bb.msg.domain.RunQueue, "fork failed: %d (%s)" % (e.errno, e.strerror))
  464. if pid == 0:
  465. # Bypass master process' handling
  466. self.master_process = False
  467. # Stop Ctrl+C being sent to children
  468. # signal.signal(signal.SIGINT, signal.SIG_IGN)
  469. # Make the child the process group leader
  470. os.setpgid(0, 0)
  471. newsi = os.open('/dev/null', os.O_RDWR)
  472. os.dup2(newsi, sys.stdin.fileno())
  473. self.cooker.configuration.cmd = taskname[3:]
  474. try:
  475. self.cooker.tryBuild(fn, False)
  476. except bb.build.EventException:
  477. bb.msg.error(bb.msg.domain.Build, "Build of " + fn + " " + taskname + " failed")
  478. sys.exit(1)
  479. except:
  480. bb.msg.error(bb.msg.domain.Build, "Build of " + fn + " " + taskname + " failed")
  481. raise
  482. sys.exit(0)
  483. self.build_pids[pid] = task
  484. self.runq_running[task] = 1
  485. self.active_builds = self.active_builds + 1
  486. if self.active_builds < self.number_tasks:
  487. continue
  488. if self.active_builds > 0:
  489. result = os.waitpid(-1, 0)
  490. self.active_builds = self.active_builds - 1
  491. task = self.build_pids[result[0]]
  492. if result[1] != 0:
  493. del self.build_pids[result[0]]
  494. bb.msg.error(bb.msg.domain.RunQueue, "Task %s (%s) failed" % (task, self.get_user_idstring(task)))
  495. self.failed_fnids.append(self.runq_fnid[task])
  496. self.stats.taskFailed()
  497. break
  498. self.task_complete(task)
  499. self.stats.taskCompleted()
  500. del self.build_pids[result[0]]
  501. continue
  502. return
  503. def finish_runqueue(self):
  504. try:
  505. while self.active_builds > 0:
  506. bb.msg.note(1, bb.msg.domain.RunQueue, "Waiting for %s active tasks to finish" % self.active_builds)
  507. tasknum = 1
  508. for k, v in self.build_pids.iteritems():
  509. bb.msg.note(1, bb.msg.domain.RunQueue, "%s: %s (%s)" % (tasknum, self.get_user_idstring(v), k))
  510. tasknum = tasknum + 1
  511. result = os.waitpid(-1, 0)
  512. task = self.build_pids[result[0]]
  513. if result[1] != 0:
  514. bb.msg.error(bb.msg.domain.RunQueue, "Task %s (%s) failed" % (task, self.get_user_idstring(task)))
  515. self.failed_fnids.append(self.runq_fnid[task])
  516. self.stats.taskFailed()
  517. del self.build_pids[result[0]]
  518. self.active_builds = self.active_builds - 1
  519. 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))
  520. return self.failed_fnids
  521. except KeyboardInterrupt:
  522. bb.msg.note(1, bb.msg.domain.RunQueue, "Sending SIGINT to remaining %s tasks" % self.active_builds)
  523. for k, v in self.build_pids.iteritems():
  524. try:
  525. os.kill(-k, signal.SIGINT)
  526. except:
  527. pass
  528. raise
  529. # Sanity Checks
  530. for task in range(len(self.runq_fnid)):
  531. if self.runq_buildable[task] == 0:
  532. bb.msg.error(bb.msg.domain.RunQueue, "Task %s never buildable!" % task)
  533. if self.runq_running[task] == 0:
  534. bb.msg.error(bb.msg.domain.RunQueue, "Task %s never ran!" % task)
  535. if self.runq_complete[task] == 0:
  536. bb.msg.error(bb.msg.domain.RunQueue, "Task %s never completed!" % task)
  537. 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))
  538. return self.failed_fnids
  539. def dump_data(self, taskQueue):
  540. """
  541. Dump some debug information on the internal data structures
  542. """
  543. bb.msg.debug(3, bb.msg.domain.RunQueue, "run_tasks:")
  544. for task in range(len(self.runq_fnid)):
  545. bb.msg.debug(3, bb.msg.domain.RunQueue, " (%s)%s - %s: %s Deps %s RevDeps %s" % (task,
  546. taskQueue.fn_index[self.runq_fnid[task]],
  547. self.runq_task[task],
  548. self.runq_weight[task],
  549. self.runq_depends[task],
  550. self.runq_revdeps[task]))
  551. bb.msg.debug(3, bb.msg.domain.RunQueue, "sorted_tasks:")
  552. for task1 in range(len(self.runq_fnid)):
  553. if task1 in self.prio_map:
  554. task = self.prio_map[task1]
  555. bb.msg.debug(3, bb.msg.domain.RunQueue, " (%s)%s - %s: %s Deps %s RevDeps %s" % (task,
  556. taskQueue.fn_index[self.runq_fnid[task]],
  557. self.runq_task[task],
  558. self.runq_weight[task],
  559. self.runq_depends[task],
  560. self.runq_revdeps[task]))