runqueue.py 143 KB

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