rhDddlZddlZddlZddlZddlmZddlZddlZddlm Z ddl Z ddl Z ddl Z ddlZddlmZGddZGddZd ej&ej(ddd d d ddd ddd fdZy)N) ThreadPool)Queue) get_invlistcdeZdZdZ ddZdZdZdZdZdZ dZ d Z d Z d Z d Zd ZdZy)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) c*||_g|_||_||_||_t j |j}t jt||||_ dgdz|_ tjx|_ |_y)N)keep_maxr)verbosetictocxqindex use_float16faissis_similarity_metric metric_type ResultHeaplenrht_accutime t_displayt0)selfrr kr rr s q/var/www/html/ai-insurance-compliance-backend/venv/lib/python3.12/site-packages/faiss/contrib/big_batch_search.py__init__zBigBatchSearcher.__init__sy   &--e.?.?@""3r7AAcAg #'99;.c6tj|_yN)r t_accu_t0rs r start_t_accuzBigBatchSearcher.start_t_accu0srcp|j|xxtj|jz z cc<yr )rrr!)rns r stop_t_accuzBigBatchSearcher.stop_t_accu3s# A$))+66rcv|tjf|_|jdkDrt|ddyy)Nr Tendflush)rr r print)rnames rticzBigBatchSearcher.tic6s1TYY[) <>C+??  IIK$'' ! #wis!DJJ$4$4#56 KKN3/x As7KLKKN3'uT[[^C,@A{{1~c*+ As+,%%a 0@0@.@!A#.Fq.HIJK))+,  .* rc|jdd}t|j}tj||j j fd}td||D]`}t|||z}|j jj|j|||j j \}}||||b|j||_ y)Nzcoarse quantizationiint32)dtyper) r.rr npemptyrnproberangemin quantizersearchr2q_assign)rbsnqrNi0i1q_dis_i q_assign_is rcoarse_quantizationz$BigBatchSearcher.coarse_quantizationWs &'  \88R!2!237C2r" )BRb!B"&**"6"6"="=2 1 1#3 GZ)HRO  )    rc|jd|j}|dz }tj|j|jj dzd|_|jj|_|jdkDrtd|j d|j dd|_|`|jy)Nz bucket sortr4)nbucketntrz number of -1s:) r.rNrmatrix_bucket_sort_inplacerr= bucket_limsravel query_idsr r,r2)rrNs rreorder_assignzBigBatchSearcher.reorder_assignes ==A  ;; MM4::#3#3a#7B@,,. <>"R(wwx    %//55a88D YY[$U^^Q7$    #::z(BlockComputer.__init__..sAFF9$5rFTz index type z not supportedr)r __class__r IndexIVFFlat IndexFlatdr IndexIVFPQIndexPQpqMnbitsdecode is_trainedraIndexIVFScalarQuantizerIndexScalarQuantizersqqtype RuntimeError index_helprdmethodpairwise_distancesknn)rrrrrrrdras rrzBlockComputer.__init__si ??e00 0%2C2CDJ5KK __ 0 0 0UXX^^U5F5FHJ!HHJM$--..K$(J !++K __ = = =33):):TYY!^LA!t [[G #  & &tT__-B-B C%(]DOO "??))$2DAq!t [[0 0''d;'GAA!t [[N *488D$L+LLDAq!t rN) rrrrrrrrrrrrrrs%) "$77 !FrrrFr4i ryc   123j}|dvsJ|j}t||ztjdj z}t|ztjdj tjdj zz}||z|z}|dkDr)t jd|d|d|d |d |d z d d t|||1t|||22j1_ 2j1_ | 1jn| 1_ 1j| j}t!}| ||fdjfk(sJt"j$j'| rKt jd| 1j)| }t jdt|nt jd|dk(rt+||D]}1j-|1j/|\}}}}t1j0}2j3|||\}}1j4dxxt1j0|z z cc<1j7||||n|dk(r1fd}1j/|} d}!t9d}"t+||D]}1j-||"j;||!|dzf}#| \}}}}1j=2j3|||\}}1j?d||||f}!1j=|#jA} 1j?d1j6|!|"jCnd33fd}$d"1fd }%2 fd}&tEd}'tEd}(|$|& d t!|(|'})|$|%| ||||'d}*t1j0}+ t jd|(jA},|,sn|,\}-}.}/}0}}}}|-|k(rddz 1j4dxx|0z cc<1j4dxx|.z cc<1j4dxx|/z cc<t jd|-1j7||||t jd|-|jG|-1j-|-| Ut1j0|+z | kDr;t jd 1jI| |t1j0}+B|*jK|)jK1jMd!1jNjQ1jS1jNjT1jNjVfS)#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 scratchr5r4ch|j||jkrj|Sy)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_prefetchas<!'''05;;))!,,rr9c  t|5}t||Dcgc]}||vr|j||||f} }| D]} | j|j |j ddd|j dycc}w#1swY xYw#tjtjxYw)N)args) rrJ apply_asyncgetclosejoinput traceback print_exc_threadinterrupt_main) task pool_size start_taskend_taskrx output_queue input_queuepooliresrs rtask_manager_threadz-big_batch_search..task_manager_thread~s  *  d"'z8!</I-  ++{;,=/C/ !  JJLIIK    &/    ##%&&(s2 B!B!B9B6B!BBB!!+C cdtj|}d|_|j|S)N)targetrT) threadingThreaddaemonstart)r task_managerrs rrz&big_batch_search..task_managers5$++*L#'L      rc tjd|j|\}}}}|j|||||ftjd|y#t j t jxYw)NzPrepare start: z Prepare end: )logginginforlrrrrr)task_idrrrfrgrirjrs r prepare_taskz&big_batch_search..prepare_tasks  wi89141C1CG1L.$$  '8T8T!JK }WI67 ##%&&(s AA +B c b tjd|d} tj}tjd||j}tj|z }||j dn|\}}} } } tjd|d|tj}dkDrj | | | |\} } nj | | | \} } tj|z }tjd|d|tj}|j |||||| | | ftj|z }Ltjd |y#t jtjxYw) NzCompute start: rzCompute 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  wi89 BLL#7y!AB"-//"3K $ b 0I"*#-?J$>>J"gk "" ((9  & & 'GJ&0G{ {m8J<@YggYc'U2CC1H N  r1 C  -   D&&CO&&CO ! ;;IH%!U[[)9999 77>>* % LL2:,? @++J7I LL1#i.1AB C LL? @1}z8, >A JJqM-0-?-?-B *HdHd))+C$$T41=DAq JJqMTYY[3. .M  # #Ha1 =  > Q - ..z:!}z8, A JJqM"&"2"2(61q5/#; -> *HdHd    $$T41=DAq OOA q(A-F     3 7 7 9  OOA   (  4  ! F$)8 %a+    E ! $  ,      $  yy{  LL- .)--/ESX PHiY!Xq8#A JJqMY &M JJqMY &M JJqMZ 'M LL:8*E F  # #Ha1 = LL8 C D MM( # JJx %99;-?LL!56((Y?#'99;L+. !!#!!#GGOFFOOGGI 6688SVVXX r)rr{r}rmultiprocessing.poolrrrqueuerrr>numpyrGrfaiss.contrib.inspect_toolsrrrrrrrrrrs  + 3X X v55t 33 IIYr