gDddlZddlZddlZddlZddlmZddlZddlZddlm Z ddl Z ddl Z ddl Z ddlZddlmZGddZGddZd ejejddd d d ddd ddd fdZdS)N) ThreadPool)Queue) get_invlistcfeZdZdZ ddZdZdZdZdZd Z d Z d Z d Z d Z dZdZdZdS)BigBatchSearcherz Object that manages all the data related to the computation except the actual within-bucket matching and the organization of the computation (parallel or not) rFc$||_g|_||_||_||_t j|j}t jt||||_ dgdz|_ tj x|_ |_dS)N)keep_maxr)verbosetictocxqindex use_float16faissis_similarity_metric metric_type ResultHeaplenrht_accutime t_displayt0)selfrr kr rr s \/var/www/html/mpstechhub/venv/lib/python3.11/site-packages/faiss/contrib/big_batch_search.py__init__zBigBatchSearcher.__init__s   &-e.?@@"3r77AAAAcAg #'9;;.c6tj|_dSN)r t_accu_t0rs r start_t_accuzBigBatchSearcher.start_t_accu0srcb|j|xxtj|jz z cc<dSr )rrr!)rns r stop_t_accuzBigBatchSearcher.stop_t_accu3s+ A$)++66rcx|tjf|_|jdkrt|dddSdS)Nr Tendflush)rr r print)rnames rticzBigBatchSearcher.tic6sDTY[[) C+??? F IKK$' !  . 7 . . . .DJ$4 . . KN M . .8< A M . .KN B . .-1[^ B . .{1~ , . . A -  . . %a 0@.@!A#.Fq.HIII  . . )++  . .** rc|dd}t|j}tj||jjfd}td||D]V}t|||z}|jj |j|||jj\}}||||<W| ||_ dS)Nzcoarse quantizationiint32)dtyper) r.rr npemptyrnproberangemin quantizersearchr2q_assign)rbsnqrNi0i1q_dis_i q_assign_is rcoarse_quantizationz$BigBatchSearcher.coarse_quantizationWs &'''  \\8R!237CCC2r"" ) )BRb!!B"&*"6"="=2 1#3#3 GZ)HRUOO    rc|d|j}|dz }tj|j|jjdzd|_|j|_|j dkrtd|jd|jdd|_|`| dS)Nz bucket sortr4)nbucketntrz number of -1s:) r.rNrmatrix_bucket_sort_inplacerr= bucket_limsravel query_idsr r,r2)rrNs rreorder_assignzBigBatchSearcher.reorder_assignes =A  ; M4:#3a#7B@@@,,.. "R%(wx    9%/55a888D Y[[$U^Q77$   #::<t|d5}tj|}dddn #1swxYwY|d|ksJ|dd|jjdd<|dd|jjdd<|dS)Nrbrwrrr4rx)rzr{loadrtrrorp)rrrckps rread_checkpointz BigBatchSearcher.read_checkpoints %   !!+a..C ! ! ! ! ! ! ! ! ! ! ! ! ! ! !7|t779999994y| !!! 4y| !!! ;s 266N)rF)__name__ __module__ __qualname____doc__rr#r&r.r2rCrUr^rlrqrtrrrrrrs ////$%%%777... %%%* ! ! !   ...8 + + +DDD # # #     rrc:eZdZdZdejejfdZdZdS) BlockComputerz computation within one bucket knn_functionc||_|jtjkr%tj|j|j}d}d}n|jtjkr\tj|j|j j |j j |j}|j |_ |j j }d|_ |j}n~|jtjkrQtj|j|jj|j}|j|_|jj }d|_ |j}nt'd|jd||_|dkrdn||_||_||_||_||_dS)Nc,|dS)Nfloat32)view)xs rz(BlockComputer.__init__..sAFF9$5$5rFTz index type z not supportedr)r __class__r IndexIVFFlat IndexFlatdr IndexIVFPQIndexPQpqMnbitsdecode is_trainedraIndexIVFScalarQuantizerIndexScalarQuantizersqqtype RuntimeError index_helprdmethodpairwise_distancesknn)rrrrrrrdras rrzBlockComputer.__init__sP ?e0 0 0%2CDDJ55KKK _ 0 0 0UX^U5FHHJ!HJM$-.K$(J !+KK _ = = =3):<>TY!^^LA [G # #  &tT_-B C C C%(]]DO "?))$22DAqq [0 0 0''d;'GGAAA [N * *48D$LL+LLLDAq!t rN) rrrrrrrrrrrrrrsN)) "$7 !!!!FrrrFr4i ryc   123j}|dvsJ|j}t||ztjdjz}t|ztjdjtjdjzz}||z|z}|dkr(t jd|d|d|d |d |d z d d t|||1t|||22j 1_ 2j 1_ | 1 n| 1_ 1|j}t!}| ||fdjfksJt"j| rQt jd| 1| }t jdt|nt jd|dkrt+||D]}1|1|\}}}}t1j}2|||\}}1jdxxt1j|z z cc<1||||n |dkr1fd}1|} d}!t9d}"t+||D]}1||"||!|dzf}#| \}}}}12|||\}}1d||||f}!1|# } 1d1j|!|"!nd33fd}$d#1fd }%2 fd}&tEd}'tEd}(|$|& d t!|(|'})|$|%| ||||'d}*t1j}+ t jd|( },|,sn |,\}-}.}/}0}}}}|-|krddz 1jdxx|0z cc<1jdxx|.z cc<1jdxx|/z cc<t jd|-1||||t jd |-|#|-1|-| Wt1j|+z | kr=t jd!1$| |t1j}+L|*%|)%1&d"1j'(1)1j'j*1j'j+fS)$a Search queries xq in the IVF index, with a search function that collects batches of query vectors per inverted list. This can be faster than the regular search indexes. Supports IVFFlat, IVFPQ and IVFScalarQuantizer. Supports three computation methods: method = "index": build a flat index and populate it separately for each index method = "pairwise_distances": decompress codes and compute all pairwise distances for the queries and index and add result to heap method = "knn_function": decompress codes and compute knn results for the queries threaded=0: sequential execution threaded=1: prefetch next bucket while computing the current one threaded=2: prefetch prefetch_threads buckets at a time. compute_threads>1: the knn function will get an additional thread_no that tells which worker should handle this. In threaded mode, the computation is tiled with the bucket perparation and the writeback of results (useful to maximize GPU utilization). use_float16: convert all matrices to float16 (faster for GPU gemm) q_assign: override coarse assignment, should be a matrix of size nq * nprobe checkpointing (only for threaded > 1): checkpoint: file where the checkpoints are stored checkpoint_freq: when to perform checkpoinging. Should be a multiple of threaded start_list, end_list: process only a subset of invlists )rrrrEint64rrzmemory: queries z assign z result z total z = i@r0z GiB)r r)rrrNzrecovering checkpoint: z already completed: z$no checkpoint: starting from scratchr5r4c`| j||jkr|SdS)z` perform the addition for the previous bucket and prefetch the next (if applicable) N)rqr=rl)to_addrAbbsrs radd_results_and_prefetchz2big_batch_search..add_results_and_prefetchasA!''005;))!,,,rr9c t|5  fdt||D}|D]}|  dddn #1swxYwYddS#t jtj xYw)NcLg|] }|v|f!S))args) apply_async).0irx input_queue output_queuepooltasks r zAbig_batch_search..task_manager_thread..sT///I--  ++{;,==.--r) rrJgetclosejoinput traceback print_exc_threadinterrupt_main) r pool_size start_taskend_taskrxrrresrrs ` ``` @rtask_manager_threadz-big_batch_search..task_manager_thread~s4  **  d////////"'z8!.task_managersB$+*L#'L      rc& tjd||\}}}}||||||ftjd|dS#t jt jxYw)NzPrepare start: z Prepare end: )logginginforlrrrrr)task_idrrrfrgrirjrs r prepare_taskz&big_batch_search..prepare_tasks  8w88999141C1CG1L1L.$$  '8T8T!JKKK 6W6677777 #%%%&(((s A"A'')Bc t tjd|d} tj}tjd||}tj|z }||dn|\}}} } } tjd|d|tj}dkr| | | |\} } n| | | \} } tj|z }tjd |d|tj}||||||| | | ftj|z }Xtjd |dS#t jtj xYw) NzCompute start: rTzCompute input: task zCompute work: task z , centroid r4) thread_idzCompute output: task z Compute end: ) rrrrrrrrrr)rrr t_wait_outr input_value t_wait_incentroidrfrgrirjrorp t_computecompcomputation_threadsrs r compute_taskz&big_batch_search..compute_tasks  8w88999 2BL!A!A!ABBB"-//"3"3K $ b 0I"*#---?J>J"ggk " (9   & 'GJ&0G{{  N{ N NJ N N N N&- N N29U2C M N N N    r1   C  -     D&CO&CO !!!! ;IH%!U[)99999 7>>* % % A L?:?? @ @ @++J77I LB#i..BB C C C C L? @ @ @1}}z8,, > >A JJqMMM-0-?-?-B-B *HdHd)++C$$T41==DAq JqMMMTY[[3. .MMM  # #Ha1 = = = =  > Q - - - - - - ..z::!}}z8,,  A JJqMMM"&"2"2(61q5/#;#; -> *HdHd      $$T41==DAq OOA   q(A-F       3 7 7 9 9  OOA    ((    4           ! ! ! ! ! ! ! F$)88 %a+|    EE ! $   ,|      $   y{{  / L- . . .)--//E SX PHiY!Xq8##A JqMMMY &MMM JqMMMY &MMM JqMMMZ 'MMM LE8EE F F F  # #Ha1 = = = LCCC D D D MM( # # # JJx %9;;-??L!5666((Y???#'9;;L+ /. !!###!!###GGOFOOGGIII 68SVX r)rr{r}rmultiprocessing.poolrrrqueuerrr>numpyrGrfaiss.contrib.inspect_toolsrrrrrrrrrrsO  ++++++ 333333X X X X X X X X v55555555t 3 IYYYYYYr