o g @sUddlmZddlZddlZddlZddlZddlZddlZddlZddl m Z m Z ddl m Z ddlmZddlmZmZmZmZmZmZmZmZmZer^ddlZddlmZedZnedZed Zed Z ee!e!ge"fZ#Gd d d Z$Gd dde$Z%Gddde$Z&Gddde$Z'Gddde$Z(Gddde$Z)Gddde$Z*Gddde$Z+GdddeeefZ,Gddde$Z-de$iZ.de/d <d*d+d(d)Z0e$e%e)e&e(e'e*e+e-f D]Z1e0e1qdS),) annotationsN)FutureThreadPoolExecutor)groupby) itemgetter) TYPE_CHECKINGAnyCallableClassVarGeneric NamedTupleOptional OrderedDictTypeVar) ParamSpecPTfsspecc@sPeZdZUdZdZded<dd d ZdddZdddZdddZ dddZ dS) BaseCacheagPass-though cache: doesn't keep anything, calls every time Acts as base class for other cachers Parameters ---------- blocksize: int How far to read ahead in numbers of bytes fetcher: func Function of the form f(start, end) which gets bytes from remote as specified size: int How big this file is none ClassVar[str]name blocksizeintfetcherFetchersizereturnNonecCs.||_d|_||_||_d|_d|_d|_dSNr)rnblocksrr hit_count miss_counttotal_requested_bytesselfrrrr&E/var/www/visachat/venv/lib/python3.10/site-packages/fsspec/caching.py__init__<s zBaseCache.__init__start int | NonestopbytescCs<|durd}|dur |j}||jks||krdS|||S)Nr)rrr%r)r+r&r&r'_fetchFs zBaseCache._fetchcCsd|_d|_d|_dS)zAReset hit and miss counts for a more ganular report e.g. by file.rN)r!r"r#r%r&r&r' _reset_statsOs zBaseCache._reset_statsstrc Cs>|jdkr |jdkr dSd|jd|jd|jd|jd S)z2Return a formatted string of the cache statistics.rz , z: z hits, z misses, z total requested bytes)r!r"rr#r0r&r&r' _log_statsUs&zBaseCache._log_statscCs@d|jjd|jd|jd|jd|jd|jd|jdS) Nz ) __class____name__rr rr!r"r#r0r&r&r'__repr__\szBaseCache.__repr__Nrrrrrrrrr)r*r+r*rr,rr)rr2) r6 __module__ __qualname____doc__r__annotations__r(r/r1r4r7r&r&r&r'r*s    rcsTeZdZdZdZ  d d!fdd Zd"ddZd#ddZd$ddZd%ddZ Z S)& MMapCachezmemory-mapped sparse file cache Opens temporary file, which is filled blocks-wise when data is requested. Ensure there is enough disc space in the temporary location. This cache method might only work on posix mmapNrrrrrlocation str | Noneblocksset[int] | Nonerrcs8t||||durtn||_||_||_dSN)superr(setrCrA _makefilecache)r%rrrrArCr5r&r'r(tszMMapCache.__init__mmap.mmap | bytearraycCsddl}ddl}|jdkrtS|jdustj|jsB|jdur*|}t |_ nt |jd}| |jd| d|nt |jd}|||jS)Nrzwb+1zr+b)r@tempfiler bytearrayrAospathexists TemporaryFilerGrCopenseekwriteflushfileno)r%r@rNfdr&r&r'rHs       zMMapCache._makefiler)r*endr,c sttd|d||durd}|durj}|jks!||kr#dS|j}|j}t||d}fdd|D}jtfdd|D7_tt|d d d D][\}}t t t d|}|dj} t |d jjj} j | | 7_ td |dd|d d| d| d | | j| | <j|jt|7_qWj||S)NzMMap cache fetching -rr-rLc3s|] }|jvr|VqdSrErC.0ir0r&r' z#MMapCache._fetch..c3s|] }|jvrdVqdS)rLNr\r]r0r&r'r`racSs|d|dS)NrrLr&)xr&r&r'sz"MMapCache._fetch..)keyzMMap get blocks z ())loggerdebugrrranger!sumr enumeratetuplemaprminr#rrIrCupdater"len) r%r)rZ start_block end_block block_rangeneed__blockssstartsendr&r0r'r/s0    $ zMMapCache._fetchdict[str, Any]cCs|j}|d=|S)NrI)__dict__copyr%stater&r&r' __getstate__s zMMapCache.__getstate__r}cCs|j|||_dSrE)rzrorHrIr|r&r&r' __setstate__s zMMapCache.__setstate__)NN) rrrrrrrArBrCrDrr)rrKr)r*rZr*rr,rryr}ryrr) r6r;r<r=rr(rHr/r~r __classcell__r&r&rJr'r?is  .r?c0eZdZdZdZdfd d ZdddZZS)ReadAheadCachea!Cache which reads only when we get beyond a block of data This is a much simpler version of BytesCache, and does not attempt to fill holes in the cache or keep fragments alive. It is best suited to many small reads in a sequential order (e.g., reading lines from a file). readaheadrrrrrrrcs&t|||d|_d|_d|_dS)Nr-r)rFr(rIr)rZr$rJr&r'r(s zReadAheadCache.__init__r)r*rZr,cCs>|durd}|dus||jkr|j}||jks||krdS||}||jkr?||jkr?|jd7_|j||j||jS|j|krK|jkrhnn|jd7_|j||jd}|t|8}|j}n |jd7_d}t|j||j}|j ||7_ | |||_||_|jt|j|_||jd|SNrr-rL) rr)rZr!rIr"rprnrr#r)r%r)rZlpartr&r&r'r/s. zReadAheadCache._fetchr8rr6r;r<r=rr(r/rr&r&rJr'rs rcr)FirstChunkCachezCaches the first block of a file only This may be useful for file types where the metadata is stored in the header, but is randomly accessed. firstrrrrrrrcs&||kr|}t|||d|_dSrE)rFr(rIr$rJr&r'r(s zFirstChunkCache.__init__r)r*rZr,cCs*|pd}||jkrtddSt||j}||jkr|jdurW|jd7_||jkrG|j|7_|d|}|d|j|_||dS|d|j|_|j|j7_|j||}||jkrv|j||j7_|||j|7}|j d7_ |S|jd7_|j||7_|||S)Nrz,FirstChunkCache: requested start > file sizer-rL) rrgrhrnrrIr"r#rr!)r%r)rZdatarr&r&r'r/s0          zFirstChunkCache._fetchr8rrr&r&rJr'rs rcsheZdZdZdZ d#d$fd d ZddZd%ddZd&ddZd'ddZ d(fdd Z d)d!d"Z Z S)* BlockCachea Cache holding memory as a set of blocks. Requests are only ever made ``blocksize`` at a time, and are stored in an LRU cache. The least recently accessed block is discarded when more than ``maxblocks`` are stored. Parameters ---------- blocksize : int The number of bytes to store in each block. Requests are only ever made for ``blocksize``, so this should balance the overhead of making a request against the granularity of the blocks. fetcher : Callable size : int The total size of the file being cached. maxblocks : int The maximum number of blocks to cache for. The maximum memory use for this cache is then ``blocksize * maxblocks``. blockcache rrrrr maxblocksrrcs<t|||t|||_||_t||j|_ dSrE) rFr(mathceilr r functools lru_cache _fetch_block_fetch_block_cachedr%rrrrrJr&r'r(FszBlockCache.__init__cC |jSz The statistics on the block cache. Returns ------- NamedTuple Returned directly from the LRU Cache used internally. r cache_infor0r&r&r'rN zBlockCache.cache_inforycCs|j}|d=|S)Nrrzr|r&r&r'r~YszBlockCache.__getstate__r}cCs&|j|t|d|j|_dS)Nr)rzrorrrrr|r&r&r'r^s   zBlockCache.__setstate__r)r*rZr,cCst|durd}|dur |j}||jks||krdS||j}||j}t||dD]}||q)|j||||dS)Nrr-rLstart_block_numberend_block_number)rrrir _read_cache)r%r)rZrr block_numberr&r&r'r/ds    zBlockCache._fetchrcst||jkrtd|d|jd||j}||j}|j||7_|jd7_td|t||}|S)= Fetch the block of data for `block_number`. 'block_number=(' is greater than the number of blocks (rfrLzBlockCache fetching block %d) r ValueErrorrr#r"rginforFr/)r%rr)rZblock_contentsrJr&r'r{s    zBlockCache._fetch_blockrrc C||j}||j}|jd7_||kr ||}|||S|||dg}|t|jt|d||||d|d|Sz Read from our block cache. Parameters ---------- start, end : int The start and end byte positions. start_block_number, end_block_number : int The start and end block numbers. rLNr-rr!rextendrmriappendjoin r%r)rZrr start_posend_posblockoutr&r&r'rs     zBlockCache._read_cacher rrrrrrrrrrrrr)rrrr, r)rrZrrrrrrr,) r6r;r<r=rr(rr~rr/rrrr&r&rJr'r-s  rcsHeZdZUdZdZded< ddfdd ZdddZdddZZ S) BytesCacheaKCache which holds data in a in-memory bytes object Implements read-ahead by the block size, for semi-random reads progressing through the file. Parameters ---------- trim: bool As we read more data, whether to discard the start of the buffer when we are more than a blocksize ahead of it. r,rrTrrrrrtrimboolrrcs,t|||d|_d|_d|_||_dS)Nr-)rFr(rIr)rZr)r%rrrrrJr&r'r(s  zBytesCache.__init__r)r*rZcCs|durd}|dur |j}||jks||krdS|jdurC||jkrC|jdurC||jkrC||j}|jd7_|j||||S|jrPt|j||j}n|}||ks[||jkr]dS|jdusg||jkr|jdusq||jkr|j||7_|jd7_| |||_||_n|jdusJ|jdusJ|jd7_||jkr|jdus|j||jkr|j||7_| |||_||_nb|j|j|7_| ||j}||_||j|_nG|jdur)||jkr)|j|jkrn4||j|jkr|j||7_| |||_||_n|j||j7_| |j|}|j||_|jt |j|_||j}|j||||}|j rk|j|j|jd}|dkrk|j|j|7_|j|j|d|_|Sr) rr)rZr!rIrrnr#r"rrpr)r%r)rZoffsetbendnewrnumr&r&r'r/sn          zBytesCache._fetchcCs t|jSrE)rprIr0r&r&r'__len__s zBytesCache.__len__)T) rrrrrrrrrrr)rr) r6r;r<r=rr>r(r/rrr&r&rJr'rs   IrcsDeZdZUdZdZded<    ddfdd ZdddZZS)AllBytesz!Cache entire contents of the fileallrrNrr*rFetcher | Nonerr bytes | NonerrcsNt||||dur"|jd7_|j|j7_|d|j}||_dS)NrLr)rFr(r"r#rrr)r%rrrrrJr&r'r( s  zAllBytes.__init__r)r+r,cCs|jd7_|j||S)NrL)r!rr.r&r&r'r/.szAllBytes._fetch)NNNN) rr*rrrr*rrrrr9 r6r;r<r=rr>r(r/rr&r&rJr'rs  rcsDeZdZUdZdZded<  ddfdd Zdfdd ZZS)KnownPartsOfAFilea Cache holding known file parts. Parameters ---------- blocksize: int How far to read ahead in numbers of bytes fetcher: func Function of the form f(start, end) which gets bytes from remote as specified size: int How big this file is data: dict A dictionary mapping explicit `(start, stop)` file-offset tuples with known bytes. strict: bool, default True Whether to fetch reads that go beyond a known byte-range boundary. If `False`, any read that ends outside a known part will be zero padded. Note that zero padding will not be used for reads that begin outside a known byte-range. partsrrNTrrrrrr&Optional[dict[tuple[int, int], bytes]]strictrrurc st|||||_|rdt|}|dg}||dg} |ddD]3\} } |d\} } | | krH| | f|d<| d|| | f7<q&|| | f| || | fq&tt|| |_ dSi|_ dS)NrrLre) rFr(rsortedkeyspoprdictzipr)r%rrrrrru old_offsetsoffsetsrCr)r+start0stop0rJr&r'r(Ls      zKnownPartsOfAFile.__init__r)r*r+rr,cs:|durd}|dur |j}d}|jD]J\\}}}||kr$|kr^nq||}|||||}|jrC||krA|krZnn|d||t|7}|jd7_|S|}nq|jdurntd||fdt d||fdt d|d ||j ||7_ |j d7_ |t||S) Nrr-rLz&Read is outside the known file parts: z. z%. IO/caching performance may be poor!z!KnownPartsOfAFile cache fetching r[)rritemsrrpr!rrwarningswarnrgrhr#r"rFr/)r%r)r+rloc0loc1roffrJr&r'r/js2 zKnownPartsOfAFile._fetch)NT) rrrrrrrrrrrurr9rr&r&rJr'r3s  rc@sTeZdZdZGdddeZdd d d Zd!ddZd"ddZd#ddZ d$ddZ dS)% UpdatableLRUzg Custom implementation of LRU cache that allows updating keys Used by BackgroudBlockCache c@s.eZdZUded<ded<ded<ded<dS)UpdatableLRU.CacheInforhitsmissesmaxsizecurrsizeN)r6r;r<r>r&r&r&r' CacheInfos  rfuncCallable[P, T]max_sizerrrcCs0t|_||_||_d|_d|_t|_ dSr) collectionsr_cache_func _max_size_hits_misses threadingLock_lock)r%rrr&r&r'r(s zUpdatableLRU.__init__argsP.argskwargsP.kwargsrcOs|r td||j&||jvr-|j||jd7_|j|WdSWdn1s7wY|j|i|}|j,||j|<|jd7_t|j|j krk|jj ddWd|SWd|S1svwY|S)Nz Got unexpected keyword argument rLFlast) TypeErrorrrr move_to_endrrrrprpopitem)r%rrresultr&r&r'__call__s.     zUpdatableLRU.__call__rrcGs4|j ||jvWdS1swYdSrE)rr)r%rr&r&r' is_key_cacheds$zUpdatableLRU.is_key_cachedrcGsd|j%||j|<t|j|jkr |jjddWddSWddS1s+wYdS)NFr)rrrprr)r%rrr&r&r'add_keys "zUpdatableLRU.add_keyrcCsH|j|j|jt|j|j|jdWdS1swYdS)N)rrrr)rrrrprrrr0r&r&r'rs$zUpdatableLRU.cache_infoN)r)rrrrrr)rrrrrr)rrrr)rrrrrrrr) r6r;r<r=r rr(rrrrr&r&r&r'rs    rcsveZdZUdZdZded< d(d)fdd Zd*ddZd+ddZd,ddZ d-ddZ d.d/fd"d# Z d0d&d'Z Z S)1BackgroundBlockCachea Cache holding memory as a set of blocks with pre-loading of the next block in the background. Requests are only ever made ``blocksize`` at a time, and are stored in an LRU cache. The least recently accessed block is discarded when more than ``maxblocks`` are stored. If the next block is not in cache, it is loaded in a separate thread in non-blocking way. Parameters ---------- blocksize : int The number of bytes to store in each block. Requests are only ever made for ``blocksize``, so this should balance the overhead of making a request against the granularity of the blocks. fetcher : Callable size : int The total size of the file being cached. maxblocks : int The maximum number of blocks to cache for. The maximum memory use for this cache is then ``blocksize * maxblocks``. backgroundrrrrrrrrrrrcsZt|||t|||_||_t|j||_t dd|_ d|_ d|_ t |_dS)NrL max_workers)rFr(rrr rrrrr_thread_executor_fetch_future_block_number _fetch_futurerr_fetch_future_lockrrJr&r'r(s zBackgroundBlockCache.__init__rcCrrrr0r&r&r'rrzBackgroundBlockCache.cache_inforycCs(|j}|d=|d=|d=|d=|d=|S)Nrrrrrrr|r&r&r'r~sz!BackgroundBlockCache.__getstate__cCsD|j|t|j|d|_tdd|_d|_d|_t |_ dS)NrrLr) rzrorrrrrrrrrrr|r&r&r'rs  z!BackgroundBlockCache.__setstate__r)r*rZr,c Cs|durd}|dur |j}||jks||krdS||j}||j}d}d}|jM|jduro|jdus6J|jrRtd|j |j |jd|_d|_nt ||jko]|kn}|ro|j}|j}d|_d|_Wdn1sywY|durtd|j | |t ||dD]}||q|d} |j%|jdur| |j kr|j| s| |_|j|j| d|_Wdn1swY|j||||dS)Nrr-z3BlockCache joined background fetch without waiting.z(BlockCache waiting for background fetch.rLasyncr)rrrrrdonergrrrrrrir rrsubmitrr) r%r)rZrrfetch_future_block_number fetch_future must_joinrend_block_plus_1r&r&r'r/sv            zBackgroundBlockCache._fetchsyncrlog_infor2csv||jkrtd|d|jd||j}||j}td|||j||7_|jd7_t||}|S)rrrrfz!BlockCache fetching block (%s) %drL) r rrrgrr#r"rFr/)r%rr r)rZrrJr&r'res   z!BackgroundBlockCache._fetch_blockrrc Crrrrr&r&r'rws     z BackgroundBlockCache._read_cacherrrrr:r)r )rrr r2rr,r)r6r;r<r=rr>r(rr~rr/rrrr&r&rJr'rs   Lrz!dict[str | None, type[BaseCache]]cachesFclstype[BaseCache]clobberrrrcCs6|j}|s|tvrtd|dt||t|<dS)z'Register' cache implementation. Parameters ---------- clobber: bool, optional If set to True (default is False) - allow to overwrite existing entry. Raises ------ ValueError zCache with name z is already known: N)rr r)r rrr&r&r'register_caches  r)F)r rrrrr)2 __future__rrrloggingrrPrrconcurrent.futuresrr itertoolsroperatorrtypingrrr r r r r rrr@typing_extensionsrrr getLoggerrgrr,rrr?rrrrrrrrr r>rcr&r&r&r's^  ,    ?h.. ee<Q