runqueue.py 106 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617
  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. import copy
  23. import os
  24. import sys
  25. import signal
  26. import stat
  27. import fcntl
  28. import errno
  29. import logging
  30. import re
  31. import bb
  32. from bb import msg, data, event
  33. from bb import monitordisk
  34. import subprocess
  35. import pickle
  36. from multiprocessing import Process
  37. bblogger = logging.getLogger("BitBake")
  38. logger = logging.getLogger("BitBake.RunQueue")
  39. __find_md5__ = re.compile( r'(?i)(?<![a-z0-9])[a-f0-9]{32}(?![a-z0-9])' )
  40. def fn_from_tid(tid):
  41. return tid.rsplit(":", 1)[0]
  42. def taskname_from_tid(tid):
  43. return tid.rsplit(":", 1)[1]
  44. def split_tid(tid):
  45. (mc, fn, taskname, _) = split_tid_mcfn(tid)
  46. return (mc, fn, taskname)
  47. def split_tid_mcfn(tid):
  48. if tid.startswith('multiconfig:'):
  49. elems = tid.split(':')
  50. mc = elems[1]
  51. fn = ":".join(elems[2:-1])
  52. taskname = elems[-1]
  53. mcfn = "multiconfig:" + mc + ":" + fn
  54. else:
  55. tid = tid.rsplit(":", 1)
  56. mc = ""
  57. fn = tid[0]
  58. taskname = tid[1]
  59. mcfn = fn
  60. return (mc, fn, taskname, mcfn)
  61. def build_tid(mc, fn, taskname):
  62. if mc:
  63. return "multiconfig:" + mc + ":" + fn + ":" + taskname
  64. return fn + ":" + taskname
  65. class RunQueueStats:
  66. """
  67. Holds statistics on the tasks handled by the associated runQueue
  68. """
  69. def __init__(self, total):
  70. self.completed = 0
  71. self.skipped = 0
  72. self.failed = 0
  73. self.active = 0
  74. self.total = total
  75. def copy(self):
  76. obj = self.__class__(self.total)
  77. obj.__dict__.update(self.__dict__)
  78. return obj
  79. def taskFailed(self):
  80. self.active = self.active - 1
  81. self.failed = self.failed + 1
  82. def taskCompleted(self, number = 1):
  83. self.active = self.active - number
  84. self.completed = self.completed + number
  85. def taskSkipped(self, number = 1):
  86. self.active = self.active + number
  87. self.skipped = self.skipped + number
  88. def taskActive(self):
  89. self.active = self.active + 1
  90. # These values indicate the next step due to be run in the
  91. # runQueue state machine
  92. runQueuePrepare = 2
  93. runQueueSceneInit = 3
  94. runQueueSceneRun = 4
  95. runQueueRunInit = 5
  96. runQueueRunning = 6
  97. runQueueFailed = 7
  98. runQueueCleanUp = 8
  99. runQueueComplete = 9
  100. class RunQueueScheduler(object):
  101. """
  102. Control the order tasks are scheduled in.
  103. """
  104. name = "basic"
  105. def __init__(self, runqueue, rqdata):
  106. """
  107. The default scheduler just returns the first buildable task (the
  108. priority map is sorted by task number)
  109. """
  110. self.rq = runqueue
  111. self.rqdata = rqdata
  112. self.numTasks = len(self.rqdata.runtaskentries)
  113. self.prio_map = [self.rqdata.runtaskentries.keys()]
  114. self.buildable = []
  115. self.stamps = {}
  116. for tid in self.rqdata.runtaskentries:
  117. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  118. self.stamps[tid] = bb.build.stampfile(taskname, self.rqdata.dataCaches[mc], taskfn, noextra=True)
  119. if tid in self.rq.runq_buildable:
  120. self.buildable.append(tid)
  121. self.rev_prio_map = None
  122. def next_buildable_task(self):
  123. """
  124. Return the id of the first task we find that is buildable
  125. """
  126. self.buildable = [x for x in self.buildable if x not in self.rq.runq_running]
  127. if not self.buildable:
  128. return None
  129. if len(self.buildable) == 1:
  130. tid = self.buildable[0]
  131. stamp = self.stamps[tid]
  132. if stamp not in self.rq.build_stamps.values():
  133. return tid
  134. if not self.rev_prio_map:
  135. self.rev_prio_map = {}
  136. for tid in self.rqdata.runtaskentries:
  137. self.rev_prio_map[tid] = self.prio_map.index(tid)
  138. best = None
  139. bestprio = None
  140. for tid in self.buildable:
  141. prio = self.rev_prio_map[tid]
  142. if bestprio is None or bestprio > prio:
  143. stamp = self.stamps[tid]
  144. if stamp in self.rq.build_stamps.values():
  145. continue
  146. bestprio = prio
  147. best = tid
  148. return best
  149. def next(self):
  150. """
  151. Return the id of the task we should build next
  152. """
  153. if self.rq.stats.active < self.rq.number_tasks:
  154. return self.next_buildable_task()
  155. def newbuilable(self, task):
  156. self.buildable.append(task)
  157. def describe_task(self, taskid):
  158. result = 'ID %s' % taskid
  159. if self.rev_prio_map:
  160. result = result + (' pri %d' % self.rev_prio_map[taskid])
  161. return result
  162. def dump_prio(self, comment):
  163. bb.debug(3, '%s (most important first):\n%s' %
  164. (comment,
  165. '\n'.join(['%d. %s' % (index + 1, self.describe_task(taskid)) for
  166. index, taskid in enumerate(self.prio_map)])))
  167. class RunQueueSchedulerSpeed(RunQueueScheduler):
  168. """
  169. A scheduler optimised for speed. The priority map is sorted by task weight,
  170. heavier weighted tasks (tasks needed by the most other tasks) are run first.
  171. """
  172. name = "speed"
  173. def __init__(self, runqueue, rqdata):
  174. """
  175. The priority map is sorted by task weight.
  176. """
  177. RunQueueScheduler.__init__(self, runqueue, rqdata)
  178. weights = {}
  179. for tid in self.rqdata.runtaskentries:
  180. weight = self.rqdata.runtaskentries[tid].weight
  181. if not weight in weights:
  182. weights[weight] = []
  183. weights[weight].append(tid)
  184. self.prio_map = []
  185. for weight in sorted(weights):
  186. for w in weights[weight]:
  187. self.prio_map.append(w)
  188. self.prio_map.reverse()
  189. class RunQueueSchedulerCompletion(RunQueueSchedulerSpeed):
  190. """
  191. A scheduler optimised to complete .bb files as quickly as possible. The
  192. priority map is sorted by task weight, but then reordered so once a given
  193. .bb file starts to build, it's completed as quickly as possible by
  194. running all tasks related to the same .bb file one after the after.
  195. This works well where disk space is at a premium and classes like OE's
  196. rm_work are in force.
  197. """
  198. name = "completion"
  199. def __init__(self, runqueue, rqdata):
  200. super(RunQueueSchedulerCompletion, self).__init__(runqueue, rqdata)
  201. # Extract list of tasks for each recipe, with tasks sorted
  202. # ascending from "must run first" (typically do_fetch) to
  203. # "runs last" (do_build). The speed scheduler prioritizes
  204. # tasks that must run first before the ones that run later;
  205. # this is what we depend on here.
  206. task_lists = {}
  207. for taskid in self.prio_map:
  208. fn, taskname = taskid.rsplit(':', 1)
  209. task_lists.setdefault(fn, []).append(taskname)
  210. # Now unify the different task lists. The strategy is that
  211. # common tasks get skipped and new ones get inserted after the
  212. # preceeding common one(s) as they are found. Because task
  213. # lists should differ only by their number of tasks, but not
  214. # the ordering of the common tasks, this should result in a
  215. # deterministic result that is a superset of the individual
  216. # task ordering.
  217. all_tasks = []
  218. for recipe, new_tasks in task_lists.items():
  219. index = 0
  220. old_task = all_tasks[index] if index < len(all_tasks) else None
  221. for new_task in new_tasks:
  222. if old_task == new_task:
  223. # Common task, skip it. This is the fast-path which
  224. # avoids a full search.
  225. index += 1
  226. old_task = all_tasks[index] if index < len(all_tasks) else None
  227. else:
  228. try:
  229. index = all_tasks.index(new_task)
  230. # Already present, just not at the current
  231. # place. We re-synchronized by changing the
  232. # index so that it matches again. Now
  233. # move on to the next existing task.
  234. index += 1
  235. old_task = all_tasks[index] if index < len(all_tasks) else None
  236. except ValueError:
  237. # Not present. Insert before old_task, which
  238. # remains the same (but gets shifted back).
  239. all_tasks.insert(index, new_task)
  240. index += 1
  241. bb.debug(3, 'merged task list: %s' % all_tasks)
  242. # Now reverse the order so that tasks that finish the work on one
  243. # recipe are considered more imporant (= come first). The ordering
  244. # is now so that do_build is most important.
  245. all_tasks.reverse()
  246. # Group tasks of the same kind before tasks of less important
  247. # kinds at the head of the queue (because earlier = lower
  248. # priority number = runs earlier), while preserving the
  249. # ordering by recipe. If recipe foo is more important than
  250. # bar, then the goal is to work on foo's do_populate_sysroot
  251. # before bar's do_populate_sysroot and on the more important
  252. # tasks of foo before any of the less important tasks in any
  253. # other recipe (if those other recipes are more important than
  254. # foo).
  255. #
  256. # All of this only applies when tasks are runable. Explicit
  257. # dependencies still override this ordering by priority.
  258. #
  259. # Here's an example why this priority re-ordering helps with
  260. # minimizing disk usage. Consider a recipe foo with a higher
  261. # priority than bar where foo DEPENDS on bar. Then the
  262. # implicit rule (from base.bbclass) is that foo's do_configure
  263. # depends on bar's do_populate_sysroot. This ensures that
  264. # bar's do_populate_sysroot gets done first. Normally the
  265. # tasks from foo would continue to run once that is done, and
  266. # bar only gets completed and cleaned up later. By ordering
  267. # bar's task that depend on bar's do_populate_sysroot before foo's
  268. # do_configure, that problem gets avoided.
  269. task_index = 0
  270. self.dump_prio('original priorities')
  271. for task in all_tasks:
  272. for index in range(task_index, self.numTasks):
  273. taskid = self.prio_map[index]
  274. taskname = taskid.rsplit(':', 1)[1]
  275. if taskname == task:
  276. del self.prio_map[index]
  277. self.prio_map.insert(task_index, taskid)
  278. task_index += 1
  279. self.dump_prio('completion priorities')
  280. class RunTaskEntry(object):
  281. def __init__(self):
  282. self.depends = set()
  283. self.revdeps = set()
  284. self.hash = None
  285. self.task = None
  286. self.weight = 1
  287. class RunQueueData:
  288. """
  289. BitBake Run Queue implementation
  290. """
  291. def __init__(self, rq, cooker, cfgData, dataCaches, taskData, targets):
  292. self.cooker = cooker
  293. self.dataCaches = dataCaches
  294. self.taskData = taskData
  295. self.targets = targets
  296. self.rq = rq
  297. self.warn_multi_bb = False
  298. self.stampwhitelist = cfgData.getVar("BB_STAMP_WHITELIST") or ""
  299. self.multi_provider_whitelist = (cfgData.getVar("MULTI_PROVIDER_WHITELIST") or "").split()
  300. self.setscenewhitelist = get_setscene_enforce_whitelist(cfgData)
  301. self.setscenewhitelist_checked = False
  302. self.setscene_enforce = (cfgData.getVar('BB_SETSCENE_ENFORCE') == "1")
  303. self.init_progress_reporter = bb.progress.DummyMultiStageProcessProgressReporter()
  304. self.reset()
  305. def reset(self):
  306. self.runtaskentries = {}
  307. def runq_depends_names(self, ids):
  308. import re
  309. ret = []
  310. for id in ids:
  311. nam = os.path.basename(id)
  312. nam = re.sub("_[^,]*,", ",", nam)
  313. ret.extend([nam])
  314. return ret
  315. def get_task_hash(self, tid):
  316. return self.runtaskentries[tid].hash
  317. def get_user_idstring(self, tid, task_name_suffix = ""):
  318. return tid + task_name_suffix
  319. def get_short_user_idstring(self, task, task_name_suffix = ""):
  320. (mc, fn, taskname, taskfn) = split_tid_mcfn(task)
  321. pn = self.dataCaches[mc].pkg_fn[taskfn]
  322. taskname = taskname_from_tid(task) + task_name_suffix
  323. return "%s:%s" % (pn, taskname)
  324. def circular_depchains_handler(self, tasks):
  325. """
  326. Some tasks aren't buildable, likely due to circular dependency issues.
  327. Identify the circular dependencies and print them in a user readable format.
  328. """
  329. from copy import deepcopy
  330. valid_chains = []
  331. explored_deps = {}
  332. msgs = []
  333. def chain_reorder(chain):
  334. """
  335. Reorder a dependency chain so the lowest task id is first
  336. """
  337. lowest = 0
  338. new_chain = []
  339. for entry in range(len(chain)):
  340. if chain[entry] < chain[lowest]:
  341. lowest = entry
  342. new_chain.extend(chain[lowest:])
  343. new_chain.extend(chain[:lowest])
  344. return new_chain
  345. def chain_compare_equal(chain1, chain2):
  346. """
  347. Compare two dependency chains and see if they're the same
  348. """
  349. if len(chain1) != len(chain2):
  350. return False
  351. for index in range(len(chain1)):
  352. if chain1[index] != chain2[index]:
  353. return False
  354. return True
  355. def chain_array_contains(chain, chain_array):
  356. """
  357. Return True if chain_array contains chain
  358. """
  359. for ch in chain_array:
  360. if chain_compare_equal(ch, chain):
  361. return True
  362. return False
  363. def find_chains(tid, prev_chain):
  364. prev_chain.append(tid)
  365. total_deps = []
  366. total_deps.extend(self.runtaskentries[tid].revdeps)
  367. for revdep in self.runtaskentries[tid].revdeps:
  368. if revdep in prev_chain:
  369. idx = prev_chain.index(revdep)
  370. # To prevent duplicates, reorder the chain to start with the lowest taskid
  371. # and search through an array of those we've already printed
  372. chain = prev_chain[idx:]
  373. new_chain = chain_reorder(chain)
  374. if not chain_array_contains(new_chain, valid_chains):
  375. valid_chains.append(new_chain)
  376. msgs.append("Dependency loop #%d found:\n" % len(valid_chains))
  377. for dep in new_chain:
  378. msgs.append(" Task %s (dependent Tasks %s)\n" % (dep, self.runq_depends_names(self.runtaskentries[dep].depends)))
  379. msgs.append("\n")
  380. if len(valid_chains) > 10:
  381. msgs.append("Aborted dependency loops search after 10 matches.\n")
  382. return msgs
  383. continue
  384. scan = False
  385. if revdep not in explored_deps:
  386. scan = True
  387. elif revdep in explored_deps[revdep]:
  388. scan = True
  389. else:
  390. for dep in prev_chain:
  391. if dep in explored_deps[revdep]:
  392. scan = True
  393. if scan:
  394. find_chains(revdep, copy.deepcopy(prev_chain))
  395. for dep in explored_deps[revdep]:
  396. if dep not in total_deps:
  397. total_deps.append(dep)
  398. explored_deps[tid] = total_deps
  399. for task in tasks:
  400. find_chains(task, [])
  401. return msgs
  402. def calculate_task_weights(self, endpoints):
  403. """
  404. Calculate a number representing the "weight" of each task. Heavier weighted tasks
  405. have more dependencies and hence should be executed sooner for maximum speed.
  406. This function also sanity checks the task list finding tasks that are not
  407. possible to execute due to circular dependencies.
  408. """
  409. numTasks = len(self.runtaskentries)
  410. weight = {}
  411. deps_left = {}
  412. task_done = {}
  413. for tid in self.runtaskentries:
  414. task_done[tid] = False
  415. weight[tid] = 1
  416. deps_left[tid] = len(self.runtaskentries[tid].revdeps)
  417. for tid in endpoints:
  418. weight[tid] = 10
  419. task_done[tid] = True
  420. while True:
  421. next_points = []
  422. for tid in endpoints:
  423. for revdep in self.runtaskentries[tid].depends:
  424. weight[revdep] = weight[revdep] + weight[tid]
  425. deps_left[revdep] = deps_left[revdep] - 1
  426. if deps_left[revdep] == 0:
  427. next_points.append(revdep)
  428. task_done[revdep] = True
  429. endpoints = next_points
  430. if len(next_points) == 0:
  431. break
  432. # Circular dependency sanity check
  433. problem_tasks = []
  434. for tid in self.runtaskentries:
  435. if task_done[tid] is False or deps_left[tid] != 0:
  436. problem_tasks.append(tid)
  437. logger.debug(2, "Task %s is not buildable", tid)
  438. logger.debug(2, "(Complete marker was %s and the remaining dependency count was %s)\n", task_done[tid], deps_left[tid])
  439. self.runtaskentries[tid].weight = weight[tid]
  440. if problem_tasks:
  441. message = "%s unbuildable tasks were found.\n" % len(problem_tasks)
  442. message = message + "These are usually caused by circular dependencies and any circular dependency chains found will be printed below. Increase the debug level to see a list of unbuildable tasks.\n\n"
  443. message = message + "Identifying dependency loops (this may take a short while)...\n"
  444. logger.error(message)
  445. msgs = self.circular_depchains_handler(problem_tasks)
  446. message = "\n"
  447. for msg in msgs:
  448. message = message + msg
  449. bb.msg.fatal("RunQueue", message)
  450. return weight
  451. def prepare(self):
  452. """
  453. Turn a set of taskData into a RunQueue and compute data needed
  454. to optimise the execution order.
  455. """
  456. runq_build = {}
  457. recursivetasks = {}
  458. recursiveitasks = {}
  459. recursivetasksselfref = set()
  460. taskData = self.taskData
  461. found = False
  462. for mc in self.taskData:
  463. if len(taskData[mc].taskentries) > 0:
  464. found = True
  465. break
  466. if not found:
  467. # Nothing to do
  468. return 0
  469. self.init_progress_reporter.start()
  470. self.init_progress_reporter.next_stage()
  471. # Step A - Work out a list of tasks to run
  472. #
  473. # Taskdata gives us a list of possible providers for every build and run
  474. # target ordered by priority. It also gives information on each of those
  475. # providers.
  476. #
  477. # To create the actual list of tasks to execute we fix the list of
  478. # providers and then resolve the dependencies into task IDs. This
  479. # process is repeated for each type of dependency (tdepends, deptask,
  480. # rdeptast, recrdeptask, idepends).
  481. def add_build_dependencies(depids, tasknames, depends, mc):
  482. for depname in depids:
  483. # Won't be in build_targets if ASSUME_PROVIDED
  484. if depname not in taskData[mc].build_targets or not taskData[mc].build_targets[depname]:
  485. continue
  486. depdata = taskData[mc].build_targets[depname][0]
  487. if depdata is None:
  488. continue
  489. for taskname in tasknames:
  490. t = depdata + ":" + taskname
  491. if t in taskData[mc].taskentries:
  492. depends.add(t)
  493. def add_runtime_dependencies(depids, tasknames, depends, mc):
  494. for depname in depids:
  495. if depname not in taskData[mc].run_targets or not taskData[mc].run_targets[depname]:
  496. continue
  497. depdata = taskData[mc].run_targets[depname][0]
  498. if depdata is None:
  499. continue
  500. for taskname in tasknames:
  501. t = depdata + ":" + taskname
  502. if t in taskData[mc].taskentries:
  503. depends.add(t)
  504. def add_resolved_dependencies(mc, fn, tasknames, depends):
  505. for taskname in tasknames:
  506. tid = build_tid(mc, fn, taskname)
  507. if tid in self.runtaskentries:
  508. depends.add(tid)
  509. for mc in taskData:
  510. for tid in taskData[mc].taskentries:
  511. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  512. #runtid = build_tid(mc, fn, taskname)
  513. #logger.debug(2, "Processing %s,%s:%s", mc, fn, taskname)
  514. depends = set()
  515. task_deps = self.dataCaches[mc].task_deps[taskfn]
  516. self.runtaskentries[tid] = RunTaskEntry()
  517. if fn in taskData[mc].failed_fns:
  518. continue
  519. # Resolve task internal dependencies
  520. #
  521. # e.g. addtask before X after Y
  522. for t in taskData[mc].taskentries[tid].tdepends:
  523. (_, depfn, deptaskname, _) = split_tid_mcfn(t)
  524. depends.add(build_tid(mc, depfn, deptaskname))
  525. # Resolve 'deptask' dependencies
  526. #
  527. # e.g. do_sometask[deptask] = "do_someothertask"
  528. # (makes sure sometask runs after someothertask of all DEPENDS)
  529. if 'deptask' in task_deps and taskname in task_deps['deptask']:
  530. tasknames = task_deps['deptask'][taskname].split()
  531. add_build_dependencies(taskData[mc].depids[taskfn], tasknames, depends, mc)
  532. # Resolve 'rdeptask' dependencies
  533. #
  534. # e.g. do_sometask[rdeptask] = "do_someothertask"
  535. # (makes sure sometask runs after someothertask of all RDEPENDS)
  536. if 'rdeptask' in task_deps and taskname in task_deps['rdeptask']:
  537. tasknames = task_deps['rdeptask'][taskname].split()
  538. add_runtime_dependencies(taskData[mc].rdepids[taskfn], tasknames, depends, mc)
  539. # Resolve inter-task dependencies
  540. #
  541. # e.g. do_sometask[depends] = "targetname:do_someothertask"
  542. # (makes sure sometask runs after targetname's someothertask)
  543. idepends = taskData[mc].taskentries[tid].idepends
  544. for (depname, idependtask) in idepends:
  545. if depname in taskData[mc].build_targets and taskData[mc].build_targets[depname] and not depname in taskData[mc].failed_deps:
  546. # Won't be in build_targets if ASSUME_PROVIDED
  547. depdata = taskData[mc].build_targets[depname][0]
  548. if depdata is not None:
  549. t = depdata + ":" + idependtask
  550. depends.add(t)
  551. if t not in taskData[mc].taskentries:
  552. bb.msg.fatal("RunQueue", "Task %s in %s depends upon non-existent task %s in %s" % (taskname, fn, idependtask, depdata))
  553. irdepends = taskData[mc].taskentries[tid].irdepends
  554. for (depname, idependtask) in irdepends:
  555. if depname in taskData[mc].run_targets:
  556. # Won't be in run_targets if ASSUME_PROVIDED
  557. if not taskData[mc].run_targets[depname]:
  558. continue
  559. depdata = taskData[mc].run_targets[depname][0]
  560. if depdata is not None:
  561. t = depdata + ":" + idependtask
  562. depends.add(t)
  563. if t not in taskData[mc].taskentries:
  564. bb.msg.fatal("RunQueue", "Task %s in %s rdepends upon non-existent task %s in %s" % (taskname, fn, idependtask, depdata))
  565. # Resolve recursive 'recrdeptask' dependencies (Part A)
  566. #
  567. # e.g. do_sometask[recrdeptask] = "do_someothertask"
  568. # (makes sure sometask runs after someothertask of all DEPENDS, RDEPENDS and intertask dependencies, recursively)
  569. # We cover the recursive part of the dependencies below
  570. if 'recrdeptask' in task_deps and taskname in task_deps['recrdeptask']:
  571. tasknames = task_deps['recrdeptask'][taskname].split()
  572. recursivetasks[tid] = tasknames
  573. add_build_dependencies(taskData[mc].depids[taskfn], tasknames, depends, mc)
  574. add_runtime_dependencies(taskData[mc].rdepids[taskfn], tasknames, depends, mc)
  575. if taskname in tasknames:
  576. recursivetasksselfref.add(tid)
  577. if 'recideptask' in task_deps and taskname in task_deps['recideptask']:
  578. recursiveitasks[tid] = []
  579. for t in task_deps['recideptask'][taskname].split():
  580. newdep = build_tid(mc, fn, t)
  581. recursiveitasks[tid].append(newdep)
  582. self.runtaskentries[tid].depends = depends
  583. #self.dump_data()
  584. # Resolve recursive 'recrdeptask' dependencies (Part B)
  585. #
  586. # e.g. do_sometask[recrdeptask] = "do_someothertask"
  587. # (makes sure sometask runs after someothertask of all DEPENDS, RDEPENDS and intertask dependencies, recursively)
  588. # We need to do this separately since we need all of runtaskentries[*].depends to be complete before this is processed
  589. self.init_progress_reporter.next_stage(len(recursivetasks))
  590. extradeps = {}
  591. for taskcounter, tid in enumerate(recursivetasks):
  592. extradeps[tid] = set(self.runtaskentries[tid].depends)
  593. tasknames = recursivetasks[tid]
  594. seendeps = set()
  595. def generate_recdeps(t):
  596. newdeps = set()
  597. (mc, fn, taskname, _) = split_tid_mcfn(t)
  598. add_resolved_dependencies(mc, fn, tasknames, newdeps)
  599. extradeps[tid].update(newdeps)
  600. seendeps.add(t)
  601. newdeps.add(t)
  602. for i in newdeps:
  603. if i not in self.runtaskentries:
  604. # Not all recipes might have the recrdeptask task as a task
  605. continue
  606. task = self.runtaskentries[i].task
  607. for n in self.runtaskentries[i].depends:
  608. if n not in seendeps:
  609. generate_recdeps(n)
  610. generate_recdeps(tid)
  611. if tid in recursiveitasks:
  612. for dep in recursiveitasks[tid]:
  613. generate_recdeps(dep)
  614. self.init_progress_reporter.update(taskcounter)
  615. # Remove circular references so that do_a[recrdeptask] = "do_a do_b" can work
  616. for tid in recursivetasks:
  617. extradeps[tid].difference_update(recursivetasksselfref)
  618. for tid in self.runtaskentries:
  619. task = self.runtaskentries[tid].task
  620. # Add in extra dependencies
  621. if tid in extradeps:
  622. self.runtaskentries[tid].depends = extradeps[tid]
  623. # Remove all self references
  624. if tid in self.runtaskentries[tid].depends:
  625. logger.debug(2, "Task %s contains self reference!", tid)
  626. self.runtaskentries[tid].depends.remove(tid)
  627. self.init_progress_reporter.next_stage()
  628. #self.dump_data()
  629. # Step B - Mark all active tasks
  630. #
  631. # Start with the tasks we were asked to run and mark all dependencies
  632. # as active too. If the task is to be 'forced', clear its stamp. Once
  633. # all active tasks are marked, prune the ones we don't need.
  634. logger.verbose("Marking Active Tasks")
  635. def mark_active(tid, depth):
  636. """
  637. Mark an item as active along with its depends
  638. (calls itself recursively)
  639. """
  640. if tid in runq_build:
  641. return
  642. runq_build[tid] = 1
  643. depends = self.runtaskentries[tid].depends
  644. for depend in depends:
  645. mark_active(depend, depth+1)
  646. self.target_tids = []
  647. for (mc, target, task, fn) in self.targets:
  648. if target not in taskData[mc].build_targets or not taskData[mc].build_targets[target]:
  649. continue
  650. if target in taskData[mc].failed_deps:
  651. continue
  652. parents = False
  653. if task.endswith('-'):
  654. parents = True
  655. task = task[:-1]
  656. if fn in taskData[mc].failed_fns:
  657. continue
  658. # fn already has mc prefix
  659. tid = fn + ":" + task
  660. self.target_tids.append(tid)
  661. if tid not in taskData[mc].taskentries:
  662. import difflib
  663. tasks = []
  664. for x in taskData[mc].taskentries:
  665. if x.startswith(fn + ":"):
  666. tasks.append(taskname_from_tid(x))
  667. close_matches = difflib.get_close_matches(task, tasks, cutoff=0.7)
  668. if close_matches:
  669. extra = ". Close matches:\n %s" % "\n ".join(close_matches)
  670. else:
  671. extra = ""
  672. bb.msg.fatal("RunQueue", "Task %s does not exist for target %s (%s)%s" % (task, target, tid, extra))
  673. # For tasks called "XXXX-", ony run their dependencies
  674. if parents:
  675. for i in self.runtaskentries[tid].depends:
  676. mark_active(i, 1)
  677. else:
  678. mark_active(tid, 1)
  679. self.init_progress_reporter.next_stage()
  680. # Step C - Prune all inactive tasks
  681. #
  682. # Once all active tasks are marked, prune the ones we don't need.
  683. delcount = 0
  684. for tid in list(self.runtaskentries.keys()):
  685. if tid not in runq_build:
  686. del self.runtaskentries[tid]
  687. delcount += 1
  688. self.init_progress_reporter.next_stage()
  689. if self.cooker.configuration.runall is not None:
  690. runall = "do_%s" % self.cooker.configuration.runall
  691. runall_tids = { k: v for k, v in self.runtaskentries.items() if taskname_from_tid(k) == runall }
  692. # re-run the mark_active and then drop unused tasks from new list
  693. runq_build = {}
  694. for tid in list(runall_tids):
  695. mark_active(tid,1)
  696. for tid in list(self.runtaskentries.keys()):
  697. if tid not in runq_build:
  698. del self.runtaskentries[tid]
  699. delcount += 1
  700. if len(self.runtaskentries) == 0:
  701. bb.msg.fatal("RunQueue", "No remaining tasks to run for build target %s with runall %s" % (target, runall))
  702. #
  703. # Step D - Sanity checks and computation
  704. #
  705. # Check to make sure we still have tasks to run
  706. if len(self.runtaskentries) == 0:
  707. if not taskData[''].abort:
  708. bb.msg.fatal("RunQueue", "All buildable tasks have been run but the build is incomplete (--continue mode). Errors for the tasks that failed will have been printed above.")
  709. else:
  710. bb.msg.fatal("RunQueue", "No active tasks and not in --continue mode?! Please report this bug.")
  711. logger.verbose("Pruned %s inactive tasks, %s left", delcount, len(self.runtaskentries))
  712. logger.verbose("Assign Weightings")
  713. self.init_progress_reporter.next_stage()
  714. # Generate a list of reverse dependencies to ease future calculations
  715. for tid in self.runtaskentries:
  716. for dep in self.runtaskentries[tid].depends:
  717. self.runtaskentries[dep].revdeps.add(tid)
  718. self.init_progress_reporter.next_stage()
  719. # Identify tasks at the end of dependency chains
  720. # Error on circular dependency loops (length two)
  721. endpoints = []
  722. for tid in self.runtaskentries:
  723. revdeps = self.runtaskentries[tid].revdeps
  724. if len(revdeps) == 0:
  725. endpoints.append(tid)
  726. for dep in revdeps:
  727. if dep in self.runtaskentries[tid].depends:
  728. bb.msg.fatal("RunQueue", "Task %s has circular dependency on %s" % (tid, dep))
  729. logger.verbose("Compute totals (have %s endpoint(s))", len(endpoints))
  730. self.init_progress_reporter.next_stage()
  731. # Calculate task weights
  732. # Check of higher length circular dependencies
  733. self.runq_weight = self.calculate_task_weights(endpoints)
  734. self.init_progress_reporter.next_stage()
  735. # Sanity Check - Check for multiple tasks building the same provider
  736. for mc in self.dataCaches:
  737. prov_list = {}
  738. seen_fn = []
  739. for tid in self.runtaskentries:
  740. (tidmc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  741. if taskfn in seen_fn:
  742. continue
  743. if mc != tidmc:
  744. continue
  745. seen_fn.append(taskfn)
  746. for prov in self.dataCaches[mc].fn_provides[taskfn]:
  747. if prov not in prov_list:
  748. prov_list[prov] = [taskfn]
  749. elif taskfn not in prov_list[prov]:
  750. prov_list[prov].append(taskfn)
  751. for prov in prov_list:
  752. if len(prov_list[prov]) < 2:
  753. continue
  754. if prov in self.multi_provider_whitelist:
  755. continue
  756. seen_pn = []
  757. # If two versions of the same PN are being built its fatal, we don't support it.
  758. for fn in prov_list[prov]:
  759. pn = self.dataCaches[mc].pkg_fn[fn]
  760. if pn not in seen_pn:
  761. seen_pn.append(pn)
  762. else:
  763. bb.fatal("Multiple versions of %s are due to be built (%s). Only one version of a given PN should be built in any given build. You likely need to set PREFERRED_VERSION_%s to select the correct version or don't depend on multiple versions." % (pn, " ".join(prov_list[prov]), pn))
  764. msg = "Multiple .bb files are due to be built which each provide %s:\n %s" % (prov, "\n ".join(prov_list[prov]))
  765. #
  766. # Construct a list of things which uniquely depend on each provider
  767. # since this may help the user figure out which dependency is triggering this warning
  768. #
  769. msg += "\nA list of tasks depending on these providers is shown and may help explain where the dependency comes from."
  770. deplist = {}
  771. commondeps = None
  772. for provfn in prov_list[prov]:
  773. deps = set()
  774. for tid in self.runtaskentries:
  775. fn = fn_from_tid(tid)
  776. if fn != provfn:
  777. continue
  778. for dep in self.runtaskentries[tid].revdeps:
  779. fn = fn_from_tid(dep)
  780. if fn == provfn:
  781. continue
  782. deps.add(dep)
  783. if not commondeps:
  784. commondeps = set(deps)
  785. else:
  786. commondeps &= deps
  787. deplist[provfn] = deps
  788. for provfn in deplist:
  789. msg += "\n%s has unique dependees:\n %s" % (provfn, "\n ".join(deplist[provfn] - commondeps))
  790. #
  791. # Construct a list of provides and runtime providers for each recipe
  792. # (rprovides has to cover RPROVIDES, PACKAGES, PACKAGES_DYNAMIC)
  793. #
  794. msg += "\nIt could be that one recipe provides something the other doesn't and should. The following provider and runtime provider differences may be helpful."
  795. provide_results = {}
  796. rprovide_results = {}
  797. commonprovs = None
  798. commonrprovs = None
  799. for provfn in prov_list[prov]:
  800. provides = set(self.dataCaches[mc].fn_provides[provfn])
  801. rprovides = set()
  802. for rprovide in self.dataCaches[mc].rproviders:
  803. if provfn in self.dataCaches[mc].rproviders[rprovide]:
  804. rprovides.add(rprovide)
  805. for package in self.dataCaches[mc].packages:
  806. if provfn in self.dataCaches[mc].packages[package]:
  807. rprovides.add(package)
  808. for package in self.dataCaches[mc].packages_dynamic:
  809. if provfn in self.dataCaches[mc].packages_dynamic[package]:
  810. rprovides.add(package)
  811. if not commonprovs:
  812. commonprovs = set(provides)
  813. else:
  814. commonprovs &= provides
  815. provide_results[provfn] = provides
  816. if not commonrprovs:
  817. commonrprovs = set(rprovides)
  818. else:
  819. commonrprovs &= rprovides
  820. rprovide_results[provfn] = rprovides
  821. #msg += "\nCommon provides:\n %s" % ("\n ".join(commonprovs))
  822. #msg += "\nCommon rprovides:\n %s" % ("\n ".join(commonrprovs))
  823. for provfn in prov_list[prov]:
  824. msg += "\n%s has unique provides:\n %s" % (provfn, "\n ".join(provide_results[provfn] - commonprovs))
  825. msg += "\n%s has unique rprovides:\n %s" % (provfn, "\n ".join(rprovide_results[provfn] - commonrprovs))
  826. if self.warn_multi_bb:
  827. logger.warning(msg)
  828. else:
  829. logger.error(msg)
  830. self.init_progress_reporter.next_stage()
  831. # Create a whitelist usable by the stamp checks
  832. self.stampfnwhitelist = {}
  833. for mc in self.taskData:
  834. self.stampfnwhitelist[mc] = []
  835. for entry in self.stampwhitelist.split():
  836. if entry not in self.taskData[mc].build_targets:
  837. continue
  838. fn = self.taskData.build_targets[entry][0]
  839. self.stampfnwhitelist[mc].append(fn)
  840. self.init_progress_reporter.next_stage()
  841. # Iterate over the task list looking for tasks with a 'setscene' function
  842. self.runq_setscene_tids = []
  843. if not self.cooker.configuration.nosetscene:
  844. for tid in self.runtaskentries:
  845. (mc, fn, taskname, _) = split_tid_mcfn(tid)
  846. setscenetid = tid + "_setscene"
  847. if setscenetid not in taskData[mc].taskentries:
  848. continue
  849. self.runq_setscene_tids.append(tid)
  850. def invalidate_task(tid, error_nostamp):
  851. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  852. taskdep = self.dataCaches[mc].task_deps[taskfn]
  853. if fn + ":" + taskname not in taskData[mc].taskentries:
  854. logger.warning("Task %s does not exist, invalidating this task will have no effect" % taskname)
  855. if 'nostamp' in taskdep and taskname in taskdep['nostamp']:
  856. if error_nostamp:
  857. bb.fatal("Task %s is marked nostamp, cannot invalidate this task" % taskname)
  858. else:
  859. bb.debug(1, "Task %s is marked nostamp, cannot invalidate this task" % taskname)
  860. else:
  861. logger.verbose("Invalidate task %s, %s", taskname, fn)
  862. bb.parse.siggen.invalidate_task(taskname, self.dataCaches[mc], fn)
  863. self.init_progress_reporter.next_stage()
  864. # Invalidate task if force mode active
  865. if self.cooker.configuration.force:
  866. for tid in self.target_tids:
  867. invalidate_task(tid, False)
  868. # Invalidate task if invalidate mode active
  869. if self.cooker.configuration.invalidate_stamp:
  870. for tid in self.target_tids:
  871. fn = fn_from_tid(tid)
  872. for st in self.cooker.configuration.invalidate_stamp.split(','):
  873. if not st.startswith("do_"):
  874. st = "do_%s" % st
  875. invalidate_task(fn + ":" + st, True)
  876. self.init_progress_reporter.next_stage()
  877. # Create and print to the logs a virtual/xxxx -> PN (fn) table
  878. for mc in taskData:
  879. virtmap = taskData[mc].get_providermap(prefix="virtual/")
  880. virtpnmap = {}
  881. for v in virtmap:
  882. virtpnmap[v] = self.dataCaches[mc].pkg_fn[virtmap[v]]
  883. bb.debug(2, "%s resolved to: %s (%s)" % (v, virtpnmap[v], virtmap[v]))
  884. if hasattr(bb.parse.siggen, "tasks_resolved"):
  885. bb.parse.siggen.tasks_resolved(virtmap, virtpnmap, self.dataCaches[mc])
  886. self.init_progress_reporter.next_stage()
  887. # Iterate over the task list and call into the siggen code
  888. dealtwith = set()
  889. todeal = set(self.runtaskentries)
  890. while len(todeal) > 0:
  891. for tid in todeal.copy():
  892. if len(self.runtaskentries[tid].depends - dealtwith) == 0:
  893. dealtwith.add(tid)
  894. todeal.remove(tid)
  895. procdep = []
  896. for dep in self.runtaskentries[tid].depends:
  897. procdep.append(fn_from_tid(dep) + "." + taskname_from_tid(dep))
  898. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  899. self.runtaskentries[tid].hash = bb.parse.siggen.get_taskhash(taskfn, taskname, procdep, self.dataCaches[mc])
  900. task = self.runtaskentries[tid].task
  901. bb.parse.siggen.writeout_file_checksum_cache()
  902. #self.dump_data()
  903. return len(self.runtaskentries)
  904. def dump_data(self):
  905. """
  906. Dump some debug information on the internal data structures
  907. """
  908. logger.debug(3, "run_tasks:")
  909. for tid in self.runtaskentries:
  910. logger.debug(3, " %s: %s Deps %s RevDeps %s", tid,
  911. self.runtaskentries[tid].weight,
  912. self.runtaskentries[tid].depends,
  913. self.runtaskentries[tid].revdeps)
  914. class RunQueueWorker():
  915. def __init__(self, process, pipe):
  916. self.process = process
  917. self.pipe = pipe
  918. class RunQueue:
  919. def __init__(self, cooker, cfgData, dataCaches, taskData, targets):
  920. self.cooker = cooker
  921. self.cfgData = cfgData
  922. self.rqdata = RunQueueData(self, cooker, cfgData, dataCaches, taskData, targets)
  923. self.stamppolicy = cfgData.getVar("BB_STAMP_POLICY") or "perfile"
  924. self.hashvalidate = cfgData.getVar("BB_HASHCHECK_FUNCTION") or None
  925. self.setsceneverify = cfgData.getVar("BB_SETSCENE_VERIFY_FUNCTION2") or None
  926. self.depvalidate = cfgData.getVar("BB_SETSCENE_DEPVALID") or None
  927. self.state = runQueuePrepare
  928. # For disk space monitor
  929. # Invoked at regular time intervals via the bitbake heartbeat event
  930. # while the build is running. We generate a unique name for the handler
  931. # here, just in case that there ever is more than one RunQueue instance,
  932. # start the handler when reaching runQueueSceneRun, and stop it when
  933. # done with the build.
  934. self.dm = monitordisk.diskMonitor(cfgData)
  935. self.dm_event_handler_name = '_bb_diskmonitor_' + str(id(self))
  936. self.dm_event_handler_registered = False
  937. self.rqexe = None
  938. self.worker = {}
  939. self.fakeworker = {}
  940. def _start_worker(self, mc, fakeroot = False, rqexec = None):
  941. logger.debug(1, "Starting bitbake-worker")
  942. magic = "decafbad"
  943. if self.cooker.configuration.profile:
  944. magic = "decafbadbad"
  945. if fakeroot:
  946. magic = magic + "beef"
  947. mcdata = self.cooker.databuilder.mcdata[mc]
  948. fakerootcmd = mcdata.getVar("FAKEROOTCMD")
  949. fakerootenv = (mcdata.getVar("FAKEROOTBASEENV") or "").split()
  950. env = os.environ.copy()
  951. for key, value in (var.split('=') for var in fakerootenv):
  952. env[key] = value
  953. worker = subprocess.Popen([fakerootcmd, "bitbake-worker", magic], stdout=subprocess.PIPE, stdin=subprocess.PIPE, env=env)
  954. else:
  955. worker = subprocess.Popen(["bitbake-worker", magic], stdout=subprocess.PIPE, stdin=subprocess.PIPE)
  956. bb.utils.nonblockingfd(worker.stdout)
  957. workerpipe = runQueuePipe(worker.stdout, None, self.cfgData, self, rqexec)
  958. runqhash = {}
  959. for tid in self.rqdata.runtaskentries:
  960. runqhash[tid] = self.rqdata.runtaskentries[tid].hash
  961. workerdata = {
  962. "taskdeps" : self.rqdata.dataCaches[mc].task_deps,
  963. "fakerootenv" : self.rqdata.dataCaches[mc].fakerootenv,
  964. "fakerootdirs" : self.rqdata.dataCaches[mc].fakerootdirs,
  965. "fakerootnoenv" : self.rqdata.dataCaches[mc].fakerootnoenv,
  966. "sigdata" : bb.parse.siggen.get_taskdata(),
  967. "runq_hash" : runqhash,
  968. "logdefaultdebug" : bb.msg.loggerDefaultDebugLevel,
  969. "logdefaultverbose" : bb.msg.loggerDefaultVerbose,
  970. "logdefaultverboselogs" : bb.msg.loggerVerboseLogs,
  971. "logdefaultdomain" : bb.msg.loggerDefaultDomains,
  972. "prhost" : self.cooker.prhost,
  973. "buildname" : self.cfgData.getVar("BUILDNAME"),
  974. "date" : self.cfgData.getVar("DATE"),
  975. "time" : self.cfgData.getVar("TIME"),
  976. }
  977. worker.stdin.write(b"<cookerconfig>" + pickle.dumps(self.cooker.configuration) + b"</cookerconfig>")
  978. worker.stdin.write(b"<extraconfigdata>" + pickle.dumps(self.cooker.extraconfigdata) + b"</extraconfigdata>")
  979. worker.stdin.write(b"<workerdata>" + pickle.dumps(workerdata) + b"</workerdata>")
  980. worker.stdin.flush()
  981. return RunQueueWorker(worker, workerpipe)
  982. def _teardown_worker(self, worker):
  983. if not worker:
  984. return
  985. logger.debug(1, "Teardown for bitbake-worker")
  986. try:
  987. worker.process.stdin.write(b"<quit></quit>")
  988. worker.process.stdin.flush()
  989. worker.process.stdin.close()
  990. except IOError:
  991. pass
  992. while worker.process.returncode is None:
  993. worker.pipe.read()
  994. worker.process.poll()
  995. while worker.pipe.read():
  996. continue
  997. worker.pipe.close()
  998. def start_worker(self):
  999. if self.worker:
  1000. self.teardown_workers()
  1001. self.teardown = False
  1002. for mc in self.rqdata.dataCaches:
  1003. self.worker[mc] = self._start_worker(mc)
  1004. def start_fakeworker(self, rqexec, mc):
  1005. if not mc in self.fakeworker:
  1006. self.fakeworker[mc] = self._start_worker(mc, True, rqexec)
  1007. def teardown_workers(self):
  1008. self.teardown = True
  1009. for mc in self.worker:
  1010. self._teardown_worker(self.worker[mc])
  1011. self.worker = {}
  1012. for mc in self.fakeworker:
  1013. self._teardown_worker(self.fakeworker[mc])
  1014. self.fakeworker = {}
  1015. def read_workers(self):
  1016. for mc in self.worker:
  1017. self.worker[mc].pipe.read()
  1018. for mc in self.fakeworker:
  1019. self.fakeworker[mc].pipe.read()
  1020. def active_fds(self):
  1021. fds = []
  1022. for mc in self.worker:
  1023. fds.append(self.worker[mc].pipe.input)
  1024. for mc in self.fakeworker:
  1025. fds.append(self.fakeworker[mc].pipe.input)
  1026. return fds
  1027. def check_stamp_task(self, tid, taskname = None, recurse = False, cache = None):
  1028. def get_timestamp(f):
  1029. try:
  1030. if not os.access(f, os.F_OK):
  1031. return None
  1032. return os.stat(f)[stat.ST_MTIME]
  1033. except:
  1034. return None
  1035. (mc, fn, tn, taskfn) = split_tid_mcfn(tid)
  1036. if taskname is None:
  1037. taskname = tn
  1038. if self.stamppolicy == "perfile":
  1039. fulldeptree = False
  1040. else:
  1041. fulldeptree = True
  1042. stampwhitelist = []
  1043. if self.stamppolicy == "whitelist":
  1044. stampwhitelist = self.rqdata.stampfnwhitelist[mc]
  1045. stampfile = bb.build.stampfile(taskname, self.rqdata.dataCaches[mc], taskfn)
  1046. # If the stamp is missing, it's not current
  1047. if not os.access(stampfile, os.F_OK):
  1048. logger.debug(2, "Stampfile %s not available", stampfile)
  1049. return False
  1050. # If it's a 'nostamp' task, it's not current
  1051. taskdep = self.rqdata.dataCaches[mc].task_deps[taskfn]
  1052. if 'nostamp' in taskdep and taskname in taskdep['nostamp']:
  1053. logger.debug(2, "%s.%s is nostamp\n", fn, taskname)
  1054. return False
  1055. if taskname != "do_setscene" and taskname.endswith("_setscene"):
  1056. return True
  1057. if cache is None:
  1058. cache = {}
  1059. iscurrent = True
  1060. t1 = get_timestamp(stampfile)
  1061. for dep in self.rqdata.runtaskentries[tid].depends:
  1062. if iscurrent:
  1063. (mc2, fn2, taskname2, taskfn2) = split_tid_mcfn(dep)
  1064. stampfile2 = bb.build.stampfile(taskname2, self.rqdata.dataCaches[mc2], taskfn2)
  1065. stampfile3 = bb.build.stampfile(taskname2 + "_setscene", self.rqdata.dataCaches[mc2], taskfn2)
  1066. t2 = get_timestamp(stampfile2)
  1067. t3 = get_timestamp(stampfile3)
  1068. if t3 and not t2:
  1069. continue
  1070. if t3 and t3 > t2:
  1071. continue
  1072. if fn == fn2 or (fulldeptree and fn2 not in stampwhitelist):
  1073. if not t2:
  1074. logger.debug(2, 'Stampfile %s does not exist', stampfile2)
  1075. iscurrent = False
  1076. break
  1077. if t1 < t2:
  1078. logger.debug(2, 'Stampfile %s < %s', stampfile, stampfile2)
  1079. iscurrent = False
  1080. break
  1081. if recurse and iscurrent:
  1082. if dep in cache:
  1083. iscurrent = cache[dep]
  1084. if not iscurrent:
  1085. logger.debug(2, 'Stampfile for dependency %s:%s invalid (cached)' % (fn2, taskname2))
  1086. else:
  1087. iscurrent = self.check_stamp_task(dep, recurse=True, cache=cache)
  1088. cache[dep] = iscurrent
  1089. if recurse:
  1090. cache[tid] = iscurrent
  1091. return iscurrent
  1092. def _execute_runqueue(self):
  1093. """
  1094. Run the tasks in a queue prepared by rqdata.prepare()
  1095. Upon failure, optionally try to recover the build using any alternate providers
  1096. (if the abort on failure configuration option isn't set)
  1097. """
  1098. retval = True
  1099. if self.state is runQueuePrepare:
  1100. self.rqexe = RunQueueExecuteDummy(self)
  1101. # NOTE: if you add, remove or significantly refactor the stages of this
  1102. # process then you should recalculate the weightings here. This is quite
  1103. # easy to do - just change the next line temporarily to pass debug=True as
  1104. # the last parameter and you'll get a printout of the weightings as well
  1105. # as a map to the lines where next_stage() was called. Of course this isn't
  1106. # critical, but it helps to keep the progress reporting accurate.
  1107. self.rqdata.init_progress_reporter = bb.progress.MultiStageProcessProgressReporter(self.cooker.data,
  1108. "Initialising tasks",
  1109. [43, 967, 4, 3, 1, 5, 3, 7, 13, 1, 2, 1, 1, 246, 35, 1, 38, 1, 35, 2, 338, 204, 142, 3, 3, 37, 244])
  1110. if self.rqdata.prepare() == 0:
  1111. self.state = runQueueComplete
  1112. else:
  1113. self.state = runQueueSceneInit
  1114. self.rqdata.init_progress_reporter.next_stage()
  1115. # we are ready to run, emit dependency info to any UI or class which
  1116. # needs it
  1117. depgraph = self.cooker.buildDependTree(self, self.rqdata.taskData)
  1118. self.rqdata.init_progress_reporter.next_stage()
  1119. bb.event.fire(bb.event.DepTreeGenerated(depgraph), self.cooker.data)
  1120. if self.state is runQueueSceneInit:
  1121. dump = self.cooker.configuration.dump_signatures
  1122. if dump:
  1123. self.rqdata.init_progress_reporter.finish()
  1124. if 'printdiff' in dump:
  1125. invalidtasks = self.print_diffscenetasks()
  1126. self.dump_signatures(dump)
  1127. if 'printdiff' in dump:
  1128. self.write_diffscenetasks(invalidtasks)
  1129. self.state = runQueueComplete
  1130. else:
  1131. self.rqdata.init_progress_reporter.next_stage()
  1132. self.start_worker()
  1133. self.rqdata.init_progress_reporter.next_stage()
  1134. self.rqexe = RunQueueExecuteScenequeue(self)
  1135. if self.state is runQueueSceneRun:
  1136. if not self.dm_event_handler_registered:
  1137. res = bb.event.register(self.dm_event_handler_name,
  1138. lambda x: self.dm.check(self) if self.state in [runQueueSceneRun, runQueueRunning, runQueueCleanUp] else False,
  1139. ('bb.event.HeartbeatEvent',))
  1140. self.dm_event_handler_registered = True
  1141. retval = self.rqexe.execute()
  1142. if self.state is runQueueRunInit:
  1143. if self.cooker.configuration.setsceneonly:
  1144. self.state = runQueueComplete
  1145. else:
  1146. # Just in case we didn't setscene
  1147. self.rqdata.init_progress_reporter.finish()
  1148. logger.info("Executing RunQueue Tasks")
  1149. self.rqexe = RunQueueExecuteTasks(self)
  1150. self.state = runQueueRunning
  1151. if self.state is runQueueRunning:
  1152. retval = self.rqexe.execute()
  1153. if self.state is runQueueCleanUp:
  1154. retval = self.rqexe.finish()
  1155. build_done = self.state is runQueueComplete or self.state is runQueueFailed
  1156. if build_done and self.dm_event_handler_registered:
  1157. bb.event.remove(self.dm_event_handler_name, None)
  1158. self.dm_event_handler_registered = False
  1159. if build_done and self.rqexe:
  1160. self.teardown_workers()
  1161. if self.rqexe.stats.failed:
  1162. logger.info("Tasks Summary: Attempted %d tasks of which %d didn't need to be rerun and %d failed.", self.rqexe.stats.completed + self.rqexe.stats.failed, self.rqexe.stats.skipped, self.rqexe.stats.failed)
  1163. else:
  1164. # Let's avoid the word "failed" if nothing actually did
  1165. logger.info("Tasks Summary: Attempted %d tasks of which %d didn't need to be rerun and all succeeded.", self.rqexe.stats.completed, self.rqexe.stats.skipped)
  1166. if self.state is runQueueFailed:
  1167. if not self.rqdata.taskData[''].tryaltconfigs:
  1168. raise bb.runqueue.TaskFailure(self.rqexe.failed_tids)
  1169. for tid in self.rqexe.failed_tids:
  1170. (mc, fn, tn, _) = split_tid_mcfn(tid)
  1171. self.rqdata.taskData[mc].fail_fn(fn)
  1172. self.rqdata.reset()
  1173. if self.state is runQueueComplete:
  1174. # All done
  1175. return False
  1176. # Loop
  1177. return retval
  1178. def execute_runqueue(self):
  1179. # Catch unexpected exceptions and ensure we exit when an error occurs, not loop.
  1180. try:
  1181. return self._execute_runqueue()
  1182. except bb.runqueue.TaskFailure:
  1183. raise
  1184. except SystemExit:
  1185. raise
  1186. except bb.BBHandledException:
  1187. try:
  1188. self.teardown_workers()
  1189. except:
  1190. pass
  1191. self.state = runQueueComplete
  1192. raise
  1193. except Exception as err:
  1194. logger.exception("An uncaught exception occurred in runqueue")
  1195. try:
  1196. self.teardown_workers()
  1197. except:
  1198. pass
  1199. self.state = runQueueComplete
  1200. raise
  1201. def finish_runqueue(self, now = False):
  1202. if not self.rqexe:
  1203. self.state = runQueueComplete
  1204. return
  1205. if now:
  1206. self.rqexe.finish_now()
  1207. else:
  1208. self.rqexe.finish()
  1209. def rq_dump_sigfn(self, fn, options):
  1210. bb_cache = bb.cache.NoCache(self.cooker.databuilder)
  1211. the_data = bb_cache.loadDataFull(fn, self.cooker.collection.get_file_appends(fn))
  1212. siggen = bb.parse.siggen
  1213. dataCaches = self.rqdata.dataCaches
  1214. siggen.dump_sigfn(fn, dataCaches, options)
  1215. def dump_signatures(self, options):
  1216. fns = set()
  1217. bb.note("Reparsing files to collect dependency data")
  1218. for tid in self.rqdata.runtaskentries:
  1219. fn = fn_from_tid(tid)
  1220. fns.add(fn)
  1221. max_process = int(self.cfgData.getVar("BB_NUMBER_PARSE_THREADS") or os.cpu_count() or 1)
  1222. # We cannot use the real multiprocessing.Pool easily due to some local data
  1223. # that can't be pickled. This is a cheap multi-process solution.
  1224. launched = []
  1225. while fns:
  1226. if len(launched) < max_process:
  1227. p = Process(target=self.rq_dump_sigfn, args=(fns.pop(), options))
  1228. p.start()
  1229. launched.append(p)
  1230. for q in launched:
  1231. # The finished processes are joined when calling is_alive()
  1232. if not q.is_alive():
  1233. launched.remove(q)
  1234. for p in launched:
  1235. p.join()
  1236. bb.parse.siggen.dump_sigs(self.rqdata.dataCaches, options)
  1237. return
  1238. def print_diffscenetasks(self):
  1239. valid = []
  1240. sq_hash = []
  1241. sq_hashfn = []
  1242. sq_fn = []
  1243. sq_taskname = []
  1244. sq_task = []
  1245. noexec = []
  1246. stamppresent = []
  1247. valid_new = set()
  1248. for tid in self.rqdata.runtaskentries:
  1249. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  1250. taskdep = self.rqdata.dataCaches[mc].task_deps[taskfn]
  1251. if 'noexec' in taskdep and taskname in taskdep['noexec']:
  1252. noexec.append(tid)
  1253. continue
  1254. sq_fn.append(fn)
  1255. sq_hashfn.append(self.rqdata.dataCaches[mc].hashfn[taskfn])
  1256. sq_hash.append(self.rqdata.runtaskentries[tid].hash)
  1257. sq_taskname.append(taskname)
  1258. sq_task.append(tid)
  1259. locs = { "sq_fn" : sq_fn, "sq_task" : sq_taskname, "sq_hash" : sq_hash, "sq_hashfn" : sq_hashfn, "d" : self.cooker.data }
  1260. try:
  1261. call = self.hashvalidate + "(sq_fn, sq_task, sq_hash, sq_hashfn, d, siginfo=True)"
  1262. valid = bb.utils.better_eval(call, locs)
  1263. # Handle version with no siginfo parameter
  1264. except TypeError:
  1265. call = self.hashvalidate + "(sq_fn, sq_task, sq_hash, sq_hashfn, d)"
  1266. valid = bb.utils.better_eval(call, locs)
  1267. for v in valid:
  1268. valid_new.add(sq_task[v])
  1269. # Tasks which are both setscene and noexec never care about dependencies
  1270. # We therefore find tasks which are setscene and noexec and mark their
  1271. # unique dependencies as valid.
  1272. for tid in noexec:
  1273. if tid not in self.rqdata.runq_setscene_tids:
  1274. continue
  1275. for dep in self.rqdata.runtaskentries[tid].depends:
  1276. hasnoexecparents = True
  1277. for dep2 in self.rqdata.runtaskentries[dep].revdeps:
  1278. if dep2 in self.rqdata.runq_setscene_tids and dep2 in noexec:
  1279. continue
  1280. hasnoexecparents = False
  1281. break
  1282. if hasnoexecparents:
  1283. valid_new.add(dep)
  1284. invalidtasks = set()
  1285. for tid in self.rqdata.runtaskentries:
  1286. if tid not in valid_new and tid not in noexec:
  1287. invalidtasks.add(tid)
  1288. found = set()
  1289. processed = set()
  1290. for tid in invalidtasks:
  1291. toprocess = set([tid])
  1292. while toprocess:
  1293. next = set()
  1294. for t in toprocess:
  1295. for dep in self.rqdata.runtaskentries[t].depends:
  1296. if dep in invalidtasks:
  1297. found.add(tid)
  1298. if dep not in processed:
  1299. processed.add(dep)
  1300. next.add(dep)
  1301. toprocess = next
  1302. if tid in found:
  1303. toprocess = set()
  1304. tasklist = []
  1305. for tid in invalidtasks.difference(found):
  1306. tasklist.append(tid)
  1307. if tasklist:
  1308. bb.plain("The differences between the current build and any cached tasks start at the following tasks:\n" + "\n".join(tasklist))
  1309. return invalidtasks.difference(found)
  1310. def write_diffscenetasks(self, invalidtasks):
  1311. # Define recursion callback
  1312. def recursecb(key, hash1, hash2):
  1313. hashes = [hash1, hash2]
  1314. hashfiles = bb.siggen.find_siginfo(key, None, hashes, self.cfgData)
  1315. recout = []
  1316. if len(hashfiles) == 2:
  1317. out2 = bb.siggen.compare_sigfiles(hashfiles[hash1], hashfiles[hash2], recursecb)
  1318. recout.extend(list(' ' + l for l in out2))
  1319. else:
  1320. recout.append("Unable to find matching sigdata for %s with hashes %s or %s" % (key, hash1, hash2))
  1321. return recout
  1322. for tid in invalidtasks:
  1323. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  1324. pn = self.rqdata.dataCaches[mc].pkg_fn[taskfn]
  1325. h = self.rqdata.runtaskentries[tid].hash
  1326. matches = bb.siggen.find_siginfo(pn, taskname, [], self.cfgData)
  1327. match = None
  1328. for m in matches:
  1329. if h in m:
  1330. match = m
  1331. if match is None:
  1332. bb.fatal("Can't find a task we're supposed to have written out? (hash: %s)?" % h)
  1333. matches = {k : v for k, v in iter(matches.items()) if h not in k}
  1334. if matches:
  1335. latestmatch = sorted(matches.keys(), key=lambda f: matches[f])[-1]
  1336. prevh = __find_md5__.search(latestmatch).group(0)
  1337. output = bb.siggen.compare_sigfiles(latestmatch, match, recursecb)
  1338. bb.plain("\nTask %s:%s couldn't be used from the cache because:\n We need hash %s, closest matching task was %s\n " % (pn, taskname, h, prevh) + '\n '.join(output))
  1339. class RunQueueExecute:
  1340. def __init__(self, rq):
  1341. self.rq = rq
  1342. self.cooker = rq.cooker
  1343. self.cfgData = rq.cfgData
  1344. self.rqdata = rq.rqdata
  1345. self.number_tasks = int(self.cfgData.getVar("BB_NUMBER_THREADS") or 1)
  1346. self.scheduler = self.cfgData.getVar("BB_SCHEDULER") or "speed"
  1347. self.runq_buildable = set()
  1348. self.runq_running = set()
  1349. self.runq_complete = set()
  1350. self.build_stamps = {}
  1351. self.build_stamps2 = []
  1352. self.failed_tids = []
  1353. self.stampcache = {}
  1354. for mc in rq.worker:
  1355. rq.worker[mc].pipe.setrunqueueexec(self)
  1356. for mc in rq.fakeworker:
  1357. rq.fakeworker[mc].pipe.setrunqueueexec(self)
  1358. if self.number_tasks <= 0:
  1359. bb.fatal("Invalid BB_NUMBER_THREADS %s" % self.number_tasks)
  1360. def runqueue_process_waitpid(self, task, status):
  1361. # self.build_stamps[pid] may not exist when use shared work directory.
  1362. if task in self.build_stamps:
  1363. self.build_stamps2.remove(self.build_stamps[task])
  1364. del self.build_stamps[task]
  1365. if status != 0:
  1366. self.task_fail(task, status)
  1367. else:
  1368. self.task_complete(task)
  1369. return True
  1370. def finish_now(self):
  1371. for mc in self.rq.worker:
  1372. try:
  1373. self.rq.worker[mc].process.stdin.write(b"<finishnow></finishnow>")
  1374. self.rq.worker[mc].process.stdin.flush()
  1375. except IOError:
  1376. # worker must have died?
  1377. pass
  1378. for mc in self.rq.fakeworker:
  1379. try:
  1380. self.rq.fakeworker[mc].process.stdin.write(b"<finishnow></finishnow>")
  1381. self.rq.fakeworker[mc].process.stdin.flush()
  1382. except IOError:
  1383. # worker must have died?
  1384. pass
  1385. if len(self.failed_tids) != 0:
  1386. self.rq.state = runQueueFailed
  1387. return
  1388. self.rq.state = runQueueComplete
  1389. return
  1390. def finish(self):
  1391. self.rq.state = runQueueCleanUp
  1392. if self.stats.active > 0:
  1393. bb.event.fire(runQueueExitWait(self.stats.active), self.cfgData)
  1394. self.rq.read_workers()
  1395. return self.rq.active_fds()
  1396. if len(self.failed_tids) != 0:
  1397. self.rq.state = runQueueFailed
  1398. return True
  1399. self.rq.state = runQueueComplete
  1400. return True
  1401. def check_dependencies(self, task, taskdeps, setscene = False):
  1402. if not self.rq.depvalidate:
  1403. return False
  1404. taskdata = {}
  1405. taskdeps.add(task)
  1406. for dep in taskdeps:
  1407. (mc, fn, taskname, taskfn) = split_tid_mcfn(dep)
  1408. pn = self.rqdata.dataCaches[mc].pkg_fn[taskfn]
  1409. taskdata[dep] = [pn, taskname, fn]
  1410. call = self.rq.depvalidate + "(task, taskdata, notneeded, d)"
  1411. locs = { "task" : task, "taskdata" : taskdata, "notneeded" : self.scenequeue_notneeded, "d" : self.cooker.data }
  1412. valid = bb.utils.better_eval(call, locs)
  1413. return valid
  1414. class RunQueueExecuteDummy(RunQueueExecute):
  1415. def __init__(self, rq):
  1416. self.rq = rq
  1417. self.stats = RunQueueStats(0)
  1418. def finish(self):
  1419. self.rq.state = runQueueComplete
  1420. return
  1421. class RunQueueExecuteTasks(RunQueueExecute):
  1422. def __init__(self, rq):
  1423. RunQueueExecute.__init__(self, rq)
  1424. self.stats = RunQueueStats(len(self.rqdata.runtaskentries))
  1425. self.stampcache = {}
  1426. initial_covered = self.rq.scenequeue_covered.copy()
  1427. # Mark initial buildable tasks
  1428. for tid in self.rqdata.runtaskentries:
  1429. if len(self.rqdata.runtaskentries[tid].depends) == 0:
  1430. self.runq_buildable.add(tid)
  1431. if len(self.rqdata.runtaskentries[tid].revdeps) > 0 and self.rqdata.runtaskentries[tid].revdeps.issubset(self.rq.scenequeue_covered):
  1432. self.rq.scenequeue_covered.add(tid)
  1433. found = True
  1434. while found:
  1435. found = False
  1436. for tid in self.rqdata.runtaskentries:
  1437. if tid in self.rq.scenequeue_covered:
  1438. continue
  1439. logger.debug(1, 'Considering %s: %s' % (tid, str(self.rqdata.runtaskentries[tid].revdeps)))
  1440. if len(self.rqdata.runtaskentries[tid].revdeps) > 0 and self.rqdata.runtaskentries[tid].revdeps.issubset(self.rq.scenequeue_covered):
  1441. if tid in self.rq.scenequeue_notcovered:
  1442. continue
  1443. found = True
  1444. self.rq.scenequeue_covered.add(tid)
  1445. logger.debug(1, 'Skip list (pre setsceneverify) %s', sorted(self.rq.scenequeue_covered))
  1446. # Allow the metadata to elect for setscene tasks to run anyway
  1447. covered_remove = set()
  1448. if self.rq.setsceneverify:
  1449. invalidtasks = []
  1450. tasknames = {}
  1451. fns = {}
  1452. for tid in self.rqdata.runtaskentries:
  1453. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  1454. taskdep = self.rqdata.dataCaches[mc].task_deps[taskfn]
  1455. fns[tid] = taskfn
  1456. tasknames[tid] = taskname
  1457. if 'noexec' in taskdep and taskname in taskdep['noexec']:
  1458. continue
  1459. if self.rq.check_stamp_task(tid, taskname + "_setscene", cache=self.stampcache):
  1460. logger.debug(2, 'Setscene stamp current for task %s', tid)
  1461. continue
  1462. if self.rq.check_stamp_task(tid, taskname, recurse = True, cache=self.stampcache):
  1463. logger.debug(2, 'Normal stamp current for task %s', tid)
  1464. continue
  1465. invalidtasks.append(tid)
  1466. call = self.rq.setsceneverify + "(covered, tasknames, fns, d, invalidtasks=invalidtasks)"
  1467. locs = { "covered" : self.rq.scenequeue_covered, "tasknames" : tasknames, "fns" : fns, "d" : self.cooker.data, "invalidtasks" : invalidtasks }
  1468. covered_remove = bb.utils.better_eval(call, locs)
  1469. def removecoveredtask(tid):
  1470. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  1471. taskname = taskname + '_setscene'
  1472. bb.build.del_stamp(taskname, self.rqdata.dataCaches[mc], taskfn)
  1473. self.rq.scenequeue_covered.remove(tid)
  1474. toremove = covered_remove
  1475. for task in toremove:
  1476. logger.debug(1, 'Not skipping task %s due to setsceneverify', task)
  1477. while toremove:
  1478. covered_remove = []
  1479. for task in toremove:
  1480. removecoveredtask(task)
  1481. for deptask in self.rqdata.runtaskentries[task].depends:
  1482. if deptask not in self.rq.scenequeue_covered:
  1483. continue
  1484. if deptask in toremove or deptask in covered_remove or deptask in initial_covered:
  1485. continue
  1486. logger.debug(1, 'Task %s depends on task %s so not skipping' % (task, deptask))
  1487. covered_remove.append(deptask)
  1488. toremove = covered_remove
  1489. logger.debug(1, 'Full skip list %s', self.rq.scenequeue_covered)
  1490. for mc in self.rqdata.dataCaches:
  1491. target_pairs = []
  1492. for tid in self.rqdata.target_tids:
  1493. (tidmc, fn, taskname, _) = split_tid_mcfn(tid)
  1494. if tidmc == mc:
  1495. target_pairs.append((fn, taskname))
  1496. event.fire(bb.event.StampUpdate(target_pairs, self.rqdata.dataCaches[mc].stamp), self.cfgData)
  1497. schedulers = self.get_schedulers()
  1498. for scheduler in schedulers:
  1499. if self.scheduler == scheduler.name:
  1500. self.sched = scheduler(self, self.rqdata)
  1501. logger.debug(1, "Using runqueue scheduler '%s'", scheduler.name)
  1502. break
  1503. else:
  1504. bb.fatal("Invalid scheduler '%s'. Available schedulers: %s" %
  1505. (self.scheduler, ", ".join(obj.name for obj in schedulers)))
  1506. def get_schedulers(self):
  1507. schedulers = set(obj for obj in globals().values()
  1508. if type(obj) is type and
  1509. issubclass(obj, RunQueueScheduler))
  1510. user_schedulers = self.cfgData.getVar("BB_SCHEDULERS")
  1511. if user_schedulers:
  1512. for sched in user_schedulers.split():
  1513. if not "." in sched:
  1514. bb.note("Ignoring scheduler '%s' from BB_SCHEDULERS: not an import" % sched)
  1515. continue
  1516. modname, name = sched.rsplit(".", 1)
  1517. try:
  1518. module = __import__(modname, fromlist=(name,))
  1519. except ImportError as exc:
  1520. logger.critical("Unable to import scheduler '%s' from '%s': %s" % (name, modname, exc))
  1521. raise SystemExit(1)
  1522. else:
  1523. schedulers.add(getattr(module, name))
  1524. return schedulers
  1525. def setbuildable(self, task):
  1526. self.runq_buildable.add(task)
  1527. self.sched.newbuilable(task)
  1528. def task_completeoutright(self, task):
  1529. """
  1530. Mark a task as completed
  1531. Look at the reverse dependencies and mark any task with
  1532. completed dependencies as buildable
  1533. """
  1534. self.runq_complete.add(task)
  1535. for revdep in self.rqdata.runtaskentries[task].revdeps:
  1536. if revdep in self.runq_running:
  1537. continue
  1538. if revdep in self.runq_buildable:
  1539. continue
  1540. alldeps = 1
  1541. for dep in self.rqdata.runtaskentries[revdep].depends:
  1542. if dep not in self.runq_complete:
  1543. alldeps = 0
  1544. if alldeps == 1:
  1545. self.setbuildable(revdep)
  1546. fn = fn_from_tid(revdep)
  1547. taskname = taskname_from_tid(revdep)
  1548. logger.debug(1, "Marking task %s as buildable", revdep)
  1549. def task_complete(self, task):
  1550. self.stats.taskCompleted()
  1551. bb.event.fire(runQueueTaskCompleted(task, self.stats, self.rq), self.cfgData)
  1552. self.task_completeoutright(task)
  1553. def task_fail(self, task, exitcode):
  1554. """
  1555. Called when a task has failed
  1556. Updates the state engine with the failure
  1557. """
  1558. self.stats.taskFailed()
  1559. self.failed_tids.append(task)
  1560. bb.event.fire(runQueueTaskFailed(task, self.stats, exitcode, self.rq), self.cfgData)
  1561. if self.rqdata.taskData[''].abort:
  1562. self.rq.state = runQueueCleanUp
  1563. def task_skip(self, task, reason):
  1564. self.runq_running.add(task)
  1565. self.setbuildable(task)
  1566. bb.event.fire(runQueueTaskSkipped(task, self.stats, self.rq, reason), self.cfgData)
  1567. self.task_completeoutright(task)
  1568. self.stats.taskCompleted()
  1569. self.stats.taskSkipped()
  1570. def execute(self):
  1571. """
  1572. Run the tasks in a queue prepared by rqdata.prepare()
  1573. """
  1574. if self.rqdata.setscenewhitelist and not self.rqdata.setscenewhitelist_checked:
  1575. self.rqdata.setscenewhitelist_checked = True
  1576. # Check tasks that are going to run against the whitelist
  1577. def check_norun_task(tid, showerror=False):
  1578. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  1579. # Ignore covered tasks
  1580. if tid in self.rq.scenequeue_covered:
  1581. return False
  1582. # Ignore stamped tasks
  1583. if self.rq.check_stamp_task(tid, taskname, cache=self.stampcache):
  1584. return False
  1585. # Ignore noexec tasks
  1586. taskdep = self.rqdata.dataCaches[mc].task_deps[taskfn]
  1587. if 'noexec' in taskdep and taskname in taskdep['noexec']:
  1588. return False
  1589. pn = self.rqdata.dataCaches[mc].pkg_fn[taskfn]
  1590. if not check_setscene_enforce_whitelist(pn, taskname, self.rqdata.setscenewhitelist):
  1591. if showerror:
  1592. if tid in self.rqdata.runq_setscene_tids:
  1593. logger.error('Task %s.%s attempted to execute unexpectedly and should have been setscened' % (pn, taskname))
  1594. else:
  1595. logger.error('Task %s.%s attempted to execute unexpectedly' % (pn, taskname))
  1596. return True
  1597. return False
  1598. # Look to see if any tasks that we think shouldn't run are going to
  1599. unexpected = False
  1600. for tid in self.rqdata.runtaskentries:
  1601. if check_norun_task(tid):
  1602. unexpected = True
  1603. break
  1604. if unexpected:
  1605. # Run through the tasks in the rough order they'd have executed and print errors
  1606. # (since the order can be useful - usually missing sstate for the last few tasks
  1607. # is the cause of the problem)
  1608. task = self.sched.next()
  1609. while task is not None:
  1610. check_norun_task(task, showerror=True)
  1611. self.task_skip(task, 'Setscene enforcement check')
  1612. task = self.sched.next()
  1613. self.rq.state = runQueueCleanUp
  1614. return True
  1615. self.rq.read_workers()
  1616. if self.stats.total == 0:
  1617. # nothing to do
  1618. self.rq.state = runQueueCleanUp
  1619. task = self.sched.next()
  1620. if task is not None:
  1621. (mc, fn, taskname, taskfn) = split_tid_mcfn(task)
  1622. if task in self.rq.scenequeue_covered:
  1623. logger.debug(2, "Setscene covered task %s", task)
  1624. self.task_skip(task, "covered")
  1625. return True
  1626. if self.rq.check_stamp_task(task, taskname, cache=self.stampcache):
  1627. logger.debug(2, "Stamp current task %s", task)
  1628. self.task_skip(task, "existing")
  1629. return True
  1630. taskdep = self.rqdata.dataCaches[mc].task_deps[taskfn]
  1631. if 'noexec' in taskdep and taskname in taskdep['noexec']:
  1632. startevent = runQueueTaskStarted(task, self.stats, self.rq,
  1633. noexec=True)
  1634. bb.event.fire(startevent, self.cfgData)
  1635. self.runq_running.add(task)
  1636. self.stats.taskActive()
  1637. if not (self.cooker.configuration.dry_run or self.rqdata.setscene_enforce):
  1638. bb.build.make_stamp(taskname, self.rqdata.dataCaches[mc], taskfn)
  1639. self.task_complete(task)
  1640. return True
  1641. else:
  1642. startevent = runQueueTaskStarted(task, self.stats, self.rq)
  1643. bb.event.fire(startevent, self.cfgData)
  1644. taskdepdata = self.build_taskdepdata(task)
  1645. taskdep = self.rqdata.dataCaches[mc].task_deps[taskfn]
  1646. if 'fakeroot' in taskdep and taskname in taskdep['fakeroot'] and not (self.cooker.configuration.dry_run or self.rqdata.setscene_enforce):
  1647. if not mc in self.rq.fakeworker:
  1648. try:
  1649. self.rq.start_fakeworker(self, mc)
  1650. except OSError as exc:
  1651. logger.critical("Failed to spawn fakeroot worker to run %s: %s" % (task, str(exc)))
  1652. self.rq.state = runQueueFailed
  1653. self.stats.taskFailed()
  1654. return True
  1655. self.rq.fakeworker[mc].process.stdin.write(b"<runtask>" + pickle.dumps((taskfn, task, taskname, False, self.cooker.collection.get_file_appends(taskfn), taskdepdata, self.rqdata.setscene_enforce)) + b"</runtask>")
  1656. self.rq.fakeworker[mc].process.stdin.flush()
  1657. else:
  1658. self.rq.worker[mc].process.stdin.write(b"<runtask>" + pickle.dumps((taskfn, task, taskname, False, self.cooker.collection.get_file_appends(taskfn), taskdepdata, self.rqdata.setscene_enforce)) + b"</runtask>")
  1659. self.rq.worker[mc].process.stdin.flush()
  1660. self.build_stamps[task] = bb.build.stampfile(taskname, self.rqdata.dataCaches[mc], taskfn, noextra=True)
  1661. self.build_stamps2.append(self.build_stamps[task])
  1662. self.runq_running.add(task)
  1663. self.stats.taskActive()
  1664. if self.stats.active < self.number_tasks:
  1665. return True
  1666. if self.stats.active > 0:
  1667. self.rq.read_workers()
  1668. return self.rq.active_fds()
  1669. if len(self.failed_tids) != 0:
  1670. self.rq.state = runQueueFailed
  1671. return True
  1672. # Sanity Checks
  1673. for task in self.rqdata.runtaskentries:
  1674. if task not in self.runq_buildable:
  1675. logger.error("Task %s never buildable!", task)
  1676. if task not in self.runq_running:
  1677. logger.error("Task %s never ran!", task)
  1678. if task not in self.runq_complete:
  1679. logger.error("Task %s never completed!", task)
  1680. self.rq.state = runQueueComplete
  1681. return True
  1682. def build_taskdepdata(self, task):
  1683. taskdepdata = {}
  1684. next = self.rqdata.runtaskentries[task].depends
  1685. next.add(task)
  1686. while next:
  1687. additional = []
  1688. for revdep in next:
  1689. (mc, fn, taskname, taskfn) = split_tid_mcfn(revdep)
  1690. pn = self.rqdata.dataCaches[mc].pkg_fn[taskfn]
  1691. deps = self.rqdata.runtaskentries[revdep].depends
  1692. provides = self.rqdata.dataCaches[mc].fn_provides[taskfn]
  1693. taskhash = self.rqdata.runtaskentries[revdep].hash
  1694. taskdepdata[revdep] = [pn, taskname, fn, deps, provides, taskhash]
  1695. for revdep2 in deps:
  1696. if revdep2 not in taskdepdata:
  1697. additional.append(revdep2)
  1698. next = additional
  1699. #bb.note("Task %s: " % task + str(taskdepdata).replace("], ", "],\n"))
  1700. return taskdepdata
  1701. class RunQueueExecuteScenequeue(RunQueueExecute):
  1702. def __init__(self, rq):
  1703. RunQueueExecute.__init__(self, rq)
  1704. self.scenequeue_covered = set()
  1705. self.scenequeue_notcovered = set()
  1706. self.scenequeue_notneeded = set()
  1707. # If we don't have any setscene functions, skip this step
  1708. if len(self.rqdata.runq_setscene_tids) == 0:
  1709. rq.scenequeue_covered = set()
  1710. rq.state = runQueueRunInit
  1711. return
  1712. self.stats = RunQueueStats(len(self.rqdata.runq_setscene_tids))
  1713. sq_revdeps = {}
  1714. sq_revdeps_new = {}
  1715. sq_revdeps_squash = {}
  1716. self.sq_harddeps = {}
  1717. self.stamps = {}
  1718. # We need to construct a dependency graph for the setscene functions. Intermediate
  1719. # dependencies between the setscene tasks only complicate the code. This code
  1720. # therefore aims to collapse the huge runqueue dependency tree into a smaller one
  1721. # only containing the setscene functions.
  1722. self.rqdata.init_progress_reporter.next_stage()
  1723. # First process the chains up to the first setscene task.
  1724. endpoints = {}
  1725. for tid in self.rqdata.runtaskentries:
  1726. sq_revdeps[tid] = copy.copy(self.rqdata.runtaskentries[tid].revdeps)
  1727. sq_revdeps_new[tid] = set()
  1728. if (len(sq_revdeps[tid]) == 0) and tid not in self.rqdata.runq_setscene_tids:
  1729. #bb.warn("Added endpoint %s" % (tid))
  1730. endpoints[tid] = set()
  1731. self.rqdata.init_progress_reporter.next_stage()
  1732. # Secondly process the chains between setscene tasks.
  1733. for tid in self.rqdata.runq_setscene_tids:
  1734. #bb.warn("Added endpoint 2 %s" % (tid))
  1735. for dep in self.rqdata.runtaskentries[tid].depends:
  1736. if tid in sq_revdeps[dep]:
  1737. sq_revdeps[dep].remove(tid)
  1738. if dep not in endpoints:
  1739. endpoints[dep] = set()
  1740. #bb.warn(" Added endpoint 3 %s" % (dep))
  1741. endpoints[dep].add(tid)
  1742. self.rqdata.init_progress_reporter.next_stage()
  1743. def process_endpoints(endpoints):
  1744. newendpoints = {}
  1745. for point, task in endpoints.items():
  1746. tasks = set()
  1747. if task:
  1748. tasks |= task
  1749. if sq_revdeps_new[point]:
  1750. tasks |= sq_revdeps_new[point]
  1751. sq_revdeps_new[point] = set()
  1752. if point in self.rqdata.runq_setscene_tids:
  1753. sq_revdeps_new[point] = tasks
  1754. tasks = set()
  1755. continue
  1756. for dep in self.rqdata.runtaskentries[point].depends:
  1757. if point in sq_revdeps[dep]:
  1758. sq_revdeps[dep].remove(point)
  1759. if tasks:
  1760. sq_revdeps_new[dep] |= tasks
  1761. if len(sq_revdeps[dep]) == 0 and dep not in self.rqdata.runq_setscene_tids:
  1762. newendpoints[dep] = task
  1763. if len(newendpoints) != 0:
  1764. process_endpoints(newendpoints)
  1765. process_endpoints(endpoints)
  1766. self.rqdata.init_progress_reporter.next_stage()
  1767. # Build a list of setscene tasks which are "unskippable"
  1768. # These are direct endpoints referenced by the build
  1769. endpoints2 = {}
  1770. sq_revdeps2 = {}
  1771. sq_revdeps_new2 = {}
  1772. def process_endpoints2(endpoints):
  1773. newendpoints = {}
  1774. for point, task in endpoints.items():
  1775. tasks = set([point])
  1776. if task:
  1777. tasks |= task
  1778. if sq_revdeps_new2[point]:
  1779. tasks |= sq_revdeps_new2[point]
  1780. sq_revdeps_new2[point] = set()
  1781. if point in self.rqdata.runq_setscene_tids:
  1782. sq_revdeps_new2[point] = tasks
  1783. for dep in self.rqdata.runtaskentries[point].depends:
  1784. if point in sq_revdeps2[dep]:
  1785. sq_revdeps2[dep].remove(point)
  1786. if tasks:
  1787. sq_revdeps_new2[dep] |= tasks
  1788. if (len(sq_revdeps2[dep]) == 0 or len(sq_revdeps_new2[dep]) != 0) and dep not in self.rqdata.runq_setscene_tids:
  1789. newendpoints[dep] = tasks
  1790. if len(newendpoints) != 0:
  1791. process_endpoints2(newendpoints)
  1792. for tid in self.rqdata.runtaskentries:
  1793. sq_revdeps2[tid] = copy.copy(self.rqdata.runtaskentries[tid].revdeps)
  1794. sq_revdeps_new2[tid] = set()
  1795. if (len(sq_revdeps2[tid]) == 0) and tid not in self.rqdata.runq_setscene_tids:
  1796. endpoints2[tid] = set()
  1797. process_endpoints2(endpoints2)
  1798. self.unskippable = []
  1799. for tid in self.rqdata.runq_setscene_tids:
  1800. if sq_revdeps_new2[tid]:
  1801. self.unskippable.append(tid)
  1802. self.rqdata.init_progress_reporter.next_stage(len(self.rqdata.runtaskentries))
  1803. for taskcounter, tid in enumerate(self.rqdata.runtaskentries):
  1804. if tid in self.rqdata.runq_setscene_tids:
  1805. deps = set()
  1806. for dep in sq_revdeps_new[tid]:
  1807. deps.add(dep)
  1808. sq_revdeps_squash[tid] = deps
  1809. elif len(sq_revdeps_new[tid]) != 0:
  1810. bb.msg.fatal("RunQueue", "Something went badly wrong during scenequeue generation, aborting. Please report this problem.")
  1811. self.rqdata.init_progress_reporter.update(taskcounter)
  1812. self.rqdata.init_progress_reporter.next_stage()
  1813. # Resolve setscene inter-task dependencies
  1814. # e.g. do_sometask_setscene[depends] = "targetname:do_someothertask_setscene"
  1815. # Note that anything explicitly depended upon will have its reverse dependencies removed to avoid circular dependencies
  1816. for tid in self.rqdata.runq_setscene_tids:
  1817. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  1818. realtid = tid + "_setscene"
  1819. idepends = self.rqdata.taskData[mc].taskentries[realtid].idepends
  1820. self.stamps[tid] = bb.build.stampfile(taskname + "_setscene", self.rqdata.dataCaches[mc], taskfn, noextra=True)
  1821. for (depname, idependtask) in idepends:
  1822. if depname not in self.rqdata.taskData[mc].build_targets:
  1823. continue
  1824. depfn = self.rqdata.taskData[mc].build_targets[depname][0]
  1825. if depfn is None:
  1826. continue
  1827. deptid = depfn + ":" + idependtask.replace("_setscene", "")
  1828. if deptid not in self.rqdata.runtaskentries:
  1829. bb.msg.fatal("RunQueue", "Task %s depends upon non-existent task %s:%s" % (realtid, depfn, idependtask))
  1830. if not deptid in self.sq_harddeps:
  1831. self.sq_harddeps[deptid] = set()
  1832. self.sq_harddeps[deptid].add(tid)
  1833. sq_revdeps_squash[tid].add(deptid)
  1834. # Have to zero this to avoid circular dependencies
  1835. sq_revdeps_squash[deptid] = set()
  1836. self.rqdata.init_progress_reporter.next_stage()
  1837. for task in self.sq_harddeps:
  1838. for dep in self.sq_harddeps[task]:
  1839. sq_revdeps_squash[dep].add(task)
  1840. self.rqdata.init_progress_reporter.next_stage()
  1841. #for tid in sq_revdeps_squash:
  1842. # for dep in sq_revdeps_squash[tid]:
  1843. # data = data + "\n %s" % dep
  1844. # bb.warn("Task %s_setscene: is %s " % (tid, data
  1845. self.sq_deps = {}
  1846. self.sq_revdeps = sq_revdeps_squash
  1847. self.sq_revdeps2 = copy.deepcopy(self.sq_revdeps)
  1848. for tid in self.sq_revdeps:
  1849. self.sq_deps[tid] = set()
  1850. for tid in self.sq_revdeps:
  1851. for dep in self.sq_revdeps[tid]:
  1852. self.sq_deps[dep].add(tid)
  1853. self.rqdata.init_progress_reporter.next_stage()
  1854. for tid in self.sq_revdeps:
  1855. if len(self.sq_revdeps[tid]) == 0:
  1856. self.runq_buildable.add(tid)
  1857. self.rqdata.init_progress_reporter.finish()
  1858. self.outrightfail = []
  1859. if self.rq.hashvalidate:
  1860. sq_hash = []
  1861. sq_hashfn = []
  1862. sq_fn = []
  1863. sq_taskname = []
  1864. sq_task = []
  1865. noexec = []
  1866. stamppresent = []
  1867. for tid in self.sq_revdeps:
  1868. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  1869. taskdep = self.rqdata.dataCaches[mc].task_deps[taskfn]
  1870. if 'noexec' in taskdep and taskname in taskdep['noexec']:
  1871. noexec.append(tid)
  1872. self.task_skip(tid)
  1873. bb.build.make_stamp(taskname + "_setscene", self.rqdata.dataCaches[mc], taskfn)
  1874. continue
  1875. if self.rq.check_stamp_task(tid, taskname + "_setscene", cache=self.stampcache):
  1876. logger.debug(2, 'Setscene stamp current for task %s', tid)
  1877. stamppresent.append(tid)
  1878. self.task_skip(tid)
  1879. continue
  1880. if self.rq.check_stamp_task(tid, taskname, recurse = True, cache=self.stampcache):
  1881. logger.debug(2, 'Normal stamp current for task %s', tid)
  1882. stamppresent.append(tid)
  1883. self.task_skip(tid)
  1884. continue
  1885. sq_fn.append(fn)
  1886. sq_hashfn.append(self.rqdata.dataCaches[mc].hashfn[taskfn])
  1887. sq_hash.append(self.rqdata.runtaskentries[tid].hash)
  1888. sq_taskname.append(taskname)
  1889. sq_task.append(tid)
  1890. call = self.rq.hashvalidate + "(sq_fn, sq_task, sq_hash, sq_hashfn, d)"
  1891. locs = { "sq_fn" : sq_fn, "sq_task" : sq_taskname, "sq_hash" : sq_hash, "sq_hashfn" : sq_hashfn, "d" : self.cooker.data }
  1892. valid = bb.utils.better_eval(call, locs)
  1893. valid_new = stamppresent
  1894. for v in valid:
  1895. valid_new.append(sq_task[v])
  1896. for tid in self.sq_revdeps:
  1897. if tid not in valid_new and tid not in noexec:
  1898. logger.debug(2, 'No package found, so skipping setscene task %s', tid)
  1899. self.outrightfail.append(tid)
  1900. logger.info('Executing SetScene Tasks')
  1901. self.rq.state = runQueueSceneRun
  1902. def scenequeue_updatecounters(self, task, fail = False):
  1903. for dep in self.sq_deps[task]:
  1904. if fail and task in self.sq_harddeps and dep in self.sq_harddeps[task]:
  1905. logger.debug(2, "%s was unavailable and is a hard dependency of %s so skipping" % (task, dep))
  1906. self.scenequeue_updatecounters(dep, fail)
  1907. continue
  1908. if task not in self.sq_revdeps2[dep]:
  1909. # May already have been removed by the fail case above
  1910. continue
  1911. self.sq_revdeps2[dep].remove(task)
  1912. if len(self.sq_revdeps2[dep]) == 0:
  1913. self.runq_buildable.add(dep)
  1914. def task_completeoutright(self, task):
  1915. """
  1916. Mark a task as completed
  1917. Look at the reverse dependencies and mark any task with
  1918. completed dependencies as buildable
  1919. """
  1920. logger.debug(1, 'Found task %s which could be accelerated', task)
  1921. self.scenequeue_covered.add(task)
  1922. self.scenequeue_updatecounters(task)
  1923. def check_taskfail(self, task):
  1924. if self.rqdata.setscenewhitelist:
  1925. realtask = task.split('_setscene')[0]
  1926. (mc, fn, taskname, taskfn) = split_tid_mcfn(realtask)
  1927. pn = self.rqdata.dataCaches[mc].pkg_fn[taskfn]
  1928. if not check_setscene_enforce_whitelist(pn, taskname, self.rqdata.setscenewhitelist):
  1929. logger.error('Task %s.%s failed' % (pn, taskname + "_setscene"))
  1930. self.rq.state = runQueueCleanUp
  1931. def task_complete(self, task):
  1932. self.stats.taskCompleted()
  1933. bb.event.fire(sceneQueueTaskCompleted(task, self.stats, self.rq), self.cfgData)
  1934. self.task_completeoutright(task)
  1935. def task_fail(self, task, result):
  1936. self.stats.taskFailed()
  1937. bb.event.fire(sceneQueueTaskFailed(task, self.stats, result, self), self.cfgData)
  1938. self.scenequeue_notcovered.add(task)
  1939. self.scenequeue_updatecounters(task, True)
  1940. self.check_taskfail(task)
  1941. def task_failoutright(self, task):
  1942. self.runq_running.add(task)
  1943. self.runq_buildable.add(task)
  1944. self.stats.taskCompleted()
  1945. self.stats.taskSkipped()
  1946. self.scenequeue_notcovered.add(task)
  1947. self.scenequeue_updatecounters(task, True)
  1948. def task_skip(self, task):
  1949. self.runq_running.add(task)
  1950. self.runq_buildable.add(task)
  1951. self.task_completeoutright(task)
  1952. self.stats.taskCompleted()
  1953. self.stats.taskSkipped()
  1954. def execute(self):
  1955. """
  1956. Run the tasks in a queue prepared by prepare_runqueue
  1957. """
  1958. self.rq.read_workers()
  1959. task = None
  1960. if self.stats.active < self.number_tasks:
  1961. # Find the next setscene to run
  1962. for nexttask in self.rqdata.runq_setscene_tids:
  1963. if nexttask in self.runq_buildable and nexttask not in self.runq_running and self.stamps[nexttask] not in self.build_stamps.values():
  1964. if nexttask in self.unskippable:
  1965. logger.debug(2, "Setscene task %s is unskippable" % nexttask)
  1966. if nexttask not in self.unskippable and len(self.sq_revdeps[nexttask]) > 0 and self.sq_revdeps[nexttask].issubset(self.scenequeue_covered) and self.check_dependencies(nexttask, self.sq_revdeps[nexttask], True):
  1967. fn = fn_from_tid(nexttask)
  1968. foundtarget = False
  1969. if nexttask in self.rqdata.target_tids:
  1970. foundtarget = True
  1971. if not foundtarget:
  1972. logger.debug(2, "Skipping setscene for task %s" % nexttask)
  1973. self.task_skip(nexttask)
  1974. self.scenequeue_notneeded.add(nexttask)
  1975. return True
  1976. if nexttask in self.outrightfail:
  1977. self.task_failoutright(nexttask)
  1978. return True
  1979. task = nexttask
  1980. break
  1981. if task is not None:
  1982. (mc, fn, taskname, taskfn) = split_tid_mcfn(task)
  1983. taskname = taskname + "_setscene"
  1984. if self.rq.check_stamp_task(task, taskname_from_tid(task), recurse = True, cache=self.stampcache):
  1985. logger.debug(2, 'Stamp for underlying task %s is current, so skipping setscene variant', task)
  1986. self.task_failoutright(task)
  1987. return True
  1988. if self.cooker.configuration.force:
  1989. if task in self.rqdata.target_tids:
  1990. self.task_failoutright(task)
  1991. return True
  1992. if self.rq.check_stamp_task(task, taskname, cache=self.stampcache):
  1993. logger.debug(2, 'Setscene stamp current task %s, so skip it and its dependencies', task)
  1994. self.task_skip(task)
  1995. return True
  1996. startevent = sceneQueueTaskStarted(task, self.stats, self.rq)
  1997. bb.event.fire(startevent, self.cfgData)
  1998. taskdepdata = self.build_taskdepdata(task)
  1999. taskdep = self.rqdata.dataCaches[mc].task_deps[taskfn]
  2000. if 'fakeroot' in taskdep and taskname in taskdep['fakeroot'] and not self.cooker.configuration.dry_run:
  2001. if not mc in self.rq.fakeworker:
  2002. self.rq.start_fakeworker(self, mc)
  2003. self.rq.fakeworker[mc].process.stdin.write(b"<runtask>" + pickle.dumps((taskfn, task, taskname, True, self.cooker.collection.get_file_appends(taskfn), taskdepdata, False)) + b"</runtask>")
  2004. self.rq.fakeworker[mc].process.stdin.flush()
  2005. else:
  2006. self.rq.worker[mc].process.stdin.write(b"<runtask>" + pickle.dumps((taskfn, task, taskname, True, self.cooker.collection.get_file_appends(taskfn), taskdepdata, False)) + b"</runtask>")
  2007. self.rq.worker[mc].process.stdin.flush()
  2008. self.build_stamps[task] = bb.build.stampfile(taskname, self.rqdata.dataCaches[mc], taskfn, noextra=True)
  2009. self.build_stamps2.append(self.build_stamps[task])
  2010. self.runq_running.add(task)
  2011. self.stats.taskActive()
  2012. if self.stats.active < self.number_tasks:
  2013. return True
  2014. if self.stats.active > 0:
  2015. self.rq.read_workers()
  2016. return self.rq.active_fds()
  2017. #for tid in self.sq_revdeps:
  2018. # if tid not in self.runq_running:
  2019. # buildable = tid in self.runq_buildable
  2020. # revdeps = self.sq_revdeps[tid]
  2021. # bb.warn("Found we didn't run %s %s %s" % (tid, buildable, str(revdeps)))
  2022. self.rq.scenequeue_covered = self.scenequeue_covered
  2023. self.rq.scenequeue_notcovered = self.scenequeue_notcovered
  2024. logger.debug(1, 'We can skip tasks %s', sorted(self.rq.scenequeue_covered))
  2025. self.rq.state = runQueueRunInit
  2026. completeevent = sceneQueueComplete(self.stats, self.rq)
  2027. bb.event.fire(completeevent, self.cfgData)
  2028. return True
  2029. def runqueue_process_waitpid(self, task, status):
  2030. RunQueueExecute.runqueue_process_waitpid(self, task, status)
  2031. def build_taskdepdata(self, task):
  2032. def getsetscenedeps(tid):
  2033. deps = set()
  2034. (mc, fn, taskname, _) = split_tid_mcfn(tid)
  2035. realtid = tid + "_setscene"
  2036. idepends = self.rqdata.taskData[mc].taskentries[realtid].idepends
  2037. for (depname, idependtask) in idepends:
  2038. if depname not in self.rqdata.taskData[mc].build_targets:
  2039. continue
  2040. depfn = self.rqdata.taskData[mc].build_targets[depname][0]
  2041. if depfn is None:
  2042. continue
  2043. deptid = depfn + ":" + idependtask.replace("_setscene", "")
  2044. deps.add(deptid)
  2045. return deps
  2046. taskdepdata = {}
  2047. next = getsetscenedeps(task)
  2048. next.add(task)
  2049. while next:
  2050. additional = []
  2051. for revdep in next:
  2052. (mc, fn, taskname, taskfn) = split_tid_mcfn(revdep)
  2053. pn = self.rqdata.dataCaches[mc].pkg_fn[taskfn]
  2054. deps = getsetscenedeps(revdep)
  2055. provides = self.rqdata.dataCaches[mc].fn_provides[taskfn]
  2056. taskhash = self.rqdata.runtaskentries[revdep].hash
  2057. taskdepdata[revdep] = [pn, taskname, fn, deps, provides, taskhash]
  2058. for revdep2 in deps:
  2059. if revdep2 not in taskdepdata:
  2060. additional.append(revdep2)
  2061. next = additional
  2062. #bb.note("Task %s: " % task + str(taskdepdata).replace("], ", "],\n"))
  2063. return taskdepdata
  2064. class TaskFailure(Exception):
  2065. """
  2066. Exception raised when a task in a runqueue fails
  2067. """
  2068. def __init__(self, x):
  2069. self.args = x
  2070. class runQueueExitWait(bb.event.Event):
  2071. """
  2072. Event when waiting for task processes to exit
  2073. """
  2074. def __init__(self, remain):
  2075. self.remain = remain
  2076. self.message = "Waiting for %s active tasks to finish" % remain
  2077. bb.event.Event.__init__(self)
  2078. class runQueueEvent(bb.event.Event):
  2079. """
  2080. Base runQueue event class
  2081. """
  2082. def __init__(self, task, stats, rq):
  2083. self.taskid = task
  2084. self.taskstring = task
  2085. self.taskname = taskname_from_tid(task)
  2086. self.taskfile = fn_from_tid(task)
  2087. self.taskhash = rq.rqdata.get_task_hash(task)
  2088. self.stats = stats.copy()
  2089. bb.event.Event.__init__(self)
  2090. class sceneQueueEvent(runQueueEvent):
  2091. """
  2092. Base sceneQueue event class
  2093. """
  2094. def __init__(self, task, stats, rq, noexec=False):
  2095. runQueueEvent.__init__(self, task, stats, rq)
  2096. self.taskstring = task + "_setscene"
  2097. self.taskname = taskname_from_tid(task) + "_setscene"
  2098. self.taskfile = fn_from_tid(task)
  2099. self.taskhash = rq.rqdata.get_task_hash(task)
  2100. class runQueueTaskStarted(runQueueEvent):
  2101. """
  2102. Event notifying a task was started
  2103. """
  2104. def __init__(self, task, stats, rq, noexec=False):
  2105. runQueueEvent.__init__(self, task, stats, rq)
  2106. self.noexec = noexec
  2107. class sceneQueueTaskStarted(sceneQueueEvent):
  2108. """
  2109. Event notifying a setscene task was started
  2110. """
  2111. def __init__(self, task, stats, rq, noexec=False):
  2112. sceneQueueEvent.__init__(self, task, stats, rq)
  2113. self.noexec = noexec
  2114. class runQueueTaskFailed(runQueueEvent):
  2115. """
  2116. Event notifying a task failed
  2117. """
  2118. def __init__(self, task, stats, exitcode, rq):
  2119. runQueueEvent.__init__(self, task, stats, rq)
  2120. self.exitcode = exitcode
  2121. def __str__(self):
  2122. return "Task (%s) failed with exit code '%s'" % (self.taskstring, self.exitcode)
  2123. class sceneQueueTaskFailed(sceneQueueEvent):
  2124. """
  2125. Event notifying a setscene task failed
  2126. """
  2127. def __init__(self, task, stats, exitcode, rq):
  2128. sceneQueueEvent.__init__(self, task, stats, rq)
  2129. self.exitcode = exitcode
  2130. def __str__(self):
  2131. return "Setscene task (%s) failed with exit code '%s' - real task will be run instead" % (self.taskstring, self.exitcode)
  2132. class sceneQueueComplete(sceneQueueEvent):
  2133. """
  2134. Event when all the sceneQueue tasks are complete
  2135. """
  2136. def __init__(self, stats, rq):
  2137. self.stats = stats.copy()
  2138. bb.event.Event.__init__(self)
  2139. class runQueueTaskCompleted(runQueueEvent):
  2140. """
  2141. Event notifying a task completed
  2142. """
  2143. class sceneQueueTaskCompleted(sceneQueueEvent):
  2144. """
  2145. Event notifying a setscene task completed
  2146. """
  2147. class runQueueTaskSkipped(runQueueEvent):
  2148. """
  2149. Event notifying a task was skipped
  2150. """
  2151. def __init__(self, task, stats, rq, reason):
  2152. runQueueEvent.__init__(self, task, stats, rq)
  2153. self.reason = reason
  2154. class runQueuePipe():
  2155. """
  2156. Abstraction for a pipe between a worker thread and the server
  2157. """
  2158. def __init__(self, pipein, pipeout, d, rq, rqexec):
  2159. self.input = pipein
  2160. if pipeout:
  2161. pipeout.close()
  2162. bb.utils.nonblockingfd(self.input)
  2163. self.queue = b""
  2164. self.d = d
  2165. self.rq = rq
  2166. self.rqexec = rqexec
  2167. def setrunqueueexec(self, rqexec):
  2168. self.rqexec = rqexec
  2169. def read(self):
  2170. for workers, name in [(self.rq.worker, "Worker"), (self.rq.fakeworker, "Fakeroot")]:
  2171. for worker in workers.values():
  2172. worker.process.poll()
  2173. if worker.process.returncode is not None and not self.rq.teardown:
  2174. bb.error("%s process (%s) exited unexpectedly (%s), shutting down..." % (name, worker.process.pid, str(worker.process.returncode)))
  2175. self.rq.finish_runqueue(True)
  2176. start = len(self.queue)
  2177. try:
  2178. self.queue = self.queue + (self.input.read(102400) or b"")
  2179. except (OSError, IOError) as e:
  2180. if e.errno != errno.EAGAIN:
  2181. raise
  2182. end = len(self.queue)
  2183. found = True
  2184. while found and len(self.queue):
  2185. found = False
  2186. index = self.queue.find(b"</event>")
  2187. while index != -1 and self.queue.startswith(b"<event>"):
  2188. try:
  2189. event = pickle.loads(self.queue[7:index])
  2190. except ValueError as e:
  2191. bb.msg.fatal("RunQueue", "failed load pickle '%s': '%s'" % (e, self.queue[7:index]))
  2192. bb.event.fire_from_worker(event, self.d)
  2193. found = True
  2194. self.queue = self.queue[index+8:]
  2195. index = self.queue.find(b"</event>")
  2196. index = self.queue.find(b"</exitcode>")
  2197. while index != -1 and self.queue.startswith(b"<exitcode>"):
  2198. try:
  2199. task, status = pickle.loads(self.queue[10:index])
  2200. except ValueError as e:
  2201. bb.msg.fatal("RunQueue", "failed load pickle '%s': '%s'" % (e, self.queue[10:index]))
  2202. self.rqexec.runqueue_process_waitpid(task, status)
  2203. found = True
  2204. self.queue = self.queue[index+11:]
  2205. index = self.queue.find(b"</exitcode>")
  2206. return (end > start)
  2207. def close(self):
  2208. while self.read():
  2209. continue
  2210. if len(self.queue) > 0:
  2211. print("Warning, worker left partial message: %s" % self.queue)
  2212. self.input.close()
  2213. def get_setscene_enforce_whitelist(d):
  2214. if d.getVar('BB_SETSCENE_ENFORCE') != '1':
  2215. return None
  2216. whitelist = (d.getVar("BB_SETSCENE_ENFORCE_WHITELIST") or "").split()
  2217. outlist = []
  2218. for item in whitelist[:]:
  2219. if item.startswith('%:'):
  2220. for target in sys.argv[1:]:
  2221. if not target.startswith('-'):
  2222. outlist.append(target.split(':')[0] + ':' + item.split(':')[1])
  2223. else:
  2224. outlist.append(item)
  2225. return outlist
  2226. def check_setscene_enforce_whitelist(pn, taskname, whitelist):
  2227. import fnmatch
  2228. if whitelist:
  2229. item = '%s:%s' % (pn, taskname)
  2230. for whitelist_item in whitelist:
  2231. if fnmatch.fnmatch(item, whitelist_item):
  2232. return True
  2233. return False
  2234. return True