runqueue.py 142 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401
  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. taskData[mc].taskentries[tid].tdepends.append(newdep)
  636. for mc in taskData:
  637. for tid in taskData[mc].taskentries:
  638. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  639. #runtid = build_tid(mc, fn, taskname)
  640. #logger.debug2("Processing %s,%s:%s", mc, fn, taskname)
  641. depends = set()
  642. task_deps = self.dataCaches[mc].task_deps[taskfn]
  643. self.runtaskentries[tid] = RunTaskEntry()
  644. if fn in taskData[mc].failed_fns:
  645. continue
  646. # We add multiconfig dependencies before processing internal task deps (tdepends)
  647. if 'mcdepends' in task_deps and taskname in task_deps['mcdepends']:
  648. add_mc_dependencies(mc, tid)
  649. # Resolve task internal dependencies
  650. #
  651. # e.g. addtask before X after Y
  652. for t in taskData[mc].taskentries[tid].tdepends:
  653. (depmc, depfn, deptaskname, _) = split_tid_mcfn(t)
  654. depends.add(build_tid(depmc, depfn, deptaskname))
  655. # Resolve 'deptask' dependencies
  656. #
  657. # e.g. do_sometask[deptask] = "do_someothertask"
  658. # (makes sure sometask runs after someothertask of all DEPENDS)
  659. if 'deptask' in task_deps and taskname in task_deps['deptask']:
  660. tasknames = task_deps['deptask'][taskname].split()
  661. add_build_dependencies(taskData[mc].depids[taskfn], tasknames, depends, mc)
  662. # Resolve 'rdeptask' dependencies
  663. #
  664. # e.g. do_sometask[rdeptask] = "do_someothertask"
  665. # (makes sure sometask runs after someothertask of all RDEPENDS)
  666. if 'rdeptask' in task_deps and taskname in task_deps['rdeptask']:
  667. tasknames = task_deps['rdeptask'][taskname].split()
  668. add_runtime_dependencies(taskData[mc].rdepids[taskfn], tasknames, depends, mc)
  669. # Resolve inter-task dependencies
  670. #
  671. # e.g. do_sometask[depends] = "targetname:do_someothertask"
  672. # (makes sure sometask runs after targetname's someothertask)
  673. idepends = taskData[mc].taskentries[tid].idepends
  674. for (depname, idependtask) in idepends:
  675. if depname in taskData[mc].build_targets and taskData[mc].build_targets[depname] and not depname in taskData[mc].failed_deps:
  676. # Won't be in build_targets if ASSUME_PROVIDED
  677. depdata = taskData[mc].build_targets[depname][0]
  678. if depdata is not None:
  679. t = depdata + ":" + idependtask
  680. depends.add(t)
  681. if t not in taskData[mc].taskentries:
  682. bb.msg.fatal("RunQueue", "Task %s in %s depends upon non-existent task %s in %s" % (taskname, fn, idependtask, depdata))
  683. irdepends = taskData[mc].taskentries[tid].irdepends
  684. for (depname, idependtask) in irdepends:
  685. if depname in taskData[mc].run_targets:
  686. # Won't be in run_targets if ASSUME_PROVIDED
  687. if not taskData[mc].run_targets[depname]:
  688. continue
  689. depdata = taskData[mc].run_targets[depname][0]
  690. if depdata is not None:
  691. t = depdata + ":" + idependtask
  692. depends.add(t)
  693. if t not in taskData[mc].taskentries:
  694. bb.msg.fatal("RunQueue", "Task %s in %s rdepends upon non-existent task %s in %s" % (taskname, fn, idependtask, depdata))
  695. # Resolve recursive 'recrdeptask' dependencies (Part A)
  696. #
  697. # e.g. do_sometask[recrdeptask] = "do_someothertask"
  698. # (makes sure sometask runs after someothertask of all DEPENDS, RDEPENDS and intertask dependencies, recursively)
  699. # We cover the recursive part of the dependencies below
  700. if 'recrdeptask' in task_deps and taskname in task_deps['recrdeptask']:
  701. tasknames = task_deps['recrdeptask'][taskname].split()
  702. recursivetasks[tid] = tasknames
  703. add_build_dependencies(taskData[mc].depids[taskfn], tasknames, depends, mc)
  704. add_runtime_dependencies(taskData[mc].rdepids[taskfn], tasknames, depends, mc)
  705. if taskname in tasknames:
  706. recursivetasksselfref.add(tid)
  707. if 'recideptask' in task_deps and taskname in task_deps['recideptask']:
  708. recursiveitasks[tid] = []
  709. for t in task_deps['recideptask'][taskname].split():
  710. newdep = build_tid(mc, fn, t)
  711. recursiveitasks[tid].append(newdep)
  712. self.runtaskentries[tid].depends = depends
  713. # Remove all self references
  714. self.runtaskentries[tid].depends.discard(tid)
  715. #self.dump_data()
  716. self.init_progress_reporter.next_stage()
  717. bb.event.check_for_interrupts(self.cooker.data)
  718. # Resolve recursive 'recrdeptask' dependencies (Part B)
  719. #
  720. # e.g. do_sometask[recrdeptask] = "do_someothertask"
  721. # (makes sure sometask runs after someothertask of all DEPENDS, RDEPENDS and intertask dependencies, recursively)
  722. # We need to do this separately since we need all of runtaskentries[*].depends to be complete before this is processed
  723. # Generating/interating recursive lists of dependencies is painful and potentially slow
  724. # Precompute recursive task dependencies here by:
  725. # a) create a temp list of reverse dependencies (revdeps)
  726. # b) walk up the ends of the chains (when a given task no longer has dependencies i.e. len(deps) == 0)
  727. # c) combine the total list of dependencies in cumulativedeps
  728. # d) optimise by pre-truncating 'task' off the items in cumulativedeps (keeps items in sets lower)
  729. revdeps = {}
  730. deps = {}
  731. cumulativedeps = {}
  732. for tid in self.runtaskentries:
  733. deps[tid] = set(self.runtaskentries[tid].depends)
  734. revdeps[tid] = set()
  735. cumulativedeps[tid] = set()
  736. # Generate a temp list of reverse dependencies
  737. for tid in self.runtaskentries:
  738. for dep in self.runtaskentries[tid].depends:
  739. revdeps[dep].add(tid)
  740. # Find the dependency chain endpoints
  741. endpoints = set()
  742. for tid in self.runtaskentries:
  743. if not deps[tid]:
  744. endpoints.add(tid)
  745. # Iterate the chains collating dependencies
  746. while endpoints:
  747. next = set()
  748. for tid in endpoints:
  749. for dep in revdeps[tid]:
  750. cumulativedeps[dep].add(fn_from_tid(tid))
  751. cumulativedeps[dep].update(cumulativedeps[tid])
  752. if tid in deps[dep]:
  753. deps[dep].remove(tid)
  754. if not deps[dep]:
  755. next.add(dep)
  756. endpoints = next
  757. #for tid in deps:
  758. # if deps[tid]:
  759. # bb.warn("Sanity test failure, dependencies left for %s (%s)" % (tid, deps[tid]))
  760. # Loop here since recrdeptasks can depend upon other recrdeptasks and we have to
  761. # resolve these recursively until we aren't adding any further extra dependencies
  762. extradeps = True
  763. while extradeps:
  764. extradeps = 0
  765. for tid in recursivetasks:
  766. tasknames = recursivetasks[tid]
  767. totaldeps = set(self.runtaskentries[tid].depends)
  768. if tid in recursiveitasks:
  769. totaldeps.update(recursiveitasks[tid])
  770. for dep in recursiveitasks[tid]:
  771. if dep not in self.runtaskentries:
  772. continue
  773. totaldeps.update(self.runtaskentries[dep].depends)
  774. deps = set()
  775. for dep in totaldeps:
  776. if dep in cumulativedeps:
  777. deps.update(cumulativedeps[dep])
  778. for t in deps:
  779. for taskname in tasknames:
  780. newtid = t + ":" + taskname
  781. if newtid == tid:
  782. continue
  783. if newtid in self.runtaskentries and newtid not in self.runtaskentries[tid].depends:
  784. extradeps += 1
  785. self.runtaskentries[tid].depends.add(newtid)
  786. # Handle recursive tasks which depend upon other recursive tasks
  787. deps = set()
  788. for dep in self.runtaskentries[tid].depends.intersection(recursivetasks):
  789. deps.update(self.runtaskentries[dep].depends.difference(self.runtaskentries[tid].depends))
  790. for newtid in deps:
  791. for taskname in tasknames:
  792. if not newtid.endswith(":" + taskname):
  793. continue
  794. if newtid in self.runtaskentries:
  795. extradeps += 1
  796. self.runtaskentries[tid].depends.add(newtid)
  797. bb.debug(1, "Added %s recursive dependencies in this loop" % extradeps)
  798. # Remove recrdeptask circular references so that do_a[recrdeptask] = "do_a do_b" can work
  799. for tid in recursivetasksselfref:
  800. self.runtaskentries[tid].depends.difference_update(recursivetasksselfref)
  801. self.init_progress_reporter.next_stage()
  802. bb.event.check_for_interrupts(self.cooker.data)
  803. #self.dump_data()
  804. # Step B - Mark all active tasks
  805. #
  806. # Start with the tasks we were asked to run and mark all dependencies
  807. # as active too. If the task is to be 'forced', clear its stamp. Once
  808. # all active tasks are marked, prune the ones we don't need.
  809. logger.verbose("Marking Active Tasks")
  810. def mark_active(tid, depth):
  811. """
  812. Mark an item as active along with its depends
  813. (calls itself recursively)
  814. """
  815. if tid in runq_build:
  816. return
  817. runq_build[tid] = 1
  818. depends = self.runtaskentries[tid].depends
  819. for depend in depends:
  820. mark_active(depend, depth+1)
  821. def invalidate_task(tid, error_nostamp):
  822. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  823. taskdep = self.dataCaches[mc].task_deps[taskfn]
  824. if fn + ":" + taskname not in taskData[mc].taskentries:
  825. logger.warning("Task %s does not exist, invalidating this task will have no effect" % taskname)
  826. if 'nostamp' in taskdep and taskname in taskdep['nostamp']:
  827. if error_nostamp:
  828. bb.fatal("Task %s is marked nostamp, cannot invalidate this task" % taskname)
  829. else:
  830. bb.debug(1, "Task %s is marked nostamp, cannot invalidate this task" % taskname)
  831. else:
  832. logger.verbose("Invalidate task %s, %s", taskname, fn)
  833. bb.parse.siggen.invalidate_task(taskname, taskfn)
  834. self.target_tids = []
  835. for (mc, target, task, fn) in self.targets:
  836. if target not in taskData[mc].build_targets or not taskData[mc].build_targets[target]:
  837. continue
  838. if target in taskData[mc].failed_deps:
  839. continue
  840. parents = False
  841. if task.endswith('-'):
  842. parents = True
  843. task = task[:-1]
  844. if fn in taskData[mc].failed_fns:
  845. continue
  846. # fn already has mc prefix
  847. tid = fn + ":" + task
  848. self.target_tids.append(tid)
  849. if tid not in taskData[mc].taskentries:
  850. import difflib
  851. tasks = []
  852. for x in taskData[mc].taskentries:
  853. if x.startswith(fn + ":"):
  854. tasks.append(taskname_from_tid(x))
  855. close_matches = difflib.get_close_matches(task, tasks, cutoff=0.7)
  856. if close_matches:
  857. extra = ". Close matches:\n %s" % "\n ".join(close_matches)
  858. else:
  859. extra = ""
  860. bb.msg.fatal("RunQueue", "Task %s does not exist for target %s (%s)%s" % (task, target, tid, extra))
  861. # For tasks called "XXXX-", ony run their dependencies
  862. if parents:
  863. for i in self.runtaskentries[tid].depends:
  864. mark_active(i, 1)
  865. else:
  866. mark_active(tid, 1)
  867. self.init_progress_reporter.next_stage()
  868. bb.event.check_for_interrupts(self.cooker.data)
  869. # Step C - Prune all inactive tasks
  870. #
  871. # Once all active tasks are marked, prune the ones we don't need.
  872. # Handle --runall
  873. if self.cooker.configuration.runall:
  874. # re-run the mark_active and then drop unused tasks from new list
  875. runall_tids = set()
  876. added = True
  877. while added:
  878. reduced_tasklist = set(self.runtaskentries.keys())
  879. for tid in list(self.runtaskentries.keys()):
  880. if tid not in runq_build:
  881. reduced_tasklist.remove(tid)
  882. runq_build = {}
  883. orig = runall_tids
  884. runall_tids = set()
  885. for task in self.cooker.configuration.runall:
  886. if not task.startswith("do_"):
  887. task = "do_{0}".format(task)
  888. for tid in reduced_tasklist:
  889. wanttid = "{0}:{1}".format(fn_from_tid(tid), task)
  890. if wanttid in self.runtaskentries:
  891. runall_tids.add(wanttid)
  892. for tid in list(runall_tids):
  893. mark_active(tid, 1)
  894. self.target_tids.append(tid)
  895. if self.cooker.configuration.force:
  896. invalidate_task(tid, False)
  897. added = runall_tids - orig
  898. delcount = set()
  899. for tid in list(self.runtaskentries.keys()):
  900. if tid not in runq_build:
  901. delcount.add(tid)
  902. del self.runtaskentries[tid]
  903. if self.cooker.configuration.runall:
  904. if not self.runtaskentries:
  905. 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)))
  906. self.init_progress_reporter.next_stage()
  907. bb.event.check_for_interrupts(self.cooker.data)
  908. # Handle runonly
  909. if self.cooker.configuration.runonly:
  910. # re-run the mark_active and then drop unused tasks from new list
  911. runq_build = {}
  912. for task in self.cooker.configuration.runonly:
  913. if not task.startswith("do_"):
  914. task = "do_{0}".format(task)
  915. runonly_tids = [k for k in self.runtaskentries.keys() if taskname_from_tid(k) == task]
  916. for tid in runonly_tids:
  917. mark_active(tid, 1)
  918. if self.cooker.configuration.force:
  919. invalidate_task(tid, False)
  920. for tid in list(self.runtaskentries.keys()):
  921. if tid not in runq_build:
  922. delcount.add(tid)
  923. del self.runtaskentries[tid]
  924. if not self.runtaskentries:
  925. 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)))
  926. #
  927. # Step D - Sanity checks and computation
  928. #
  929. # Check to make sure we still have tasks to run
  930. if not self.runtaskentries:
  931. if not taskData[''].halt:
  932. 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.")
  933. else:
  934. bb.msg.fatal("RunQueue", "No active tasks and not in --continue mode?! Please report this bug.")
  935. logger.verbose("Pruned %s inactive tasks, %s left", len(delcount), len(self.runtaskentries))
  936. logger.verbose("Assign Weightings")
  937. self.init_progress_reporter.next_stage()
  938. bb.event.check_for_interrupts(self.cooker.data)
  939. # Generate a list of reverse dependencies to ease future calculations
  940. for tid in self.runtaskentries:
  941. for dep in self.runtaskentries[tid].depends:
  942. self.runtaskentries[dep].revdeps.add(tid)
  943. self.init_progress_reporter.next_stage()
  944. bb.event.check_for_interrupts(self.cooker.data)
  945. # Identify tasks at the end of dependency chains
  946. # Error on circular dependency loops (length two)
  947. endpoints = []
  948. for tid in self.runtaskentries:
  949. revdeps = self.runtaskentries[tid].revdeps
  950. if not revdeps:
  951. endpoints.append(tid)
  952. for dep in revdeps:
  953. if dep in self.runtaskentries[tid].depends:
  954. bb.msg.fatal("RunQueue", "Task %s has circular dependency on %s" % (tid, dep))
  955. logger.verbose("Compute totals (have %s endpoint(s))", len(endpoints))
  956. self.init_progress_reporter.next_stage()
  957. bb.event.check_for_interrupts(self.cooker.data)
  958. # Calculate task weights
  959. # Check of higher length circular dependencies
  960. self.runq_weight = self.calculate_task_weights(endpoints)
  961. self.init_progress_reporter.next_stage()
  962. bb.event.check_for_interrupts(self.cooker.data)
  963. # Sanity Check - Check for multiple tasks building the same provider
  964. for mc in self.dataCaches:
  965. prov_list = {}
  966. seen_fn = []
  967. for tid in self.runtaskentries:
  968. (tidmc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  969. if taskfn in seen_fn:
  970. continue
  971. if mc != tidmc:
  972. continue
  973. seen_fn.append(taskfn)
  974. for prov in self.dataCaches[mc].fn_provides[taskfn]:
  975. if prov not in prov_list:
  976. prov_list[prov] = [taskfn]
  977. elif taskfn not in prov_list[prov]:
  978. prov_list[prov].append(taskfn)
  979. for prov in prov_list:
  980. if len(prov_list[prov]) < 2:
  981. continue
  982. if prov in self.multi_provider_allowed:
  983. continue
  984. seen_pn = []
  985. # If two versions of the same PN are being built its fatal, we don't support it.
  986. for fn in prov_list[prov]:
  987. pn = self.dataCaches[mc].pkg_fn[fn]
  988. if pn not in seen_pn:
  989. seen_pn.append(pn)
  990. else:
  991. 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))
  992. msgs = ["Multiple .bb files are due to be built which each provide %s:\n %s" % (prov, "\n ".join(prov_list[prov]))]
  993. #
  994. # Construct a list of things which uniquely depend on each provider
  995. # since this may help the user figure out which dependency is triggering this warning
  996. #
  997. msgs.append("\nA list of tasks depending on these providers is shown and may help explain where the dependency comes from.")
  998. deplist = {}
  999. commondeps = None
  1000. for provfn in prov_list[prov]:
  1001. deps = set()
  1002. for tid in self.runtaskentries:
  1003. fn = fn_from_tid(tid)
  1004. if fn != provfn:
  1005. continue
  1006. for dep in self.runtaskentries[tid].revdeps:
  1007. fn = fn_from_tid(dep)
  1008. if fn == provfn:
  1009. continue
  1010. deps.add(dep)
  1011. if not commondeps:
  1012. commondeps = set(deps)
  1013. else:
  1014. commondeps &= deps
  1015. deplist[provfn] = deps
  1016. for provfn in deplist:
  1017. msgs.append("\n%s has unique dependees:\n %s" % (provfn, "\n ".join(deplist[provfn] - commondeps)))
  1018. #
  1019. # Construct a list of provides and runtime providers for each recipe
  1020. # (rprovides has to cover RPROVIDES, PACKAGES, PACKAGES_DYNAMIC)
  1021. #
  1022. 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.")
  1023. provide_results = {}
  1024. rprovide_results = {}
  1025. commonprovs = None
  1026. commonrprovs = None
  1027. for provfn in prov_list[prov]:
  1028. provides = set(self.dataCaches[mc].fn_provides[provfn])
  1029. rprovides = set()
  1030. for rprovide in self.dataCaches[mc].rproviders:
  1031. if provfn in self.dataCaches[mc].rproviders[rprovide]:
  1032. rprovides.add(rprovide)
  1033. for package in self.dataCaches[mc].packages:
  1034. if provfn in self.dataCaches[mc].packages[package]:
  1035. rprovides.add(package)
  1036. for package in self.dataCaches[mc].packages_dynamic:
  1037. if provfn in self.dataCaches[mc].packages_dynamic[package]:
  1038. rprovides.add(package)
  1039. if not commonprovs:
  1040. commonprovs = set(provides)
  1041. else:
  1042. commonprovs &= provides
  1043. provide_results[provfn] = provides
  1044. if not commonrprovs:
  1045. commonrprovs = set(rprovides)
  1046. else:
  1047. commonrprovs &= rprovides
  1048. rprovide_results[provfn] = rprovides
  1049. #msgs.append("\nCommon provides:\n %s" % ("\n ".join(commonprovs)))
  1050. #msgs.append("\nCommon rprovides:\n %s" % ("\n ".join(commonrprovs)))
  1051. for provfn in prov_list[prov]:
  1052. msgs.append("\n%s has unique provides:\n %s" % (provfn, "\n ".join(provide_results[provfn] - commonprovs)))
  1053. msgs.append("\n%s has unique rprovides:\n %s" % (provfn, "\n ".join(rprovide_results[provfn] - commonrprovs)))
  1054. if self.warn_multi_bb:
  1055. logger.verbnote("".join(msgs))
  1056. else:
  1057. logger.error("".join(msgs))
  1058. self.init_progress_reporter.next_stage()
  1059. self.init_progress_reporter.next_stage()
  1060. bb.event.check_for_interrupts(self.cooker.data)
  1061. # Iterate over the task list looking for tasks with a 'setscene' function
  1062. self.runq_setscene_tids = set()
  1063. if not self.cooker.configuration.nosetscene:
  1064. for tid in self.runtaskentries:
  1065. (mc, fn, taskname, _) = split_tid_mcfn(tid)
  1066. setscenetid = tid + "_setscene"
  1067. if setscenetid not in taskData[mc].taskentries:
  1068. continue
  1069. self.runq_setscene_tids.add(tid)
  1070. self.init_progress_reporter.next_stage()
  1071. bb.event.check_for_interrupts(self.cooker.data)
  1072. # Invalidate task if force mode active
  1073. if self.cooker.configuration.force:
  1074. for tid in self.target_tids:
  1075. invalidate_task(tid, False)
  1076. # Invalidate task if invalidate mode active
  1077. if self.cooker.configuration.invalidate_stamp:
  1078. for tid in self.target_tids:
  1079. fn = fn_from_tid(tid)
  1080. for st in self.cooker.configuration.invalidate_stamp.split(','):
  1081. if not st.startswith("do_"):
  1082. st = "do_%s" % st
  1083. invalidate_task(fn + ":" + st, True)
  1084. self.init_progress_reporter.next_stage()
  1085. bb.event.check_for_interrupts(self.cooker.data)
  1086. # Create and print to the logs a virtual/xxxx -> PN (fn) table
  1087. for mc in taskData:
  1088. virtmap = taskData[mc].get_providermap(prefix="virtual/")
  1089. virtpnmap = {}
  1090. for v in virtmap:
  1091. virtpnmap[v] = self.dataCaches[mc].pkg_fn[virtmap[v]]
  1092. bb.debug(2, "%s resolved to: %s (%s)" % (v, virtpnmap[v], virtmap[v]))
  1093. if hasattr(bb.parse.siggen, "tasks_resolved"):
  1094. bb.parse.siggen.tasks_resolved(virtmap, virtpnmap, self.dataCaches[mc])
  1095. self.init_progress_reporter.next_stage()
  1096. bb.event.check_for_interrupts(self.cooker.data)
  1097. bb.parse.siggen.set_setscene_tasks(self.runq_setscene_tids)
  1098. starttime = time.time()
  1099. lasttime = starttime
  1100. # Iterate over the task list and call into the siggen code
  1101. dealtwith = set()
  1102. todeal = set(self.runtaskentries)
  1103. while todeal:
  1104. ready = set()
  1105. for tid in todeal.copy():
  1106. if not (self.runtaskentries[tid].depends - dealtwith):
  1107. self.runtaskentries[tid].taskhash_deps = bb.parse.siggen.prep_taskhash(tid, self.runtaskentries[tid].depends, self.dataCaches)
  1108. # get_taskhash for a given tid *must* be called before get_unihash* below
  1109. self.runtaskentries[tid].hash = bb.parse.siggen.get_taskhash(tid, self.runtaskentries[tid].depends, self.dataCaches)
  1110. ready.add(tid)
  1111. unihashes = bb.parse.siggen.get_unihashes(ready)
  1112. for tid in ready:
  1113. dealtwith.add(tid)
  1114. todeal.remove(tid)
  1115. self.runtaskentries[tid].unihash = unihashes[tid]
  1116. bb.event.check_for_interrupts(self.cooker.data)
  1117. if time.time() > (lasttime + 30):
  1118. lasttime = time.time()
  1119. hashequiv_logger.verbose("Initial setup loop progress: %s of %s in %s" % (len(todeal), len(self.runtaskentries), lasttime - starttime))
  1120. endtime = time.time()
  1121. if (endtime-starttime > 60):
  1122. hashequiv_logger.verbose("Initial setup loop took: %s" % (endtime-starttime))
  1123. bb.parse.siggen.writeout_file_checksum_cache()
  1124. #self.dump_data()
  1125. return len(self.runtaskentries)
  1126. def dump_data(self):
  1127. """
  1128. Dump some debug information on the internal data structures
  1129. """
  1130. logger.debug3("run_tasks:")
  1131. for tid in self.runtaskentries:
  1132. logger.debug3(" %s: %s Deps %s RevDeps %s", tid,
  1133. self.runtaskentries[tid].weight,
  1134. self.runtaskentries[tid].depends,
  1135. self.runtaskentries[tid].revdeps)
  1136. class RunQueueWorker():
  1137. def __init__(self, process, pipe):
  1138. self.process = process
  1139. self.pipe = pipe
  1140. class RunQueue:
  1141. def __init__(self, cooker, cfgData, dataCaches, taskData, targets):
  1142. self.cooker = cooker
  1143. self.cfgData = cfgData
  1144. self.rqdata = RunQueueData(self, cooker, cfgData, dataCaches, taskData, targets)
  1145. self.hashvalidate = cfgData.getVar("BB_HASHCHECK_FUNCTION") or None
  1146. self.depvalidate = cfgData.getVar("BB_SETSCENE_DEPVALID") or None
  1147. self.state = runQueuePrepare
  1148. # For disk space monitor
  1149. # Invoked at regular time intervals via the bitbake heartbeat event
  1150. # while the build is running. We generate a unique name for the handler
  1151. # here, just in case that there ever is more than one RunQueue instance,
  1152. # start the handler when reaching runQueueSceneInit, and stop it when
  1153. # done with the build.
  1154. self.dm = monitordisk.diskMonitor(cfgData)
  1155. self.dm_event_handler_name = '_bb_diskmonitor_' + str(id(self))
  1156. self.dm_event_handler_registered = False
  1157. self.rqexe = None
  1158. self.worker = {}
  1159. self.fakeworker = {}
  1160. @staticmethod
  1161. def send_pickled_data(worker, data, name):
  1162. msg = bytearray()
  1163. msg.extend(b"<" + name.encode() + b">")
  1164. pickled_data = pickle.dumps(data)
  1165. msg.extend(len(pickled_data).to_bytes(4, 'big'))
  1166. msg.extend(pickled_data)
  1167. msg.extend(b"</" + name.encode() + b">")
  1168. worker.stdin.write(msg)
  1169. def _start_worker(self, mc, fakeroot = False, rqexec = None):
  1170. logger.debug("Starting bitbake-worker")
  1171. magic = "decafbad"
  1172. if self.cooker.configuration.profile:
  1173. magic = "decafbadbad"
  1174. fakerootlogs = None
  1175. workerscript = os.path.realpath(os.path.dirname(__file__) + "/../../bin/bitbake-worker")
  1176. if fakeroot:
  1177. magic = magic + "beef"
  1178. mcdata = self.cooker.databuilder.mcdata[mc]
  1179. fakerootcmd = shlex.split(mcdata.getVar("FAKEROOTCMD"))
  1180. fakerootenv = (mcdata.getVar("FAKEROOTBASEENV") or "").split()
  1181. env = os.environ.copy()
  1182. for key, value in (var.split('=',1) for var in fakerootenv):
  1183. env[key] = value
  1184. worker = subprocess.Popen(fakerootcmd + [sys.executable, workerscript, magic], stdout=subprocess.PIPE, stdin=subprocess.PIPE, env=env)
  1185. fakerootlogs = self.rqdata.dataCaches[mc].fakerootlogs
  1186. else:
  1187. worker = subprocess.Popen([sys.executable, workerscript, magic], stdout=subprocess.PIPE, stdin=subprocess.PIPE)
  1188. bb.utils.nonblockingfd(worker.stdout)
  1189. workerpipe = runQueuePipe(worker.stdout, None, self.cfgData, self, rqexec, fakerootlogs=fakerootlogs)
  1190. workerdata = {
  1191. "sigdata" : bb.parse.siggen.get_taskdata(),
  1192. "logdefaultlevel" : bb.msg.loggerDefaultLogLevel,
  1193. "build_verbose_shell" : self.cooker.configuration.build_verbose_shell,
  1194. "build_verbose_stdout" : self.cooker.configuration.build_verbose_stdout,
  1195. "logdefaultdomain" : bb.msg.loggerDefaultDomains,
  1196. "prhost" : self.cooker.prhost,
  1197. "buildname" : self.cfgData.getVar("BUILDNAME"),
  1198. "date" : self.cfgData.getVar("DATE"),
  1199. "time" : self.cfgData.getVar("TIME"),
  1200. "hashservaddr" : self.cooker.hashservaddr,
  1201. "umask" : self.cfgData.getVar("BB_DEFAULT_UMASK"),
  1202. }
  1203. RunQueue.send_pickled_data(worker, self.cooker.configuration, "cookerconfig")
  1204. RunQueue.send_pickled_data(worker, self.cooker.extraconfigdata, "extraconfigdata")
  1205. RunQueue.send_pickled_data(worker, workerdata, "workerdata")
  1206. worker.stdin.flush()
  1207. return RunQueueWorker(worker, workerpipe)
  1208. def _teardown_worker(self, worker):
  1209. if not worker:
  1210. return
  1211. logger.debug("Teardown for bitbake-worker")
  1212. try:
  1213. RunQueue.send_pickled_data(worker.process, b"", "quit")
  1214. worker.process.stdin.flush()
  1215. worker.process.stdin.close()
  1216. except IOError:
  1217. pass
  1218. while worker.process.returncode is None:
  1219. worker.pipe.read()
  1220. worker.process.poll()
  1221. while worker.pipe.read():
  1222. continue
  1223. worker.pipe.close()
  1224. def start_worker(self, rqexec):
  1225. if self.worker:
  1226. self.teardown_workers()
  1227. self.teardown = False
  1228. for mc in self.rqdata.dataCaches:
  1229. self.worker[mc] = self._start_worker(mc, False, rqexec)
  1230. def start_fakeworker(self, rqexec, mc):
  1231. if not mc in self.fakeworker:
  1232. self.fakeworker[mc] = self._start_worker(mc, True, rqexec)
  1233. def teardown_workers(self):
  1234. self.teardown = True
  1235. for mc in self.worker:
  1236. self._teardown_worker(self.worker[mc])
  1237. self.worker = {}
  1238. for mc in self.fakeworker:
  1239. self._teardown_worker(self.fakeworker[mc])
  1240. self.fakeworker = {}
  1241. def read_workers(self):
  1242. for mc in self.worker:
  1243. self.worker[mc].pipe.read()
  1244. for mc in self.fakeworker:
  1245. self.fakeworker[mc].pipe.read()
  1246. def active_fds(self):
  1247. fds = []
  1248. for mc in self.worker:
  1249. fds.append(self.worker[mc].pipe.input)
  1250. for mc in self.fakeworker:
  1251. fds.append(self.fakeworker[mc].pipe.input)
  1252. return fds
  1253. def check_stamp_task(self, tid, taskname = None, recurse = False, cache = None):
  1254. def get_timestamp(f):
  1255. try:
  1256. if not os.access(f, os.F_OK):
  1257. return None
  1258. return os.stat(f)[stat.ST_MTIME]
  1259. except:
  1260. return None
  1261. (mc, fn, tn, taskfn) = split_tid_mcfn(tid)
  1262. if taskname is None:
  1263. taskname = tn
  1264. stampfile = bb.parse.siggen.stampfile_mcfn(taskname, taskfn)
  1265. # If the stamp is missing, it's not current
  1266. if not os.access(stampfile, os.F_OK):
  1267. logger.debug2("Stampfile %s not available", stampfile)
  1268. return False
  1269. # If it's a 'nostamp' task, it's not current
  1270. taskdep = self.rqdata.dataCaches[mc].task_deps[taskfn]
  1271. if 'nostamp' in taskdep and taskname in taskdep['nostamp']:
  1272. logger.debug2("%s.%s is nostamp\n", fn, taskname)
  1273. return False
  1274. if taskname.endswith("_setscene"):
  1275. return True
  1276. if cache is None:
  1277. cache = {}
  1278. iscurrent = True
  1279. t1 = get_timestamp(stampfile)
  1280. for dep in self.rqdata.runtaskentries[tid].depends:
  1281. if iscurrent:
  1282. (mc2, fn2, taskname2, taskfn2) = split_tid_mcfn(dep)
  1283. stampfile2 = bb.parse.siggen.stampfile_mcfn(taskname2, taskfn2)
  1284. stampfile3 = bb.parse.siggen.stampfile_mcfn(taskname2 + "_setscene", taskfn2)
  1285. t2 = get_timestamp(stampfile2)
  1286. t3 = get_timestamp(stampfile3)
  1287. if t3 and not t2:
  1288. continue
  1289. if t3 and t3 > t2:
  1290. continue
  1291. if fn == fn2:
  1292. if not t2:
  1293. logger.debug2('Stampfile %s does not exist', stampfile2)
  1294. iscurrent = False
  1295. break
  1296. if t1 < t2:
  1297. logger.debug2('Stampfile %s < %s', stampfile, stampfile2)
  1298. iscurrent = False
  1299. break
  1300. if recurse and iscurrent:
  1301. if dep in cache:
  1302. iscurrent = cache[dep]
  1303. if not iscurrent:
  1304. logger.debug2('Stampfile for dependency %s:%s invalid (cached)' % (fn2, taskname2))
  1305. else:
  1306. iscurrent = self.check_stamp_task(dep, recurse=True, cache=cache)
  1307. cache[dep] = iscurrent
  1308. if recurse:
  1309. cache[tid] = iscurrent
  1310. return iscurrent
  1311. def validate_hashes(self, tocheck, data, currentcount=0, siginfo=False, summary=True):
  1312. valid = set()
  1313. if self.hashvalidate:
  1314. sq_data = {}
  1315. sq_data['hash'] = {}
  1316. sq_data['hashfn'] = {}
  1317. sq_data['unihash'] = {}
  1318. for tid in tocheck:
  1319. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  1320. sq_data['hash'][tid] = self.rqdata.runtaskentries[tid].hash
  1321. sq_data['hashfn'][tid] = self.rqdata.dataCaches[mc].hashfn[taskfn]
  1322. sq_data['unihash'][tid] = self.rqdata.runtaskentries[tid].unihash
  1323. valid = self.validate_hash(sq_data, data, siginfo, currentcount, summary)
  1324. return valid
  1325. def validate_hash(self, sq_data, d, siginfo, currentcount, summary):
  1326. locs = {"sq_data" : sq_data, "d" : d, "siginfo" : siginfo, "currentcount" : currentcount, "summary" : summary}
  1327. # Metadata has **kwargs so args can be added, sq_data can also gain new fields
  1328. call = self.hashvalidate + "(sq_data, d, siginfo=siginfo, currentcount=currentcount, summary=summary)"
  1329. return bb.utils.better_eval(call, locs)
  1330. def _execute_runqueue(self):
  1331. """
  1332. Run the tasks in a queue prepared by rqdata.prepare()
  1333. Upon failure, optionally try to recover the build using any alternate providers
  1334. (if the halt on failure configuration option isn't set)
  1335. """
  1336. retval = True
  1337. bb.event.check_for_interrupts(self.cooker.data)
  1338. if self.state is runQueuePrepare:
  1339. # NOTE: if you add, remove or significantly refactor the stages of this
  1340. # process then you should recalculate the weightings here. This is quite
  1341. # easy to do - just change the next line temporarily to pass debug=True as
  1342. # the last parameter and you'll get a printout of the weightings as well
  1343. # as a map to the lines where next_stage() was called. Of course this isn't
  1344. # critical, but it helps to keep the progress reporting accurate.
  1345. self.rqdata.init_progress_reporter = bb.progress.MultiStageProcessProgressReporter(self.cooker.data,
  1346. "Initialising tasks",
  1347. [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])
  1348. if self.rqdata.prepare() == 0:
  1349. self.state = runQueueComplete
  1350. else:
  1351. self.state = runQueueSceneInit
  1352. bb.parse.siggen.save_unitaskhashes()
  1353. if self.state is runQueueSceneInit:
  1354. self.rqdata.init_progress_reporter.next_stage()
  1355. # we are ready to run, emit dependency info to any UI or class which
  1356. # needs it
  1357. depgraph = self.cooker.buildDependTree(self, self.rqdata.taskData)
  1358. self.rqdata.init_progress_reporter.next_stage()
  1359. bb.event.fire(bb.event.DepTreeGenerated(depgraph), self.cooker.data)
  1360. if not self.dm_event_handler_registered:
  1361. res = bb.event.register(self.dm_event_handler_name,
  1362. lambda x, y: self.dm.check(self) if self.state in [runQueueRunning, runQueueCleanUp] else False,
  1363. ('bb.event.HeartbeatEvent',), data=self.cfgData)
  1364. self.dm_event_handler_registered = True
  1365. self.rqdata.init_progress_reporter.next_stage()
  1366. self.rqexe = RunQueueExecute(self)
  1367. dumpsigs = self.cooker.configuration.dump_signatures
  1368. if dumpsigs:
  1369. self.rqdata.init_progress_reporter.finish()
  1370. if 'printdiff' in dumpsigs:
  1371. self.invalidtasks_dump = self.print_diffscenetasks()
  1372. self.state = runQueueDumpSigs
  1373. if self.state is runQueueDumpSigs:
  1374. dumpsigs = self.cooker.configuration.dump_signatures
  1375. retval = self.dump_signatures(dumpsigs)
  1376. if retval is False:
  1377. if 'printdiff' in dumpsigs:
  1378. self.write_diffscenetasks(self.invalidtasks_dump)
  1379. self.state = runQueueComplete
  1380. if self.state is runQueueSceneInit:
  1381. self.start_worker(self.rqexe)
  1382. self.rqdata.init_progress_reporter.finish()
  1383. # If we don't have any setscene functions, skip execution
  1384. if not self.rqdata.runq_setscene_tids:
  1385. logger.info('No setscene tasks')
  1386. for tid in self.rqdata.runtaskentries:
  1387. if not self.rqdata.runtaskentries[tid].depends:
  1388. self.rqexe.setbuildable(tid)
  1389. self.rqexe.tasks_notcovered.add(tid)
  1390. self.rqexe.sqdone = True
  1391. logger.info('Executing Tasks')
  1392. self.state = runQueueRunning
  1393. if self.state is runQueueRunning:
  1394. retval = self.rqexe.execute()
  1395. if self.state is runQueueCleanUp:
  1396. retval = self.rqexe.finish()
  1397. build_done = self.state is runQueueComplete or self.state is runQueueFailed
  1398. if build_done and self.dm_event_handler_registered:
  1399. bb.event.remove(self.dm_event_handler_name, None, data=self.cfgData)
  1400. self.dm_event_handler_registered = False
  1401. if build_done and self.rqexe:
  1402. bb.parse.siggen.save_unitaskhashes()
  1403. self.teardown_workers()
  1404. if self.rqexe:
  1405. if self.rqexe.stats.failed:
  1406. 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)
  1407. else:
  1408. # Let's avoid the word "failed" if nothing actually did
  1409. 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)
  1410. if self.state is runQueueFailed:
  1411. raise bb.runqueue.TaskFailure(self.rqexe.failed_tids)
  1412. if self.state is runQueueComplete:
  1413. # All done
  1414. return False
  1415. # Loop
  1416. return retval
  1417. def execute_runqueue(self):
  1418. # Catch unexpected exceptions and ensure we exit when an error occurs, not loop.
  1419. try:
  1420. return self._execute_runqueue()
  1421. except bb.runqueue.TaskFailure:
  1422. raise
  1423. except SystemExit:
  1424. raise
  1425. except bb.BBHandledException:
  1426. try:
  1427. self.teardown_workers()
  1428. except:
  1429. pass
  1430. self.state = runQueueComplete
  1431. raise
  1432. except Exception as err:
  1433. logger.exception("An uncaught exception occurred in runqueue")
  1434. try:
  1435. self.teardown_workers()
  1436. except:
  1437. pass
  1438. self.state = runQueueComplete
  1439. raise
  1440. def finish_runqueue(self, now = False):
  1441. if not self.rqexe:
  1442. self.state = runQueueComplete
  1443. return
  1444. if now:
  1445. self.rqexe.finish_now()
  1446. else:
  1447. self.rqexe.finish()
  1448. def _rq_dump_sigtid(self, tids):
  1449. for tid in tids:
  1450. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  1451. dataCaches = self.rqdata.dataCaches
  1452. bb.parse.siggen.dump_sigtask(taskfn, taskname, dataCaches[mc].stamp[taskfn], True)
  1453. def dump_signatures(self, options):
  1454. if not hasattr(self, "dumpsigs_launched"):
  1455. if bb.cooker.CookerFeatures.RECIPE_SIGGEN_INFO not in self.cooker.featureset:
  1456. bb.fatal("The dump signatures functionality needs the RECIPE_SIGGEN_INFO feature enabled")
  1457. bb.note("Writing task signature files")
  1458. max_process = int(self.cfgData.getVar("BB_NUMBER_PARSE_THREADS") or os.cpu_count() or 1)
  1459. def chunkify(l, n):
  1460. return [l[i::n] for i in range(n)]
  1461. dumpsigs_tids = chunkify(list(self.rqdata.runtaskentries), max_process)
  1462. # We cannot use the real multiprocessing.Pool easily due to some local data
  1463. # that can't be pickled. This is a cheap multi-process solution.
  1464. self.dumpsigs_launched = []
  1465. for tids in dumpsigs_tids:
  1466. p = Process(target=self._rq_dump_sigtid, args=(tids, ))
  1467. p.start()
  1468. self.dumpsigs_launched.append(p)
  1469. return 1.0
  1470. for q in self.dumpsigs_launched:
  1471. # The finished processes are joined when calling is_alive()
  1472. if not q.is_alive():
  1473. self.dumpsigs_launched.remove(q)
  1474. if self.dumpsigs_launched:
  1475. return 1.0
  1476. for p in self.dumpsigs_launched:
  1477. p.join()
  1478. bb.parse.siggen.dump_sigs(self.rqdata.dataCaches, options)
  1479. return False
  1480. def print_diffscenetasks(self):
  1481. def get_root_invalid_tasks(task, taskdepends, valid, noexec, visited_invalid):
  1482. invalidtasks = []
  1483. for t in taskdepends[task].depends:
  1484. if t not in valid and t not in visited_invalid:
  1485. invalidtasks.extend(get_root_invalid_tasks(t, taskdepends, valid, noexec, visited_invalid))
  1486. visited_invalid.add(t)
  1487. direct_invalid = [t for t in taskdepends[task].depends if t not in valid]
  1488. if not direct_invalid and task not in noexec:
  1489. invalidtasks = [task]
  1490. return invalidtasks
  1491. noexec = []
  1492. tocheck = set()
  1493. for tid in self.rqdata.runtaskentries:
  1494. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  1495. taskdep = self.rqdata.dataCaches[mc].task_deps[taskfn]
  1496. if 'noexec' in taskdep and taskname in taskdep['noexec']:
  1497. noexec.append(tid)
  1498. continue
  1499. tocheck.add(tid)
  1500. valid_new = self.validate_hashes(tocheck, self.cooker.data, 0, True, summary=False)
  1501. # Tasks which are both setscene and noexec never care about dependencies
  1502. # We therefore find tasks which are setscene and noexec and mark their
  1503. # unique dependencies as valid.
  1504. for tid in noexec:
  1505. if tid not in self.rqdata.runq_setscene_tids:
  1506. continue
  1507. for dep in self.rqdata.runtaskentries[tid].depends:
  1508. hasnoexecparents = True
  1509. for dep2 in self.rqdata.runtaskentries[dep].revdeps:
  1510. if dep2 in self.rqdata.runq_setscene_tids and dep2 in noexec:
  1511. continue
  1512. hasnoexecparents = False
  1513. break
  1514. if hasnoexecparents:
  1515. valid_new.add(dep)
  1516. invalidtasks = set()
  1517. toptasks = set(["{}:{}".format(t[3], t[2]) for t in self.rqdata.targets])
  1518. for tid in toptasks:
  1519. toprocess = set([tid])
  1520. while toprocess:
  1521. next = set()
  1522. visited_invalid = set()
  1523. for t in toprocess:
  1524. if t not in valid_new and t not in noexec:
  1525. invalidtasks.update(get_root_invalid_tasks(t, self.rqdata.runtaskentries, valid_new, noexec, visited_invalid))
  1526. continue
  1527. if t in self.rqdata.runq_setscene_tids:
  1528. for dep in self.rqexe.sqdata.sq_deps[t]:
  1529. next.add(dep)
  1530. continue
  1531. for dep in self.rqdata.runtaskentries[t].depends:
  1532. next.add(dep)
  1533. toprocess = next
  1534. tasklist = []
  1535. for tid in invalidtasks:
  1536. tasklist.append(tid)
  1537. if tasklist:
  1538. bb.plain("The differences between the current build and any cached tasks start at the following tasks:\n" + "\n".join(tasklist))
  1539. return invalidtasks
  1540. def write_diffscenetasks(self, invalidtasks):
  1541. bb.siggen.check_siggen_version(bb.siggen)
  1542. # Define recursion callback
  1543. def recursecb(key, hash1, hash2):
  1544. hashes = [hash1, hash2]
  1545. bb.debug(1, "Recursively looking for recipe {} hashes {}".format(key, hashes))
  1546. hashfiles = bb.siggen.find_siginfo(key, None, hashes, self.cfgData)
  1547. bb.debug(1, "Found hashfiles:\n{}".format(hashfiles))
  1548. recout = []
  1549. if len(hashfiles) == 2:
  1550. out2 = bb.siggen.compare_sigfiles(hashfiles[hash1]['path'], hashfiles[hash2]['path'], recursecb)
  1551. recout.extend(list(' ' + l for l in out2))
  1552. else:
  1553. recout.append("Unable to find matching sigdata for %s with hashes %s or %s" % (key, hash1, hash2))
  1554. return recout
  1555. for tid in invalidtasks:
  1556. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  1557. pn = self.rqdata.dataCaches[mc].pkg_fn[taskfn]
  1558. h = self.rqdata.runtaskentries[tid].unihash
  1559. bb.debug(1, "Looking for recipe {} task {}".format(pn, taskname))
  1560. matches = bb.siggen.find_siginfo(pn, taskname, [], self.cooker.databuilder.mcdata[mc])
  1561. bb.debug(1, "Found hashfiles:\n{}".format(matches))
  1562. match = None
  1563. for m in matches.values():
  1564. if h in m['path']:
  1565. match = m['path']
  1566. if match is None:
  1567. bb.fatal("Can't find a task we're supposed to have written out? (hash: %s tid: %s)?" % (h, tid))
  1568. matches = {k : v for k, v in iter(matches.items()) if h not in k}
  1569. matches_local = {k : v for k, v in iter(matches.items()) if h not in k and not v['sstate']}
  1570. if matches_local:
  1571. matches = matches_local
  1572. if matches:
  1573. latestmatch = matches[sorted(matches.keys(), key=lambda h: matches[h]['time'])[-1]]['path']
  1574. prevh = __find_sha256__.search(latestmatch).group(0)
  1575. output = bb.siggen.compare_sigfiles(latestmatch, match, recursecb)
  1576. 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))
  1577. class RunQueueExecute:
  1578. def __init__(self, rq):
  1579. self.rq = rq
  1580. self.cooker = rq.cooker
  1581. self.cfgData = rq.cfgData
  1582. self.rqdata = rq.rqdata
  1583. self.number_tasks = int(self.cfgData.getVar("BB_NUMBER_THREADS") or 1)
  1584. self.scheduler = self.cfgData.getVar("BB_SCHEDULER") or "speed"
  1585. self.max_cpu_pressure = self.cfgData.getVar("BB_PRESSURE_MAX_CPU")
  1586. self.max_io_pressure = self.cfgData.getVar("BB_PRESSURE_MAX_IO")
  1587. self.max_memory_pressure = self.cfgData.getVar("BB_PRESSURE_MAX_MEMORY")
  1588. self.max_loadfactor = self.cfgData.getVar("BB_LOADFACTOR_MAX")
  1589. self.sq_buildable = set()
  1590. self.sq_running = set()
  1591. self.sq_live = set()
  1592. self.updated_taskhash_queue = []
  1593. self.pending_migrations = set()
  1594. self.runq_buildable = set()
  1595. self.runq_running = set()
  1596. self.runq_complete = set()
  1597. self.runq_tasksrun = set()
  1598. self.build_stamps = {}
  1599. self.build_stamps2 = []
  1600. self.failed_tids = []
  1601. self.sq_deferred = {}
  1602. self.sq_needed_harddeps = set()
  1603. self.sq_harddep_deferred = set()
  1604. self.stampcache = {}
  1605. self.holdoff_tasks = set()
  1606. self.holdoff_need_update = True
  1607. self.sqdone = False
  1608. self.stats = RunQueueStats(len(self.rqdata.runtaskentries), len(self.rqdata.runq_setscene_tids))
  1609. if self.number_tasks <= 0:
  1610. bb.fatal("Invalid BB_NUMBER_THREADS %s" % self.number_tasks)
  1611. lower_limit = 1.0
  1612. upper_limit = 1000000.0
  1613. if self.max_cpu_pressure:
  1614. self.max_cpu_pressure = float(self.max_cpu_pressure)
  1615. if self.max_cpu_pressure < lower_limit:
  1616. bb.fatal("Invalid BB_PRESSURE_MAX_CPU %s, minimum value is %s." % (self.max_cpu_pressure, lower_limit))
  1617. if self.max_cpu_pressure > upper_limit:
  1618. 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))
  1619. if self.max_io_pressure:
  1620. self.max_io_pressure = float(self.max_io_pressure)
  1621. if self.max_io_pressure < lower_limit:
  1622. bb.fatal("Invalid BB_PRESSURE_MAX_IO %s, minimum value is %s." % (self.max_io_pressure, lower_limit))
  1623. if self.max_io_pressure > upper_limit:
  1624. 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))
  1625. if self.max_memory_pressure:
  1626. self.max_memory_pressure = float(self.max_memory_pressure)
  1627. if self.max_memory_pressure < lower_limit:
  1628. bb.fatal("Invalid BB_PRESSURE_MAX_MEMORY %s, minimum value is %s." % (self.max_memory_pressure, lower_limit))
  1629. if self.max_memory_pressure > upper_limit:
  1630. 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))
  1631. if self.max_loadfactor:
  1632. self.max_loadfactor = float(self.max_loadfactor)
  1633. if self.max_loadfactor <= 0:
  1634. bb.fatal("Invalid BB_LOADFACTOR_MAX %s, needs to be greater than zero." % (self.max_loadfactor))
  1635. # List of setscene tasks which we've covered
  1636. self.scenequeue_covered = set()
  1637. # List of tasks which are covered (including setscene ones)
  1638. self.tasks_covered = set()
  1639. self.tasks_scenequeue_done = set()
  1640. self.scenequeue_notcovered = set()
  1641. self.tasks_notcovered = set()
  1642. self.scenequeue_notneeded = set()
  1643. schedulers = self.get_schedulers()
  1644. for scheduler in schedulers:
  1645. if self.scheduler == scheduler.name:
  1646. self.sched = scheduler(self, self.rqdata)
  1647. logger.debug("Using runqueue scheduler '%s'", scheduler.name)
  1648. break
  1649. else:
  1650. bb.fatal("Invalid scheduler '%s'. Available schedulers: %s" %
  1651. (self.scheduler, ", ".join(obj.name for obj in schedulers)))
  1652. #if self.rqdata.runq_setscene_tids:
  1653. self.sqdata = SQData()
  1654. build_scenequeue_data(self.sqdata, self.rqdata, self)
  1655. update_scenequeue_data(self.sqdata.sq_revdeps, self.sqdata, self.rqdata, self.rq, self.cooker, self.stampcache, self, summary=True)
  1656. # Compute a list of 'stale' sstate tasks where the current hash does not match the one
  1657. # in any stamp files. Pass the list out to metadata as an event.
  1658. found = {}
  1659. for tid in self.rqdata.runq_setscene_tids:
  1660. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  1661. stamps = bb.build.find_stale_stamps(taskname, taskfn)
  1662. if stamps:
  1663. if mc not in found:
  1664. found[mc] = {}
  1665. found[mc][tid] = stamps
  1666. for mc in found:
  1667. event = bb.event.StaleSetSceneTasks(found[mc])
  1668. bb.event.fire(event, self.cooker.databuilder.mcdata[mc])
  1669. self.build_taskdepdata_cache()
  1670. def runqueue_process_waitpid(self, task, status, fakerootlog=None):
  1671. # self.build_stamps[pid] may not exist when use shared work directory.
  1672. if task in self.build_stamps:
  1673. self.build_stamps2.remove(self.build_stamps[task])
  1674. del self.build_stamps[task]
  1675. if task in self.sq_live:
  1676. if status != 0:
  1677. self.sq_task_fail(task, status)
  1678. else:
  1679. self.sq_task_complete(task)
  1680. self.sq_live.remove(task)
  1681. self.stats.updateActiveSetscene(len(self.sq_live))
  1682. else:
  1683. if status != 0:
  1684. self.task_fail(task, status, fakerootlog=fakerootlog)
  1685. else:
  1686. self.task_complete(task)
  1687. return True
  1688. def finish_now(self):
  1689. for mc in self.rq.worker:
  1690. try:
  1691. RunQueue.send_pickled_data(self.rq.worker[mc].process, b"", "finishnow")
  1692. self.rq.worker[mc].process.stdin.flush()
  1693. except IOError:
  1694. # worker must have died?
  1695. pass
  1696. for mc in self.rq.fakeworker:
  1697. try:
  1698. RunQueue.send_pickled_data(self.rq.fakeworker[mc].process, b"", "finishnow")
  1699. self.rq.fakeworker[mc].process.stdin.flush()
  1700. except IOError:
  1701. # worker must have died?
  1702. pass
  1703. if self.failed_tids:
  1704. self.rq.state = runQueueFailed
  1705. return
  1706. self.rq.state = runQueueComplete
  1707. return
  1708. def finish(self):
  1709. self.rq.state = runQueueCleanUp
  1710. active = self.stats.active + len(self.sq_live)
  1711. if active > 0:
  1712. bb.event.fire(runQueueExitWait(active), self.cfgData)
  1713. self.rq.read_workers()
  1714. return self.rq.active_fds()
  1715. if self.failed_tids:
  1716. self.rq.state = runQueueFailed
  1717. return True
  1718. self.rq.state = runQueueComplete
  1719. return True
  1720. # Used by setscene only
  1721. def check_dependencies(self, task, taskdeps):
  1722. if not self.rq.depvalidate:
  1723. return False
  1724. # Must not edit parent data
  1725. taskdeps = set(taskdeps)
  1726. taskdata = {}
  1727. taskdeps.add(task)
  1728. for dep in taskdeps:
  1729. (mc, fn, taskname, taskfn) = split_tid_mcfn(dep)
  1730. pn = self.rqdata.dataCaches[mc].pkg_fn[taskfn]
  1731. taskdata[dep] = [pn, taskname, fn]
  1732. call = self.rq.depvalidate + "(task, taskdata, notneeded, d)"
  1733. locs = { "task" : task, "taskdata" : taskdata, "notneeded" : self.scenequeue_notneeded, "d" : self.cooker.data }
  1734. valid = bb.utils.better_eval(call, locs)
  1735. return valid
  1736. def can_start_task(self):
  1737. active = self.stats.active + len(self.sq_live)
  1738. can_start = active < self.number_tasks
  1739. return can_start
  1740. def get_schedulers(self):
  1741. schedulers = set(obj for obj in globals().values()
  1742. if type(obj) is type and
  1743. issubclass(obj, RunQueueScheduler))
  1744. user_schedulers = self.cfgData.getVar("BB_SCHEDULERS")
  1745. if user_schedulers:
  1746. for sched in user_schedulers.split():
  1747. if not "." in sched:
  1748. bb.note("Ignoring scheduler '%s' from BB_SCHEDULERS: not an import" % sched)
  1749. continue
  1750. modname, name = sched.rsplit(".", 1)
  1751. try:
  1752. module = __import__(modname, fromlist=(name,))
  1753. except ImportError as exc:
  1754. bb.fatal("Unable to import scheduler '%s' from '%s': %s" % (name, modname, exc))
  1755. else:
  1756. schedulers.add(getattr(module, name))
  1757. return schedulers
  1758. def setbuildable(self, task):
  1759. self.runq_buildable.add(task)
  1760. self.sched.newbuildable(task)
  1761. def task_completeoutright(self, task):
  1762. """
  1763. Mark a task as completed
  1764. Look at the reverse dependencies and mark any task with
  1765. completed dependencies as buildable
  1766. """
  1767. self.runq_complete.add(task)
  1768. for revdep in self.rqdata.runtaskentries[task].revdeps:
  1769. if revdep in self.runq_running:
  1770. continue
  1771. if revdep in self.runq_buildable:
  1772. continue
  1773. alldeps = True
  1774. for dep in self.rqdata.runtaskentries[revdep].depends:
  1775. if dep not in self.runq_complete:
  1776. alldeps = False
  1777. break
  1778. if alldeps:
  1779. self.setbuildable(revdep)
  1780. logger.debug("Marking task %s as buildable", revdep)
  1781. found = None
  1782. for t in sorted(self.sq_deferred.copy()):
  1783. if self.sq_deferred[t] == task:
  1784. # Allow the next deferred task to run. Any other deferred tasks should be deferred after that task.
  1785. # We shouldn't allow all to run at once as it is prone to races.
  1786. if not found:
  1787. bb.debug(1, "Deferred task %s now buildable" % t)
  1788. del self.sq_deferred[t]
  1789. update_scenequeue_data([t], self.sqdata, self.rqdata, self.rq, self.cooker, self.stampcache, self, summary=False)
  1790. found = t
  1791. else:
  1792. bb.debug(1, "Deferring %s after %s" % (t, found))
  1793. self.sq_deferred[t] = found
  1794. def task_complete(self, task):
  1795. self.stats.taskCompleted()
  1796. bb.event.fire(runQueueTaskCompleted(task, self.stats, self.rq), self.cfgData)
  1797. self.task_completeoutright(task)
  1798. self.runq_tasksrun.add(task)
  1799. def task_fail(self, task, exitcode, fakerootlog=None):
  1800. """
  1801. Called when a task has failed
  1802. Updates the state engine with the failure
  1803. """
  1804. self.stats.taskFailed()
  1805. self.failed_tids.append(task)
  1806. fakeroot_log = []
  1807. if fakerootlog and os.path.exists(fakerootlog):
  1808. with open(fakerootlog) as fakeroot_log_file:
  1809. fakeroot_failed = False
  1810. for line in reversed(fakeroot_log_file.readlines()):
  1811. for fakeroot_error in ['mismatch', 'error', 'fatal']:
  1812. if fakeroot_error in line.lower():
  1813. fakeroot_failed = True
  1814. if 'doing new pid setup and server start' in line:
  1815. break
  1816. fakeroot_log.append(line)
  1817. if not fakeroot_failed:
  1818. fakeroot_log = []
  1819. bb.event.fire(runQueueTaskFailed(task, self.stats, exitcode, self.rq, fakeroot_log=("".join(fakeroot_log) or None)), self.cfgData)
  1820. if self.rqdata.taskData[''].halt:
  1821. self.rq.state = runQueueCleanUp
  1822. def task_skip(self, task, reason):
  1823. self.runq_running.add(task)
  1824. self.setbuildable(task)
  1825. bb.event.fire(runQueueTaskSkipped(task, self.stats, self.rq, reason), self.cfgData)
  1826. self.task_completeoutright(task)
  1827. self.stats.taskSkipped()
  1828. self.stats.taskCompleted()
  1829. def summarise_scenequeue_errors(self):
  1830. err = False
  1831. if not self.sqdone:
  1832. logger.debug('We could skip tasks %s', "\n".join(sorted(self.scenequeue_covered)))
  1833. completeevent = sceneQueueComplete(self.stats, self.rq)
  1834. bb.event.fire(completeevent, self.cfgData)
  1835. if self.sq_deferred:
  1836. logger.error("Scenequeue had deferred entries: %s" % pprint.pformat(self.sq_deferred))
  1837. err = True
  1838. if self.updated_taskhash_queue:
  1839. logger.error("Scenequeue had unprocessed changed taskhash entries: %s" % pprint.pformat(self.updated_taskhash_queue))
  1840. err = True
  1841. if self.holdoff_tasks:
  1842. logger.error("Scenequeue had holdoff tasks: %s" % pprint.pformat(self.holdoff_tasks))
  1843. err = True
  1844. for tid in self.scenequeue_covered.intersection(self.scenequeue_notcovered):
  1845. # No task should end up in both covered and uncovered, that is a bug.
  1846. logger.error("Setscene task %s in both covered and notcovered." % tid)
  1847. for tid in self.rqdata.runq_setscene_tids:
  1848. if tid not in self.scenequeue_covered and tid not in self.scenequeue_notcovered:
  1849. err = True
  1850. logger.error("Setscene Task %s was never marked as covered or not covered" % tid)
  1851. if tid not in self.sq_buildable:
  1852. err = True
  1853. logger.error("Setscene Task %s was never marked as buildable" % tid)
  1854. if tid not in self.sq_running:
  1855. err = True
  1856. logger.error("Setscene Task %s was never marked as running" % tid)
  1857. for x in self.rqdata.runtaskentries:
  1858. if x not in self.tasks_covered and x not in self.tasks_notcovered:
  1859. logger.error("Task %s was never moved from the setscene queue" % x)
  1860. err = True
  1861. if x not in self.tasks_scenequeue_done:
  1862. logger.error("Task %s was never processed by the setscene code" % x)
  1863. err = True
  1864. if not self.rqdata.runtaskentries[x].depends and x not in self.runq_buildable:
  1865. logger.error("Task %s was never marked as buildable by the setscene code" % x)
  1866. err = True
  1867. return err
  1868. def execute(self):
  1869. """
  1870. Run the tasks in a queue prepared by prepare_runqueue
  1871. """
  1872. self.rq.read_workers()
  1873. if self.updated_taskhash_queue or self.pending_migrations:
  1874. self.process_possible_migrations()
  1875. if not hasattr(self, "sorted_setscene_tids"):
  1876. # Don't want to sort this set every execution
  1877. self.sorted_setscene_tids = sorted(self.rqdata.runq_setscene_tids)
  1878. # Resume looping where we left off when we returned to feed the mainloop
  1879. self.setscene_tids_generator = itertools.cycle(self.rqdata.runq_setscene_tids)
  1880. task = None
  1881. if not self.sqdone and self.can_start_task():
  1882. loopcount = 0
  1883. # Find the next setscene to run, exit the loop when we've processed all tids or found something to execute
  1884. while loopcount < len(self.rqdata.runq_setscene_tids):
  1885. loopcount += 1
  1886. nexttask = next(self.setscene_tids_generator)
  1887. 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:
  1888. if nexttask in self.sq_deferred and self.sq_deferred[nexttask] not in self.runq_complete:
  1889. # Skip deferred tasks quickly before the 'expensive' tests below - this is key to performant multiconfig builds
  1890. continue
  1891. if nexttask not in self.sqdata.unskippable and self.sqdata.sq_revdeps[nexttask] and \
  1892. nexttask not in self.sq_needed_harddeps and \
  1893. self.sqdata.sq_revdeps[nexttask].issubset(self.scenequeue_covered) and \
  1894. self.check_dependencies(nexttask, self.sqdata.sq_revdeps[nexttask]):
  1895. if nexttask not in self.rqdata.target_tids:
  1896. logger.debug2("Skipping setscene for task %s" % nexttask)
  1897. self.sq_task_skip(nexttask)
  1898. self.scenequeue_notneeded.add(nexttask)
  1899. if nexttask in self.sq_deferred:
  1900. del self.sq_deferred[nexttask]
  1901. return True
  1902. if nexttask in self.sqdata.sq_harddeps_rev and not self.sqdata.sq_harddeps_rev[nexttask].issubset(self.scenequeue_covered | self.scenequeue_notcovered):
  1903. logger.debug2("Deferring %s due to hard dependencies" % nexttask)
  1904. updated = False
  1905. for dep in self.sqdata.sq_harddeps_rev[nexttask]:
  1906. if dep not in self.sq_needed_harddeps:
  1907. logger.debug2("Enabling task %s as it is a hard dependency" % dep)
  1908. self.sq_buildable.add(dep)
  1909. self.sq_needed_harddeps.add(dep)
  1910. updated = True
  1911. self.sq_harddep_deferred.add(nexttask)
  1912. if updated:
  1913. return True
  1914. continue
  1915. # If covered tasks are running, need to wait for them to complete
  1916. for t in self.sqdata.sq_covered_tasks[nexttask]:
  1917. if t in self.runq_running and t not in self.runq_complete:
  1918. continue
  1919. if nexttask in self.sq_deferred:
  1920. # Deferred tasks that were still deferred were skipped above so we now need to process
  1921. logger.debug("Task %s no longer deferred" % nexttask)
  1922. del self.sq_deferred[nexttask]
  1923. valid = self.rq.validate_hashes(set([nexttask]), self.cooker.data, 0, False, summary=False)
  1924. if not valid:
  1925. logger.debug("%s didn't become valid, skipping setscene" % nexttask)
  1926. self.sq_task_failoutright(nexttask)
  1927. return True
  1928. if nexttask in self.sqdata.outrightfail:
  1929. logger.debug2('No package found, so skipping setscene task %s', nexttask)
  1930. self.sq_task_failoutright(nexttask)
  1931. return True
  1932. if nexttask in self.sqdata.unskippable:
  1933. logger.debug2("Setscene task %s is unskippable" % nexttask)
  1934. task = nexttask
  1935. break
  1936. if task is not None:
  1937. (mc, fn, taskname, taskfn) = split_tid_mcfn(task)
  1938. taskname = taskname + "_setscene"
  1939. if self.rq.check_stamp_task(task, taskname_from_tid(task), recurse = True, cache=self.stampcache):
  1940. logger.debug2('Stamp for underlying task %s is current, so skipping setscene variant', task)
  1941. self.sq_task_failoutright(task)
  1942. return True
  1943. if self.cooker.configuration.force:
  1944. if task in self.rqdata.target_tids:
  1945. self.sq_task_failoutright(task)
  1946. return True
  1947. if self.rq.check_stamp_task(task, taskname, cache=self.stampcache):
  1948. logger.debug2('Setscene stamp current task %s, so skip it and its dependencies', task)
  1949. self.sq_task_skip(task)
  1950. return True
  1951. if self.cooker.configuration.skipsetscene:
  1952. logger.debug2('No setscene tasks should be executed. Skipping %s', task)
  1953. self.sq_task_failoutright(task)
  1954. return True
  1955. startevent = sceneQueueTaskStarted(task, self.stats, self.rq)
  1956. bb.event.fire(startevent, self.cfgData)
  1957. taskdep = self.rqdata.dataCaches[mc].task_deps[taskfn]
  1958. realfn = bb.cache.virtualfn2realfn(taskfn)[0]
  1959. runtask = {
  1960. 'fn' : taskfn,
  1961. 'task' : task,
  1962. 'taskname' : taskname,
  1963. 'taskhash' : self.rqdata.get_task_hash(task),
  1964. 'unihash' : self.rqdata.get_task_unihash(task),
  1965. 'quieterrors' : True,
  1966. 'appends' : self.cooker.collections[mc].get_file_appends(taskfn),
  1967. 'layername' : self.cooker.collections[mc].calc_bbfile_priority(realfn)[2],
  1968. 'taskdepdata' : self.sq_build_taskdepdata(task),
  1969. 'dry_run' : False,
  1970. 'taskdep': taskdep,
  1971. 'fakerootenv' : self.rqdata.dataCaches[mc].fakerootenv[taskfn],
  1972. 'fakerootdirs' : self.rqdata.dataCaches[mc].fakerootdirs[taskfn],
  1973. 'fakerootnoenv' : self.rqdata.dataCaches[mc].fakerootnoenv[taskfn]
  1974. }
  1975. if 'fakeroot' in taskdep and taskname in taskdep['fakeroot'] and not self.cooker.configuration.dry_run:
  1976. if not mc in self.rq.fakeworker:
  1977. self.rq.start_fakeworker(self, mc)
  1978. RunQueue.send_pickled_data(self.rq.fakeworker[mc].process, runtask, "runtask")
  1979. self.rq.fakeworker[mc].process.stdin.flush()
  1980. else:
  1981. RunQueue.send_pickled_data(self.rq.worker[mc].process, runtask, "runtask")
  1982. self.rq.worker[mc].process.stdin.flush()
  1983. self.build_stamps[task] = bb.parse.siggen.stampfile_mcfn(taskname, taskfn, extrainfo=False)
  1984. self.build_stamps2.append(self.build_stamps[task])
  1985. self.sq_running.add(task)
  1986. self.sq_live.add(task)
  1987. self.stats.updateActiveSetscene(len(self.sq_live))
  1988. if self.can_start_task():
  1989. return True
  1990. self.update_holdofftasks()
  1991. 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:
  1992. hashequiv_logger.verbose("Setscene tasks completed")
  1993. err = self.summarise_scenequeue_errors()
  1994. if err:
  1995. self.rq.state = runQueueFailed
  1996. return True
  1997. if self.cooker.configuration.setsceneonly:
  1998. self.rq.state = runQueueComplete
  1999. return True
  2000. self.sqdone = True
  2001. if self.stats.total == 0:
  2002. # nothing to do
  2003. self.rq.state = runQueueComplete
  2004. return True
  2005. if self.cooker.configuration.setsceneonly:
  2006. task = None
  2007. else:
  2008. task = self.sched.next()
  2009. if task is not None:
  2010. (mc, fn, taskname, taskfn) = split_tid_mcfn(task)
  2011. if self.rqdata.setscene_ignore_tasks is not None:
  2012. if self.check_setscene_ignore_tasks(task):
  2013. self.task_fail(task, "setscene ignore_tasks")
  2014. return True
  2015. if task in self.tasks_covered:
  2016. logger.debug2("Setscene covered task %s", task)
  2017. self.task_skip(task, "covered")
  2018. return True
  2019. if self.rq.check_stamp_task(task, taskname, cache=self.stampcache):
  2020. logger.debug2("Stamp current task %s", task)
  2021. self.task_skip(task, "existing")
  2022. self.runq_tasksrun.add(task)
  2023. return True
  2024. taskdep = self.rqdata.dataCaches[mc].task_deps[taskfn]
  2025. if 'noexec' in taskdep and taskname in taskdep['noexec']:
  2026. startevent = runQueueTaskStarted(task, self.stats, self.rq,
  2027. noexec=True)
  2028. bb.event.fire(startevent, self.cfgData)
  2029. self.runq_running.add(task)
  2030. self.stats.taskActive()
  2031. if not (self.cooker.configuration.dry_run or self.rqdata.setscene_enforce):
  2032. bb.build.make_stamp_mcfn(taskname, taskfn)
  2033. self.task_complete(task)
  2034. return True
  2035. else:
  2036. startevent = runQueueTaskStarted(task, self.stats, self.rq)
  2037. bb.event.fire(startevent, self.cfgData)
  2038. taskdep = self.rqdata.dataCaches[mc].task_deps[taskfn]
  2039. realfn = bb.cache.virtualfn2realfn(taskfn)[0]
  2040. runtask = {
  2041. 'fn' : taskfn,
  2042. 'task' : task,
  2043. 'taskname' : taskname,
  2044. 'taskhash' : self.rqdata.get_task_hash(task),
  2045. 'unihash' : self.rqdata.get_task_unihash(task),
  2046. 'quieterrors' : False,
  2047. 'appends' : self.cooker.collections[mc].get_file_appends(taskfn),
  2048. 'layername' : self.cooker.collections[mc].calc_bbfile_priority(realfn)[2],
  2049. 'taskdepdata' : self.build_taskdepdata(task),
  2050. 'dry_run' : self.rqdata.setscene_enforce,
  2051. 'taskdep': taskdep,
  2052. 'fakerootenv' : self.rqdata.dataCaches[mc].fakerootenv[taskfn],
  2053. 'fakerootdirs' : self.rqdata.dataCaches[mc].fakerootdirs[taskfn],
  2054. 'fakerootnoenv' : self.rqdata.dataCaches[mc].fakerootnoenv[taskfn]
  2055. }
  2056. if 'fakeroot' in taskdep and taskname in taskdep['fakeroot'] and not (self.cooker.configuration.dry_run or self.rqdata.setscene_enforce):
  2057. if not mc in self.rq.fakeworker:
  2058. try:
  2059. self.rq.start_fakeworker(self, mc)
  2060. except OSError as exc:
  2061. logger.critical("Failed to spawn fakeroot worker to run %s: %s" % (task, str(exc)))
  2062. self.rq.state = runQueueFailed
  2063. self.stats.taskFailed()
  2064. return True
  2065. RunQueue.send_pickled_data(self.rq.fakeworker[mc].process, runtask, "runtask")
  2066. self.rq.fakeworker[mc].process.stdin.flush()
  2067. else:
  2068. RunQueue.send_pickled_data(self.rq.worker[mc].process, runtask, "runtask")
  2069. self.rq.worker[mc].process.stdin.flush()
  2070. self.build_stamps[task] = bb.parse.siggen.stampfile_mcfn(taskname, taskfn, extrainfo=False)
  2071. self.build_stamps2.append(self.build_stamps[task])
  2072. self.runq_running.add(task)
  2073. self.stats.taskActive()
  2074. if self.can_start_task():
  2075. return True
  2076. if self.stats.active > 0 or self.sq_live:
  2077. self.rq.read_workers()
  2078. return self.rq.active_fds()
  2079. # No more tasks can be run. If we have deferred setscene tasks we should run them.
  2080. if self.sq_deferred:
  2081. deferred_tid = list(self.sq_deferred.keys())[0]
  2082. blocking_tid = self.sq_deferred.pop(deferred_tid)
  2083. logger.warning("Runqueue deadlocked on deferred tasks, forcing task %s blocked by %s" % (deferred_tid, blocking_tid))
  2084. return True
  2085. if self.failed_tids:
  2086. self.rq.state = runQueueFailed
  2087. return True
  2088. # Sanity Checks
  2089. err = self.summarise_scenequeue_errors()
  2090. for task in self.rqdata.runtaskentries:
  2091. if task not in self.runq_buildable:
  2092. logger.error("Task %s never buildable!", task)
  2093. err = True
  2094. elif task not in self.runq_running:
  2095. logger.error("Task %s never ran!", task)
  2096. err = True
  2097. elif task not in self.runq_complete:
  2098. logger.error("Task %s never completed!", task)
  2099. err = True
  2100. if err:
  2101. self.rq.state = runQueueFailed
  2102. else:
  2103. self.rq.state = runQueueComplete
  2104. return True
  2105. def filtermcdeps(self, task, mc, deps):
  2106. ret = set()
  2107. for dep in deps:
  2108. thismc = mc_from_tid(dep)
  2109. if thismc != mc:
  2110. continue
  2111. ret.add(dep)
  2112. return ret
  2113. # Build the individual cache entries in advance once to save time
  2114. def build_taskdepdata_cache(self):
  2115. taskdepdata_cache = {}
  2116. for task in self.rqdata.runtaskentries:
  2117. (mc, fn, taskname, taskfn) = split_tid_mcfn(task)
  2118. taskdepdata_cache[task] = bb.TaskData(
  2119. pn = self.rqdata.dataCaches[mc].pkg_fn[taskfn],
  2120. taskname = taskname,
  2121. fn = fn,
  2122. deps = self.filtermcdeps(task, mc, self.rqdata.runtaskentries[task].depends),
  2123. provides = self.rqdata.dataCaches[mc].fn_provides[taskfn],
  2124. taskhash = self.rqdata.runtaskentries[task].hash,
  2125. unihash = self.rqdata.runtaskentries[task].unihash,
  2126. hashfn = self.rqdata.dataCaches[mc].hashfn[taskfn],
  2127. taskhash_deps = self.rqdata.runtaskentries[task].taskhash_deps,
  2128. )
  2129. self.taskdepdata_cache = taskdepdata_cache
  2130. # We filter out multiconfig dependencies from taskdepdata we pass to the tasks
  2131. # as most code can't handle them
  2132. def build_taskdepdata(self, task):
  2133. taskdepdata = {}
  2134. mc = mc_from_tid(task)
  2135. next = self.rqdata.runtaskentries[task].depends.copy()
  2136. next.add(task)
  2137. next = self.filtermcdeps(task, mc, next)
  2138. while next:
  2139. additional = []
  2140. for revdep in next:
  2141. self.taskdepdata_cache[revdep] = self.taskdepdata_cache[revdep]._replace(
  2142. unihash=self.rqdata.runtaskentries[revdep].unihash
  2143. )
  2144. taskdepdata[revdep] = self.taskdepdata_cache[revdep]
  2145. for revdep2 in self.taskdepdata_cache[revdep].deps:
  2146. if revdep2 not in taskdepdata:
  2147. additional.append(revdep2)
  2148. next = additional
  2149. #bb.note("Task %s: " % task + str(taskdepdata).replace("], ", "],\n"))
  2150. return taskdepdata
  2151. def update_holdofftasks(self):
  2152. if not self.holdoff_need_update:
  2153. return
  2154. notcovered = set(self.scenequeue_notcovered)
  2155. notcovered |= self.sqdata.cantskip
  2156. for tid in self.scenequeue_notcovered:
  2157. notcovered |= self.sqdata.sq_covered_tasks[tid]
  2158. notcovered |= self.sqdata.unskippable.difference(self.rqdata.runq_setscene_tids)
  2159. notcovered.intersection_update(self.tasks_scenequeue_done)
  2160. covered = set(self.scenequeue_covered)
  2161. for tid in self.scenequeue_covered:
  2162. covered |= self.sqdata.sq_covered_tasks[tid]
  2163. covered.difference_update(notcovered)
  2164. covered.intersection_update(self.tasks_scenequeue_done)
  2165. for tid in notcovered | covered:
  2166. if not self.rqdata.runtaskentries[tid].depends:
  2167. self.setbuildable(tid)
  2168. elif self.rqdata.runtaskentries[tid].depends.issubset(self.runq_complete):
  2169. self.setbuildable(tid)
  2170. self.tasks_covered = covered
  2171. self.tasks_notcovered = notcovered
  2172. self.holdoff_tasks = set()
  2173. for tid in self.rqdata.runq_setscene_tids:
  2174. if tid not in self.scenequeue_covered and tid not in self.scenequeue_notcovered:
  2175. self.holdoff_tasks.add(tid)
  2176. for tid in self.holdoff_tasks.copy():
  2177. for dep in self.sqdata.sq_covered_tasks[tid]:
  2178. if dep not in self.runq_complete:
  2179. self.holdoff_tasks.add(dep)
  2180. self.holdoff_need_update = False
  2181. def process_possible_migrations(self):
  2182. changed = set()
  2183. toprocess = set()
  2184. for tid, unihash in self.updated_taskhash_queue.copy():
  2185. if tid in self.runq_running and tid not in self.runq_complete:
  2186. continue
  2187. self.updated_taskhash_queue.remove((tid, unihash))
  2188. if unihash != self.rqdata.runtaskentries[tid].unihash:
  2189. # Make sure we rehash any other tasks with the same task hash that we're deferred against.
  2190. torehash = [tid]
  2191. for deftid in self.sq_deferred:
  2192. if self.sq_deferred[deftid] == tid:
  2193. torehash.append(deftid)
  2194. for hashtid in torehash:
  2195. hashequiv_logger.verbose("Task %s unihash changed to %s" % (hashtid, unihash))
  2196. self.rqdata.runtaskentries[hashtid].unihash = unihash
  2197. bb.parse.siggen.set_unihash(hashtid, unihash)
  2198. toprocess.add(hashtid)
  2199. # Work out all tasks which depend upon these
  2200. total = set()
  2201. next = set()
  2202. for p in toprocess:
  2203. next |= self.rqdata.runtaskentries[p].revdeps
  2204. while next:
  2205. current = next.copy()
  2206. total = total | next
  2207. next = set()
  2208. for ntid in current:
  2209. next |= self.rqdata.runtaskentries[ntid].revdeps
  2210. next.difference_update(total)
  2211. # Now iterate those tasks in dependency order to regenerate their taskhash/unihash
  2212. next = set()
  2213. for p in total:
  2214. if not self.rqdata.runtaskentries[p].depends:
  2215. next.add(p)
  2216. elif self.rqdata.runtaskentries[p].depends.isdisjoint(total):
  2217. next.add(p)
  2218. starttime = time.time()
  2219. lasttime = starttime
  2220. # When an item doesn't have dependencies in total, we can process it. Drop items from total when handled
  2221. while next:
  2222. current = next.copy()
  2223. next = set()
  2224. ready = {}
  2225. for tid in current:
  2226. if self.rqdata.runtaskentries[p].depends and not self.rqdata.runtaskentries[tid].depends.isdisjoint(total):
  2227. continue
  2228. # get_taskhash for a given tid *must* be called before get_unihash* below
  2229. ready[tid] = bb.parse.siggen.get_taskhash(tid, self.rqdata.runtaskentries[tid].depends, self.rqdata.dataCaches)
  2230. unihashes = bb.parse.siggen.get_unihashes(ready.keys())
  2231. for tid in ready:
  2232. orighash = self.rqdata.runtaskentries[tid].hash
  2233. newhash = ready[tid]
  2234. origuni = self.rqdata.runtaskentries[tid].unihash
  2235. newuni = unihashes[tid]
  2236. # FIXME, need to check it can come from sstate at all for determinism?
  2237. remapped = False
  2238. if newuni == origuni:
  2239. # Nothing to do, we match, skip code below
  2240. remapped = True
  2241. elif tid in self.scenequeue_covered or tid in self.sq_live:
  2242. # Already ran this setscene task or it running. Report the new taskhash
  2243. bb.parse.siggen.report_unihash_equiv(tid, newhash, origuni, newuni, self.rqdata.dataCaches)
  2244. hashequiv_logger.verbose("Already covered setscene for %s so ignoring rehash (remap)" % (tid))
  2245. remapped = True
  2246. if not remapped:
  2247. #logger.debug("Task %s hash changes: %s->%s %s->%s" % (tid, orighash, newhash, origuni, newuni))
  2248. self.rqdata.runtaskentries[tid].hash = newhash
  2249. self.rqdata.runtaskentries[tid].unihash = newuni
  2250. changed.add(tid)
  2251. next |= self.rqdata.runtaskentries[tid].revdeps
  2252. total.remove(tid)
  2253. next.intersection_update(total)
  2254. bb.event.check_for_interrupts(self.cooker.data)
  2255. if time.time() > (lasttime + 30):
  2256. lasttime = time.time()
  2257. hashequiv_logger.verbose("Rehash loop slow progress: %s in %s" % (len(total), lasttime - starttime))
  2258. endtime = time.time()
  2259. if (endtime-starttime > 60):
  2260. hashequiv_logger.verbose("Rehash loop took more than 60s: %s" % (endtime-starttime))
  2261. if changed:
  2262. for mc in self.rq.worker:
  2263. RunQueue.send_pickled_data(self.rq.worker[mc].process, bb.parse.siggen.get_taskhashes(), "newtaskhashes")
  2264. for mc in self.rq.fakeworker:
  2265. RunQueue.send_pickled_data(self.rq.fakeworker[mc].process, bb.parse.siggen.get_taskhashes(), "newtaskhashes")
  2266. hashequiv_logger.debug(pprint.pformat("Tasks changed:\n%s" % (changed)))
  2267. for tid in changed:
  2268. if tid not in self.rqdata.runq_setscene_tids:
  2269. continue
  2270. if tid not in self.pending_migrations:
  2271. self.pending_migrations.add(tid)
  2272. update_tasks = []
  2273. for tid in self.pending_migrations.copy():
  2274. if tid in self.runq_running or tid in self.sq_live:
  2275. # Too late, task already running, not much we can do now
  2276. self.pending_migrations.remove(tid)
  2277. continue
  2278. valid = True
  2279. # Check no tasks this covers are running
  2280. for dep in self.sqdata.sq_covered_tasks[tid]:
  2281. if dep in self.runq_running and dep not in self.runq_complete:
  2282. hashequiv_logger.debug2("Task %s is running which blocks setscene for %s from running" % (dep, tid))
  2283. valid = False
  2284. break
  2285. if not valid:
  2286. continue
  2287. self.pending_migrations.remove(tid)
  2288. changed = True
  2289. if tid in self.tasks_scenequeue_done:
  2290. self.tasks_scenequeue_done.remove(tid)
  2291. for dep in self.sqdata.sq_covered_tasks[tid]:
  2292. if dep in self.runq_complete and dep not in self.runq_tasksrun:
  2293. bb.error("Task %s marked as completed but now needing to rerun? Halting build." % dep)
  2294. self.failed_tids.append(tid)
  2295. self.rq.state = runQueueCleanUp
  2296. return
  2297. if dep not in self.runq_complete:
  2298. if dep in self.tasks_scenequeue_done and dep not in self.sqdata.unskippable:
  2299. self.tasks_scenequeue_done.remove(dep)
  2300. if tid in self.sq_buildable:
  2301. self.sq_buildable.remove(tid)
  2302. if tid in self.sq_running:
  2303. self.sq_running.remove(tid)
  2304. if tid in self.sqdata.outrightfail:
  2305. self.sqdata.outrightfail.remove(tid)
  2306. if tid in self.scenequeue_notcovered:
  2307. self.scenequeue_notcovered.remove(tid)
  2308. if tid in self.scenequeue_covered:
  2309. self.scenequeue_covered.remove(tid)
  2310. if tid in self.scenequeue_notneeded:
  2311. self.scenequeue_notneeded.remove(tid)
  2312. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  2313. self.sqdata.stamps[tid] = bb.parse.siggen.stampfile_mcfn(taskname, taskfn, extrainfo=False)
  2314. if tid in self.stampcache:
  2315. del self.stampcache[tid]
  2316. if tid in self.build_stamps:
  2317. del self.build_stamps[tid]
  2318. update_tasks.append(tid)
  2319. update_tasks2 = []
  2320. for tid in update_tasks:
  2321. harddepfail = False
  2322. for t in self.sqdata.sq_harddeps_rev[tid]:
  2323. if t in self.scenequeue_notcovered:
  2324. harddepfail = True
  2325. break
  2326. if not harddepfail and self.sqdata.sq_revdeps[tid].issubset(self.scenequeue_covered | self.scenequeue_notcovered):
  2327. if tid not in self.sq_buildable:
  2328. self.sq_buildable.add(tid)
  2329. if not self.sqdata.sq_revdeps[tid]:
  2330. self.sq_buildable.add(tid)
  2331. update_tasks2.append((tid, harddepfail, tid in self.sqdata.valid))
  2332. if update_tasks2:
  2333. self.sqdone = False
  2334. for mc in sorted(self.sqdata.multiconfigs):
  2335. for tid in sorted([t[0] for t in update_tasks2]):
  2336. if mc_from_tid(tid) != mc:
  2337. continue
  2338. h = pending_hash_index(tid, self.rqdata)
  2339. if h in self.sqdata.hashes and tid != self.sqdata.hashes[h]:
  2340. self.sq_deferred[tid] = self.sqdata.hashes[h]
  2341. bb.note("Deferring %s after %s" % (tid, self.sqdata.hashes[h]))
  2342. update_scenequeue_data([t[0] for t in update_tasks2], self.sqdata, self.rqdata, self.rq, self.cooker, self.stampcache, self, summary=False)
  2343. for (tid, harddepfail, origvalid) in update_tasks2:
  2344. if tid in self.sqdata.valid and not origvalid:
  2345. hashequiv_logger.verbose("Setscene task %s became valid" % tid)
  2346. if harddepfail:
  2347. logger.debug2("%s has an unavailable hard dependency so skipping" % (tid))
  2348. self.sq_task_failoutright(tid)
  2349. if changed:
  2350. self.stats.updateCovered(len(self.scenequeue_covered), len(self.scenequeue_notcovered))
  2351. self.sq_needed_harddeps = set()
  2352. self.sq_harddep_deferred = set()
  2353. self.holdoff_need_update = True
  2354. def scenequeue_updatecounters(self, task, fail=False):
  2355. if fail and task in self.sqdata.sq_harddeps:
  2356. for dep in sorted(self.sqdata.sq_harddeps[task]):
  2357. if dep in self.scenequeue_covered or dep in self.scenequeue_notcovered:
  2358. # dependency could be already processed, e.g. noexec setscene task
  2359. continue
  2360. noexec, stamppresent = check_setscene_stamps(dep, self.rqdata, self.rq, self.stampcache)
  2361. if noexec or stamppresent:
  2362. continue
  2363. logger.debug2("%s was unavailable and is a hard dependency of %s so skipping" % (task, dep))
  2364. self.sq_task_failoutright(dep)
  2365. continue
  2366. # For performance, only compute allcovered once if needed
  2367. if self.sqdata.sq_deps[task]:
  2368. allcovered = self.scenequeue_covered | self.scenequeue_notcovered
  2369. for dep in sorted(self.sqdata.sq_deps[task]):
  2370. if self.sqdata.sq_revdeps[dep].issubset(allcovered):
  2371. if dep not in self.sq_buildable:
  2372. self.sq_buildable.add(dep)
  2373. next = set([task])
  2374. while next:
  2375. new = set()
  2376. for t in sorted(next):
  2377. self.tasks_scenequeue_done.add(t)
  2378. # Look down the dependency chain for non-setscene things which this task depends on
  2379. # and mark as 'done'
  2380. for dep in self.rqdata.runtaskentries[t].depends:
  2381. if dep in self.rqdata.runq_setscene_tids or dep in self.tasks_scenequeue_done:
  2382. continue
  2383. if self.rqdata.runtaskentries[dep].revdeps.issubset(self.tasks_scenequeue_done):
  2384. new.add(dep)
  2385. next = new
  2386. # If this task was one which other setscene tasks have a hard dependency upon, we need
  2387. # to walk through the hard dependencies and allow execution of those which have completed dependencies.
  2388. if task in self.sqdata.sq_harddeps:
  2389. for dep in self.sq_harddep_deferred.copy():
  2390. if self.sqdata.sq_harddeps_rev[dep].issubset(self.scenequeue_covered | self.scenequeue_notcovered):
  2391. self.sq_harddep_deferred.remove(dep)
  2392. self.stats.updateCovered(len(self.scenequeue_covered), len(self.scenequeue_notcovered))
  2393. self.holdoff_need_update = True
  2394. def sq_task_completeoutright(self, task):
  2395. """
  2396. Mark a task as completed
  2397. Look at the reverse dependencies and mark any task with
  2398. completed dependencies as buildable
  2399. """
  2400. logger.debug('Found task %s which could be accelerated', task)
  2401. self.scenequeue_covered.add(task)
  2402. self.scenequeue_updatecounters(task)
  2403. def sq_check_taskfail(self, task):
  2404. if self.rqdata.setscene_ignore_tasks is not None:
  2405. realtask = task.split('_setscene')[0]
  2406. (mc, fn, taskname, taskfn) = split_tid_mcfn(realtask)
  2407. pn = self.rqdata.dataCaches[mc].pkg_fn[taskfn]
  2408. if not check_setscene_enforce_ignore_tasks(pn, taskname, self.rqdata.setscene_ignore_tasks):
  2409. logger.error('Task %s.%s failed' % (pn, taskname + "_setscene"))
  2410. self.rq.state = runQueueCleanUp
  2411. def sq_task_complete(self, task):
  2412. bb.event.fire(sceneQueueTaskCompleted(task, self.stats, self.rq), self.cfgData)
  2413. self.sq_task_completeoutright(task)
  2414. def sq_task_fail(self, task, result):
  2415. bb.event.fire(sceneQueueTaskFailed(task, self.stats, result, self), self.cfgData)
  2416. self.scenequeue_notcovered.add(task)
  2417. self.scenequeue_updatecounters(task, True)
  2418. self.sq_check_taskfail(task)
  2419. def sq_task_failoutright(self, task):
  2420. self.sq_running.add(task)
  2421. self.sq_buildable.add(task)
  2422. self.scenequeue_notcovered.add(task)
  2423. self.scenequeue_updatecounters(task, True)
  2424. def sq_task_skip(self, task):
  2425. self.sq_running.add(task)
  2426. self.sq_buildable.add(task)
  2427. self.sq_task_completeoutright(task)
  2428. def sq_build_taskdepdata(self, task):
  2429. def getsetscenedeps(tid):
  2430. deps = set()
  2431. (mc, fn, taskname, _) = split_tid_mcfn(tid)
  2432. realtid = tid + "_setscene"
  2433. idepends = self.rqdata.taskData[mc].taskentries[realtid].idepends
  2434. for (depname, idependtask) in idepends:
  2435. if depname not in self.rqdata.taskData[mc].build_targets:
  2436. continue
  2437. depfn = self.rqdata.taskData[mc].build_targets[depname][0]
  2438. if depfn is None:
  2439. continue
  2440. deptid = depfn + ":" + idependtask.replace("_setscene", "")
  2441. deps.add(deptid)
  2442. return deps
  2443. taskdepdata = {}
  2444. next = getsetscenedeps(task)
  2445. next.add(task)
  2446. while next:
  2447. additional = []
  2448. for revdep in next:
  2449. (mc, fn, taskname, taskfn) = split_tid_mcfn(revdep)
  2450. deps = getsetscenedeps(revdep)
  2451. taskdepdata[revdep] = bb.TaskData(
  2452. pn = self.rqdata.dataCaches[mc].pkg_fn[taskfn],
  2453. taskname = taskname,
  2454. fn = fn,
  2455. deps = deps,
  2456. provides = self.rqdata.dataCaches[mc].fn_provides[taskfn],
  2457. taskhash = self.rqdata.runtaskentries[revdep].hash,
  2458. unihash = self.rqdata.runtaskentries[revdep].unihash,
  2459. hashfn = self.rqdata.dataCaches[mc].hashfn[taskfn],
  2460. taskhash_deps = self.rqdata.runtaskentries[revdep].taskhash_deps,
  2461. )
  2462. for revdep2 in deps:
  2463. if revdep2 not in taskdepdata:
  2464. additional.append(revdep2)
  2465. next = additional
  2466. #bb.note("Task %s: " % task + str(taskdepdata).replace("], ", "],\n"))
  2467. return taskdepdata
  2468. def check_setscene_ignore_tasks(self, tid):
  2469. # Check task that is going to run against the ignore tasks list
  2470. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  2471. # Ignore covered tasks
  2472. if tid in self.tasks_covered:
  2473. return False
  2474. # Ignore stamped tasks
  2475. if self.rq.check_stamp_task(tid, taskname, cache=self.stampcache):
  2476. return False
  2477. # Ignore noexec tasks
  2478. taskdep = self.rqdata.dataCaches[mc].task_deps[taskfn]
  2479. if 'noexec' in taskdep and taskname in taskdep['noexec']:
  2480. return False
  2481. pn = self.rqdata.dataCaches[mc].pkg_fn[taskfn]
  2482. if not check_setscene_enforce_ignore_tasks(pn, taskname, self.rqdata.setscene_ignore_tasks):
  2483. if tid in self.rqdata.runq_setscene_tids:
  2484. msg = ['Task %s.%s attempted to execute unexpectedly and should have been setscened' % (pn, taskname)]
  2485. else:
  2486. msg = ['Task %s.%s attempted to execute unexpectedly' % (pn, taskname)]
  2487. for t in self.scenequeue_notcovered:
  2488. msg.append("\nTask %s, unihash %s, taskhash %s" % (t, self.rqdata.runtaskentries[t].unihash, self.rqdata.runtaskentries[t].hash))
  2489. msg.append('\nThis is usually due to missing setscene tasks. Those missing in this build were: %s' % pprint.pformat(self.scenequeue_notcovered))
  2490. logger.error("".join(msg))
  2491. return True
  2492. return False
  2493. class SQData(object):
  2494. def __init__(self):
  2495. # SceneQueue dependencies
  2496. self.sq_deps = {}
  2497. # SceneQueue reverse dependencies
  2498. self.sq_revdeps = {}
  2499. # Injected inter-setscene task dependencies
  2500. self.sq_harddeps = {}
  2501. self.sq_harddeps_rev = {}
  2502. # Cache of stamp files so duplicates can't run in parallel
  2503. self.stamps = {}
  2504. # Setscene tasks directly depended upon by the build
  2505. self.unskippable = set()
  2506. # List of setscene tasks which aren't present
  2507. self.outrightfail = set()
  2508. # A list of normal tasks a setscene task covers
  2509. self.sq_covered_tasks = {}
  2510. def build_scenequeue_data(sqdata, rqdata, sqrq):
  2511. sq_revdeps = {}
  2512. sq_revdeps_squash = {}
  2513. sq_collated_deps = {}
  2514. # We can't skip specified target tasks which aren't setscene tasks
  2515. sqdata.cantskip = set(rqdata.target_tids)
  2516. sqdata.cantskip.difference_update(rqdata.runq_setscene_tids)
  2517. sqdata.cantskip.intersection_update(rqdata.runtaskentries)
  2518. # We need to construct a dependency graph for the setscene functions. Intermediate
  2519. # dependencies between the setscene tasks only complicate the code. This code
  2520. # therefore aims to collapse the huge runqueue dependency tree into a smaller one
  2521. # only containing the setscene functions.
  2522. rqdata.init_progress_reporter.next_stage()
  2523. # First process the chains up to the first setscene task.
  2524. endpoints = {}
  2525. for tid in rqdata.runtaskentries:
  2526. sq_revdeps[tid] = copy.copy(rqdata.runtaskentries[tid].revdeps)
  2527. sq_revdeps_squash[tid] = set()
  2528. if not sq_revdeps[tid] and tid not in rqdata.runq_setscene_tids:
  2529. #bb.warn("Added endpoint %s" % (tid))
  2530. endpoints[tid] = set()
  2531. rqdata.init_progress_reporter.next_stage()
  2532. # Secondly process the chains between setscene tasks.
  2533. for tid in rqdata.runq_setscene_tids:
  2534. sq_collated_deps[tid] = set()
  2535. #bb.warn("Added endpoint 2 %s" % (tid))
  2536. for dep in rqdata.runtaskentries[tid].depends:
  2537. if tid in sq_revdeps[dep]:
  2538. sq_revdeps[dep].remove(tid)
  2539. if dep not in endpoints:
  2540. endpoints[dep] = set()
  2541. #bb.warn(" Added endpoint 3 %s" % (dep))
  2542. endpoints[dep].add(tid)
  2543. rqdata.init_progress_reporter.next_stage()
  2544. def process_endpoints(endpoints):
  2545. newendpoints = {}
  2546. for point, task in endpoints.items():
  2547. tasks = set()
  2548. if task:
  2549. tasks |= task
  2550. if sq_revdeps_squash[point]:
  2551. tasks |= sq_revdeps_squash[point]
  2552. if point not in rqdata.runq_setscene_tids:
  2553. for t in tasks:
  2554. sq_collated_deps[t].add(point)
  2555. sq_revdeps_squash[point] = set()
  2556. if point in rqdata.runq_setscene_tids:
  2557. sq_revdeps_squash[point] = tasks
  2558. continue
  2559. for dep in rqdata.runtaskentries[point].depends:
  2560. if point in sq_revdeps[dep]:
  2561. sq_revdeps[dep].remove(point)
  2562. if tasks:
  2563. sq_revdeps_squash[dep] |= tasks
  2564. if not sq_revdeps[dep] and dep not in rqdata.runq_setscene_tids:
  2565. newendpoints[dep] = task
  2566. if newendpoints:
  2567. process_endpoints(newendpoints)
  2568. process_endpoints(endpoints)
  2569. rqdata.init_progress_reporter.next_stage()
  2570. # Build a list of tasks which are "unskippable"
  2571. # These are direct endpoints referenced by the build upto and including setscene tasks
  2572. # Take the build endpoints (no revdeps) and find the sstate tasks they depend upon
  2573. new = True
  2574. for tid in rqdata.runtaskentries:
  2575. if not rqdata.runtaskentries[tid].revdeps:
  2576. sqdata.unskippable.add(tid)
  2577. sqdata.unskippable |= sqdata.cantskip
  2578. while new:
  2579. new = False
  2580. orig = sqdata.unskippable.copy()
  2581. for tid in sorted(orig, reverse=True):
  2582. if tid in rqdata.runq_setscene_tids:
  2583. continue
  2584. if not rqdata.runtaskentries[tid].depends:
  2585. # These are tasks which have no setscene tasks in their chain, need to mark as directly buildable
  2586. sqrq.setbuildable(tid)
  2587. sqdata.unskippable |= rqdata.runtaskentries[tid].depends
  2588. if sqdata.unskippable != orig:
  2589. new = True
  2590. sqrq.tasks_scenequeue_done |= sqdata.unskippable.difference(rqdata.runq_setscene_tids)
  2591. rqdata.init_progress_reporter.next_stage(len(rqdata.runtaskentries))
  2592. # Sanity check all dependencies could be changed to setscene task references
  2593. for taskcounter, tid in enumerate(rqdata.runtaskentries):
  2594. if tid in rqdata.runq_setscene_tids:
  2595. pass
  2596. elif sq_revdeps_squash[tid]:
  2597. bb.msg.fatal("RunQueue", "Something went badly wrong during scenequeue generation, halting. Please report this problem.")
  2598. else:
  2599. del sq_revdeps_squash[tid]
  2600. rqdata.init_progress_reporter.update(taskcounter)
  2601. rqdata.init_progress_reporter.next_stage()
  2602. # Resolve setscene inter-task dependencies
  2603. # e.g. do_sometask_setscene[depends] = "targetname:do_someothertask_setscene"
  2604. # Note that anything explicitly depended upon will have its reverse dependencies removed to avoid circular dependencies
  2605. for tid in rqdata.runq_setscene_tids:
  2606. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  2607. realtid = tid + "_setscene"
  2608. idepends = rqdata.taskData[mc].taskentries[realtid].idepends
  2609. sqdata.stamps[tid] = bb.parse.siggen.stampfile_mcfn(taskname, taskfn, extrainfo=False)
  2610. sqdata.sq_harddeps_rev[tid] = set()
  2611. for (depname, idependtask) in idepends:
  2612. if depname not in rqdata.taskData[mc].build_targets:
  2613. continue
  2614. depfn = rqdata.taskData[mc].build_targets[depname][0]
  2615. if depfn is None:
  2616. continue
  2617. deptid = depfn + ":" + idependtask.replace("_setscene", "")
  2618. if deptid not in rqdata.runtaskentries:
  2619. bb.msg.fatal("RunQueue", "Task %s depends upon non-existent task %s:%s" % (realtid, depfn, idependtask))
  2620. logger.debug2("Adding hard setscene dependency %s for %s" % (deptid, tid))
  2621. if not deptid in sqdata.sq_harddeps:
  2622. sqdata.sq_harddeps[deptid] = set()
  2623. sqdata.sq_harddeps[deptid].add(tid)
  2624. sqdata.sq_harddeps_rev[tid].add(deptid)
  2625. rqdata.init_progress_reporter.next_stage()
  2626. rqdata.init_progress_reporter.next_stage()
  2627. #for tid in sq_revdeps_squash:
  2628. # data = ""
  2629. # for dep in sq_revdeps_squash[tid]:
  2630. # data = data + "\n %s" % dep
  2631. # bb.warn("Task %s_setscene: is %s " % (tid, data))
  2632. sqdata.sq_revdeps = sq_revdeps_squash
  2633. sqdata.sq_covered_tasks = sq_collated_deps
  2634. # Build reverse version of revdeps to populate deps structure
  2635. for tid in sqdata.sq_revdeps:
  2636. sqdata.sq_deps[tid] = set()
  2637. for tid in sqdata.sq_revdeps:
  2638. for dep in sqdata.sq_revdeps[tid]:
  2639. sqdata.sq_deps[dep].add(tid)
  2640. rqdata.init_progress_reporter.next_stage()
  2641. sqdata.multiconfigs = set()
  2642. for tid in sqdata.sq_revdeps:
  2643. sqdata.multiconfigs.add(mc_from_tid(tid))
  2644. if not sqdata.sq_revdeps[tid]:
  2645. sqrq.sq_buildable.add(tid)
  2646. rqdata.init_progress_reporter.next_stage()
  2647. sqdata.noexec = set()
  2648. sqdata.stamppresent = set()
  2649. sqdata.valid = set()
  2650. sqdata.hashes = {}
  2651. sqrq.sq_deferred = {}
  2652. for mc in sorted(sqdata.multiconfigs):
  2653. for tid in sorted(sqdata.sq_revdeps):
  2654. if mc_from_tid(tid) != mc:
  2655. continue
  2656. h = pending_hash_index(tid, rqdata)
  2657. if h not in sqdata.hashes:
  2658. sqdata.hashes[h] = tid
  2659. else:
  2660. sqrq.sq_deferred[tid] = sqdata.hashes[h]
  2661. bb.debug(1, "Deferring %s after %s" % (tid, sqdata.hashes[h]))
  2662. def check_setscene_stamps(tid, rqdata, rq, stampcache, noexecstamp=False):
  2663. (mc, fn, taskname, taskfn) = split_tid_mcfn(tid)
  2664. taskdep = rqdata.dataCaches[mc].task_deps[taskfn]
  2665. if 'noexec' in taskdep and taskname in taskdep['noexec']:
  2666. bb.build.make_stamp_mcfn(taskname + "_setscene", taskfn)
  2667. return True, False
  2668. if rq.check_stamp_task(tid, taskname + "_setscene", cache=stampcache):
  2669. logger.debug2('Setscene stamp current for task %s', tid)
  2670. return False, True
  2671. if rq.check_stamp_task(tid, taskname, recurse = True, cache=stampcache):
  2672. logger.debug2('Normal stamp current for task %s', tid)
  2673. return False, True
  2674. return False, False
  2675. def update_scenequeue_data(tids, sqdata, rqdata, rq, cooker, stampcache, sqrq, summary=True):
  2676. tocheck = set()
  2677. for tid in sorted(tids):
  2678. if tid in sqdata.stamppresent:
  2679. sqdata.stamppresent.remove(tid)
  2680. if tid in sqdata.valid:
  2681. sqdata.valid.remove(tid)
  2682. if tid in sqdata.outrightfail:
  2683. sqdata.outrightfail.remove(tid)
  2684. noexec, stamppresent = check_setscene_stamps(tid, rqdata, rq, stampcache, noexecstamp=True)
  2685. if noexec:
  2686. sqdata.noexec.add(tid)
  2687. sqrq.sq_task_skip(tid)
  2688. logger.debug2("%s is noexec so skipping setscene" % (tid))
  2689. continue
  2690. if stamppresent:
  2691. sqdata.stamppresent.add(tid)
  2692. sqrq.sq_task_skip(tid)
  2693. logger.debug2("%s has a valid stamp, skipping" % (tid))
  2694. continue
  2695. tocheck.add(tid)
  2696. sqdata.valid |= rq.validate_hashes(tocheck, cooker.data, len(sqdata.stamppresent), False, summary=summary)
  2697. for tid in tids:
  2698. if tid in sqdata.stamppresent:
  2699. continue
  2700. if tid in sqdata.valid:
  2701. continue
  2702. if tid in sqdata.noexec:
  2703. continue
  2704. if tid in sqrq.scenequeue_covered:
  2705. continue
  2706. if tid in sqrq.scenequeue_notcovered:
  2707. continue
  2708. if tid in sqrq.sq_deferred:
  2709. continue
  2710. sqdata.outrightfail.add(tid)
  2711. logger.debug2("%s already handled (fallthrough), skipping" % (tid))
  2712. class TaskFailure(Exception):
  2713. """
  2714. Exception raised when a task in a runqueue fails
  2715. """
  2716. def __init__(self, x):
  2717. self.args = x
  2718. class runQueueExitWait(bb.event.Event):
  2719. """
  2720. Event when waiting for task processes to exit
  2721. """
  2722. def __init__(self, remain):
  2723. self.remain = remain
  2724. self.message = "Waiting for %s active tasks to finish" % remain
  2725. bb.event.Event.__init__(self)
  2726. class runQueueEvent(bb.event.Event):
  2727. """
  2728. Base runQueue event class
  2729. """
  2730. def __init__(self, task, stats, rq):
  2731. self.taskid = task
  2732. self.taskstring = task
  2733. self.taskname = taskname_from_tid(task)
  2734. self.taskfile = fn_from_tid(task)
  2735. self.taskhash = rq.rqdata.get_task_hash(task)
  2736. self.stats = stats.copy()
  2737. bb.event.Event.__init__(self)
  2738. class sceneQueueEvent(runQueueEvent):
  2739. """
  2740. Base sceneQueue event class
  2741. """
  2742. def __init__(self, task, stats, rq, noexec=False):
  2743. runQueueEvent.__init__(self, task, stats, rq)
  2744. self.taskstring = task + "_setscene"
  2745. self.taskname = taskname_from_tid(task) + "_setscene"
  2746. self.taskfile = fn_from_tid(task)
  2747. self.taskhash = rq.rqdata.get_task_hash(task)
  2748. class runQueueTaskStarted(runQueueEvent):
  2749. """
  2750. Event notifying a task was started
  2751. """
  2752. def __init__(self, task, stats, rq, noexec=False):
  2753. runQueueEvent.__init__(self, task, stats, rq)
  2754. self.noexec = noexec
  2755. class sceneQueueTaskStarted(sceneQueueEvent):
  2756. """
  2757. Event notifying a setscene task was started
  2758. """
  2759. def __init__(self, task, stats, rq, noexec=False):
  2760. sceneQueueEvent.__init__(self, task, stats, rq)
  2761. self.noexec = noexec
  2762. class runQueueTaskFailed(runQueueEvent):
  2763. """
  2764. Event notifying a task failed
  2765. """
  2766. def __init__(self, task, stats, exitcode, rq, fakeroot_log=None):
  2767. runQueueEvent.__init__(self, task, stats, rq)
  2768. self.exitcode = exitcode
  2769. self.fakeroot_log = fakeroot_log
  2770. def __str__(self):
  2771. if self.fakeroot_log:
  2772. return "Task (%s) failed with exit code '%s' \nPseudo log:\n%s" % (self.taskstring, self.exitcode, self.fakeroot_log)
  2773. else:
  2774. return "Task (%s) failed with exit code '%s'" % (self.taskstring, self.exitcode)
  2775. class sceneQueueTaskFailed(sceneQueueEvent):
  2776. """
  2777. Event notifying a setscene task failed
  2778. """
  2779. def __init__(self, task, stats, exitcode, rq):
  2780. sceneQueueEvent.__init__(self, task, stats, rq)
  2781. self.exitcode = exitcode
  2782. def __str__(self):
  2783. return "Setscene task (%s) failed with exit code '%s' - real task will be run instead" % (self.taskstring, self.exitcode)
  2784. class sceneQueueComplete(sceneQueueEvent):
  2785. """
  2786. Event when all the sceneQueue tasks are complete
  2787. """
  2788. def __init__(self, stats, rq):
  2789. self.stats = stats.copy()
  2790. bb.event.Event.__init__(self)
  2791. class runQueueTaskCompleted(runQueueEvent):
  2792. """
  2793. Event notifying a task completed
  2794. """
  2795. class sceneQueueTaskCompleted(sceneQueueEvent):
  2796. """
  2797. Event notifying a setscene task completed
  2798. """
  2799. class runQueueTaskSkipped(runQueueEvent):
  2800. """
  2801. Event notifying a task was skipped
  2802. """
  2803. def __init__(self, task, stats, rq, reason):
  2804. runQueueEvent.__init__(self, task, stats, rq)
  2805. self.reason = reason
  2806. class taskUniHashUpdate(bb.event.Event):
  2807. """
  2808. Base runQueue event class
  2809. """
  2810. def __init__(self, task, unihash):
  2811. self.taskid = task
  2812. self.unihash = unihash
  2813. bb.event.Event.__init__(self)
  2814. class runQueuePipe():
  2815. """
  2816. Abstraction for a pipe between a worker thread and the server
  2817. """
  2818. def __init__(self, pipein, pipeout, d, rq, rqexec, fakerootlogs=None):
  2819. self.input = pipein
  2820. if pipeout:
  2821. pipeout.close()
  2822. bb.utils.nonblockingfd(self.input)
  2823. self.queue = bytearray()
  2824. self.d = d
  2825. self.rq = rq
  2826. self.rqexec = rqexec
  2827. self.fakerootlogs = fakerootlogs
  2828. def read(self):
  2829. for workers, name in [(self.rq.worker, "Worker"), (self.rq.fakeworker, "Fakeroot")]:
  2830. for worker in workers.values():
  2831. worker.process.poll()
  2832. if worker.process.returncode is not None and not self.rq.teardown:
  2833. bb.error("%s process (%s) exited unexpectedly (%s), shutting down..." % (name, worker.process.pid, str(worker.process.returncode)))
  2834. self.rq.finish_runqueue(True)
  2835. start = len(self.queue)
  2836. try:
  2837. self.queue.extend(self.input.read(512 * 1024) or b"")
  2838. except (OSError, IOError) as e:
  2839. if e.errno != errno.EAGAIN:
  2840. raise
  2841. end = len(self.queue)
  2842. found = True
  2843. while found and self.queue:
  2844. found = False
  2845. index = self.queue.find(b"</event>")
  2846. while index != -1 and self.queue.startswith(b"<event>"):
  2847. try:
  2848. event = pickle.loads(self.queue[7:index])
  2849. except (ValueError, pickle.UnpicklingError, AttributeError, IndexError) as e:
  2850. if isinstance(e, pickle.UnpicklingError) and "truncated" in str(e):
  2851. # The pickled data could contain "</event>" so search for the next occurance
  2852. # unpickling again, this should be the only way an unpickle error could occur
  2853. index = self.queue.find(b"</event>", index + 1)
  2854. continue
  2855. bb.msg.fatal("RunQueue", "failed load pickle '%s': '%s'" % (e, self.queue[7:index]))
  2856. bb.event.fire_from_worker(event, self.d)
  2857. if isinstance(event, taskUniHashUpdate):
  2858. self.rqexec.updated_taskhash_queue.append((event.taskid, event.unihash))
  2859. found = True
  2860. self.queue = self.queue[index+8:]
  2861. index = self.queue.find(b"</event>")
  2862. index = self.queue.find(b"</exitcode>")
  2863. while index != -1 and self.queue.startswith(b"<exitcode>"):
  2864. try:
  2865. task, status = pickle.loads(self.queue[10:index])
  2866. except (ValueError, pickle.UnpicklingError, AttributeError, IndexError) as e:
  2867. bb.msg.fatal("RunQueue", "failed load pickle '%s': '%s'" % (e, self.queue[10:index]))
  2868. (_, _, _, taskfn) = split_tid_mcfn(task)
  2869. fakerootlog = None
  2870. if self.fakerootlogs and taskfn and taskfn in self.fakerootlogs:
  2871. fakerootlog = self.fakerootlogs[taskfn]
  2872. self.rqexec.runqueue_process_waitpid(task, status, fakerootlog=fakerootlog)
  2873. found = True
  2874. self.queue = self.queue[index+11:]
  2875. index = self.queue.find(b"</exitcode>")
  2876. return (end > start)
  2877. def close(self):
  2878. while self.read():
  2879. continue
  2880. if self.queue:
  2881. print("Warning, worker left partial message: %s" % self.queue)
  2882. self.input.close()
  2883. def get_setscene_enforce_ignore_tasks(d, targets):
  2884. if d.getVar('BB_SETSCENE_ENFORCE') != '1':
  2885. return None
  2886. ignore_tasks = (d.getVar("BB_SETSCENE_ENFORCE_IGNORE_TASKS") or "").split()
  2887. outlist = []
  2888. for item in ignore_tasks[:]:
  2889. if item.startswith('%:'):
  2890. for (mc, target, task, fn) in targets:
  2891. outlist.append(target + ':' + item.split(':')[1])
  2892. else:
  2893. outlist.append(item)
  2894. return outlist
  2895. def check_setscene_enforce_ignore_tasks(pn, taskname, ignore_tasks):
  2896. import fnmatch
  2897. if ignore_tasks is not None:
  2898. item = '%s:%s' % (pn, taskname)
  2899. for ignore_tasks in ignore_tasks:
  2900. if fnmatch.fnmatch(item, ignore_tasks):
  2901. return True
  2902. return False
  2903. return True