runqueue.py 112 KB

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