runqueue.py 122 KB

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