File: //usr/lib/python2.7/dist-packages/mercurial/worker.pyc
ó
ÛXc @@ së d d l m Z d d l Z d d l Z d d l Z d d l Z d d l Z d d l m Z d d l m
Z
d „ Z d „ Z e j
d k r– d Z n d
Z d „ Z d „ Z d
„ Z d „ Z e j
d k rÞ e Z e Z n d „ Z d S( i ( t absolute_importNi ( t _( t errorc C@ sˆ y) t t j d ƒ ƒ } | d k r( | SWn t t f k
rB n Xy' t t j d ƒ } | d k ri | SWn t t f k
rƒ n Xd S( s- try to count the number of CPUs on the systemt SC_NPROCESSORS_ONLNi t NUMBER_OF_PROCESSORSi ( t intt ost sysconft AttributeErrort
ValueErrort environt KeyError( t n( ( s4 /usr/lib/python2.7/dist-packages/mercurial/worker.pyt countcpus s c C@ s} | j d d ƒ } | rd y t | ƒ } | d k r7 | SWqd t k
r` t j t d ƒ ƒ ‚ qd Xn t t t ƒ d ƒ d ƒ S( Nt workert numcpusi s! number of cpus must be an integeri i ( t configR R R t AbortR t mint maxR
( t uit sR ( ( s4 /usr/lib/python2.7/dist-packages/mercurial/worker.pyt _numworkers( s
t posixg{®Gáz„?gêŒ 9Y>)Fc C@ s6 | | } t | ƒ } | t | | | } | d k S( se try to determine whether the benefit of multiple processes can
outweigh the cost of starting themg333333Ã?( R t _startupcost( R t costperopt nopst lineart workerst benefit( ( s4 /usr/lib/python2.7/dist-packages/mercurial/worker.pyt
worthwhile8 s
c C@ s< t | | t | ƒ ƒ r+ t | | | | ƒ S| | | f Œ S( sF run a function, possibly in parallel in multiple worker
processes.
returns a progress iterator
costperarg - cost of a single task
func - function to run
staticargs - arguments to pass to every invocation of the function
args - arguments to split into chunks, to pass to individual
workers
( R t lent _platformworker( R t
costperargt funct
staticargst args( ( s4 /usr/lib/python2.7/dist-packages/mercurial/worker.pyR @ s c #@ s t j ƒ \ } } t | ƒ } t j t j ƒ ‰ t j t j t j ƒ g d g ‰ ‰ xÏ t | | ƒ D]¾ } t j ƒ } | d k rt j t j ˆ ƒ y\ t j | ƒ x; | | | f Œ D]& \ } }
t j
| d | |
f ƒ q» Wt j d ƒ Wqt k
rt j d ƒ qXn ˆ j
| ƒ qf Wˆ j ƒ t j | ƒ t j | d d ƒ } ‡ f d † ‰ ‡ ‡ ‡ f d † } t j d | ƒ ‰ ˆ j ƒ ‡ ‡ ‡ f d † }
yD x= | D]5 } | j d d
ƒ } t | d ƒ | d
d f Vq³WWn ˆ ƒ |
ƒ ‚ n X|
ƒ d S( Ni s %d %s
iÿ t rbc @ sZ xS ˆ D]K } y t j | t j ƒ Wq t k
rQ } | j t j k rR ‚ qR q Xq Wd S( N( R t killt signalt SIGTERMt OSErrort errnot ESRCH( t pt err( t pids( s4 /usr/lib/python2.7/dist-packages/mercurial/worker.pyt killworkersj s
c @ sP xI ˆ D]A } t t j ƒ d ƒ } | r ˆ d r | ˆ d <ˆ ƒ q q Wd S( Ni i ( t _exitstatusR t wait( t _pidt st( R/ R. t problem( s4 /usr/lib/python2.7/dist-packages/mercurial/worker.pyt waitforworkersr s
t targetc @ sg t j t j ˆ ƒ ˆ j ƒ ˆ d } | rc | d k rS t j t j ƒ | ƒ n t j | ƒ n d S( Ni ( R' t SIGINTt joinR R& t getpidt syst exit( t status( t
oldhandlerR4 t t( s4 /usr/lib/python2.7/dist-packages/mercurial/worker.pyt cleanupz s
t i iÿÿÿÿ( R t pipeR R' t getsignalR7 t SIG_IGNt partitiont forkt closet writet _exitt KeyboardInterruptt appendt reverset fdopent threadingt Threadt startt splitR ( R R" R# R$ t rfdt wfdR t pargst pidt it itemt fpR5 R? t linet l( ( R/ R= R. R4 R> s4 /usr/lib/python2.7/dist-packages/mercurial/worker.pyt _posixworkerS sD
%c C@ s= t j | ƒ r t j | ƒ St j | ƒ r9 t j | ƒ Sd S( sˆ convert a posix exit status into the same form returned by
os.spawnv
returns None if the process was stopped instead of exitingN( R t WIFEXITEDt WEXITSTATUSt WIFSIGNALEDt WTERMSIG( t code( ( s4 /usr/lib/python2.7/dist-packages/mercurial/worker.pyt _posixexitstatusΠs
t ntc c@ s- x& t | ƒ D] } | | d | … Vq
Wd S( sã partition a list into N slices of roughly equal size
The current strategy takes every Nth element from the input. If
we ever write workers that need to preserve grouping in input
we should consider allowing callers to specify a partition strategy.
mpm is not a fan of this partitioning strategy when files are involved.
In his words:
Single-threaded Mercurial makes a point of creating and visiting
files in a fixed order (alphabetical). When creating files in order,
a typical filesystem is likely to allocate them on nearby regions on
disk. Thus, when revisiting in the same order, locality is maximized
and various forms of OS and disk-level caching and read-ahead get a
chance to work.
This effect can be quite significant on spinning disks. I discovered it
circa Mercurial v0.4 when revlogs were named by hashes of filenames.
Tarring a repo and copying it to another disk effectively randomized
the revlog ordering on disk by sorting the revlogs by hash and suddenly
performance of my kernel checkout benchmark dropped by ~10x because the
"working set" of sectors visited no longer fit in the drive's cache and
the workload switched from streaming to random I/O.
What we should really be doing is have workers read filenames from a
ordered queue. This preserves locality and also keeps any worker from
getting more than one file out of balance.
N( t range( t lstt nslicesRU ( ( s4 /usr/lib/python2.7/dist-packages/mercurial/worker.pyRD š s ( t
__future__R R* R R' R: RM t i18nR t R R
R t nameR R R RZ R` R R0 RD ( ( ( s4 /usr/lib/python2.7/dist-packages/mercurial/worker.pyt <module> s( 9