U ,dʔ@s0dZddlZddlmZddlZddlmZddlmZm Z m Z m Z ddl Z edZedZedZeejZeZedZedZedZedZd d Zdd d Zd dZiZdddZifddZGddde Z!Gddde!Z"Gddde!Z#Gddde Z$dddZ%d d!Z&dd"d#Z'd$d%Z(d&d'Z)d(d)Z*dd*d+Z+d,d-Z,d.d/Z-d0d1Z.d2d3Z/d4d5Z0d6d7Z1d8d9Z2d:d;Z3e4dd?Z6eddAdBZ7edCdDZ8eddFdGZ9edHdIZ:ddJdKZ;dLdMZddRdSZ?ddTdUZ@dVdWZAdXdYZBdZd[ZCd\d]ZDeCZEeBZFd^d_ZGd`daZHddbdcZIeddddeZJeHZKdfdgZLdhdiZMdjdkZNdldmZOdndoZPddpdqZQdrdsZRdtduZSddwdxZTdydzZUd{d|ZVd}d~ZWddZXdddZYdddZZddZ[ddZ\ddZ]ddZ^ddZ_ddZ`ddZaddZbdS)z+ Generic helpers for LLVM code generation. N)contextmanager)ir)utilstypesconfig debuginfo cCs|d||dS)N!=r) icmp_unsignedtypebuildervaluer6/tmp/pip-unpacked-wheel-eu7e0c37/numba/core/cgutils.py as_bool_bitsrcCsJ|dkrtdd|D}|tj}t|D]\}}||||}q.|S)zH Create an anonymous struct containing the given LLVM *values*. NcSsg|] }|jqSrr .0vrrr %sz)make_anonymous_struct..rZLiteralStructType Undefined enumerate insert_value)rvaluesZ struct_typeZ struct_valirrrrmake_anonymous_struct s  rcCs*t|}t|}tttd||S)z0 Make a byte array constant from *buf*. r ) bytearraylenrConstant ArrayTypeIntType)bufbnrrrmake_bytearray,sr(rcCsb||f}t|}|dkr^ttd|}|jdt|}|f}t|d}t|||}|t|<|S)zK Returns a specialized StructProxy subclass for the given fe_type. N)rdata_)_fe_type)_struct_proxy_cachegetValueStructProxyDataStructProxy__name__strdictr )Zfe_typekind cache_keyresbaseZclsnamebasesZ clsmembersrrrcreate_struct_proxy8s   r8cCsV|}|jjD]"}||t||}t|||q|D]\}}t|||q<|S)zJ Copy structure from *src* to *dst* with replacement from *repl*. )copy _datamodel_fieldspopgetattrsetattritems)dstsrcreplkrrrr copy_structKs rDcseZdZdZdZd!ddZddZddZd d Zd d Z d dZ ddZ ddZ fddZ ddZddZddZddZddZdd ZZS)" _StructProxyz Creates a `Structure` like interface that is constructed with information from DataModel instance. FE type must have a data model that is a subclass of StructModel. NcCs||_|jj|j|_t|jtjjjs8t d |j||_ | |j|_ t|j rZt||\}}|jj|j krtd|j |jf|dk r|j|jjkrtd|jj|jf|j ||||_||_dS)NzNot a structure model: {0}z!bad ref type: expected %s, got %sz#bad value type: expected %s, got %s)_contextZdata_model_managerr+r: isinstancenumbacore datamodelZ StructModel TypeErrorformat_builder _get_be_type_be_type is_pointerAssertionError _make_refsr pointee as_pointerstore_value _outer_ref)selfcontextrrrefZ outer_refrrr__init__cs,  z_StructProxy.__init__cCs"|dkrt|j|jdd}||fS)z Return an (outer ref, value ref) pair. By default, these are the same pointers, but a derived class may override this. NTzfill) alloca_oncerMrO)rXrZrrrrR|sz_StructProxy._make_refscCstdSNNotImplementedErrorrXrJrrrrNsz_StructProxy._get_be_typecCstdSr_r`rXindexvalrrr_cast_member_to_valuesz"_StructProxy._cast_member_to_valuecCstdSr_r`rcrrr_cast_member_from_valuesz$_StructProxy._cast_member_from_valuecCst|j|jd|SNr) gep_inboundsrMrVrXrdrrr_get_ptr_by_indexsz_StructProxy._get_ptr_by_indexcCs|j|}||Sr_)r:get_field_positionrk)rXattrnamerdrrr_get_ptr_by_names z_StructProxy._get_ptr_by_namecCs&|ds||j|St|dSz; Load the LLVM value of the named *field*. r*N) startswithr:rlAttributeErrorrXfieldrrr __getattr__s z_StructProxy.__getattr__cs0|drtt|||S|||j|<dSz@ Store the LLVM *value* into the named *field*. r*N)rpsuperrE __setattr__r:rlrXrsr __class__rrrws z_StructProxy.__setattr__cCs|j||}|||Sz> Load the LLVM value of the field at *index*. )rMloadrkrf)rXrdZ member_valrrr __getitem__sz_StructProxy.__getitem__cCs||}|||}|j|jjkr|t|jrft|jjrf|jj|jjjkrf|j|j||jjj}nt dj ||||d|j ||dS)C Store the LLVM *value* into the field at *index*. zjInvalid store of {value.type} to {ptr.type.pointee} in {self._datamodel} (trying to write member #{index}))rptrrXrdN) rkrgr rSrPrFZ addrspacecastrM addrspacerKrLrU)rXrdrrrrr __setitem__s"   z_StructProxy.__setitem__cCs|jjSz. Return the number of fields. )r:Z field_countrXrrr__len__sz_StructProxy.__len__cCs|jSzF Return the LLVM pointer to the underlying structure. )rWrrrr _getpointersz_StructProxy._getpointercCs|j|jSzM Load and return the value of the underlying LLVM structure. )rMr|rWrrrr _getvaluesz_StructProxy._getvaluecCs>t|jrt|j|jks*t|j|jf|j||jdS)z4 Store the value in this structure. N)rPr rQrOrMrUrVrXrrrr _setvaluesz_StructProxy._setvalue)NN)r0 __module__ __qualname____doc__r+r[rRrNrfrgrkrnrtrwr}rrrrr __classcell__rrryrrEZs"   rEc@s(eZdZdZddZddZddZdS) r.zl Create a StructProxy suitable for accessing regular values (e.g. LLVM values or alloca slots). cCs|Sr_)Zget_value_typerbrrrrNszValueStructProxy._get_be_typecCs|Sr_rrcrrrrfsz&ValueStructProxy._cast_member_to_valuecCs|Sr_rrcrrrrgsz(ValueStructProxy._cast_member_from_valueNr0rrrrNrfrgrrrrr.sr.c@s(eZdZdZddZddZddZdS) r/zO Create a StructProxy suitable for accessing data persisted in memory. cCs|Sr_)Z get_data_typerbrrrrNszDataStructProxy._get_be_typecCs|j|}||j|Sr_)r: get_modelZ from_datarMrXrdremodelrrrrfs z%DataStructProxy._cast_member_to_valuecCs|j|}||j|Sr_)r:rZas_datarMrrrrrgs z'DataStructProxy._cast_member_from_valueNrrrrrr/sr/csreZdZdZdddZddZdd Zd d Zfd d ZddZ ddZ ddZ ddZ ddZ ddZZS) Structurezs A high-level object wrapping a alloca'ed LLVM structure, including named fields and attribute access. NFc Cs0|||_||_||_|dkrtt||jdd|_|dk rt|jrHt|j|jksdt|j|jf| ||jn\|dkstt|jst|j|jj kr|r| ||j }nt d|jj |jf||_i|_g|_g|_td}t|jD]6\}\}} ||j|<|j|t|f|j| qdS)NTr\z-mismatching pointer type: got %s, expected %sr)Zget_struct_type_typerFrMr^rVrPr rQrUrSbitcastrTrK_namemap_fdmapZ_typemapint32_trr;append) rXrYrrrZZcast_refr6rrCtprrrr[s8    zStructure.__init__cCs|jj|j|j|dd}|S)NT)inbounds)rMgeprVr)rXrdrrrrrk$szStructure._get_ptr_by_indexcCs||j|Sr_)rkr)rXrmrrrrn(szStructure._get_ptr_by_namecCs$|ds||j|St|dSro)rprrqrrrrrrt+s zStructure.__getattr__cs.|drtt|||S|||j|<dSru)rprvrrwrrxryrrrw4s zStructure.__setattr__cCs|j||Sr{)rMr|rkrjrrrr}<szStructure.__getitem__cCsN||}|jj|jkrt|jrt|j|jks*t|j|jf|j||jdS)z!Store the value in this structureN)rPr rQrrMrUrVrrrrraszStructure._setvalue)NNF)r0rrrr[rkrnrtrwr}rrrrrrrrryrrs   rFc Cst|trtt|}t|^|&|j|||d}| |d|W5QRX|rn| |j d||W5QRSQRXdS)aAllocate stack memory at the entry block of the current function pointed by ``builder`` with llvm type ``ty``. The optional ``size`` arg set the number of element to allocate. The default is 1. The optional ``name`` arg set the symbol name inside the llvm IR for debugging. If ``zfill`` is set, fill the memory with zeros at the current use-site location. Note that the memory is always zero-filled after the ``alloca`` at init-site (the entry block). )sizenameN) rGintrr"intp_trZsuspend_emissionZgoto_entry_blockZallocarUr rS)rtyrrr]rrrrr^js    r^cCs$|d}|tdg}||tS)zCompute sizeof using GEP Nr)rrptrtointr)rZptr_typenulloffsetrrrsizeofsrcCs t||j|d}||||S)z Like alloca_once(), but passing a *value* instead of a type. The type is inferred and the allocated slot is also initialized with the given value. r\)r^r rU)rrrr]Zstoragerrralloca_once_values rcCs(t|||}|jd|jd|S)z_ Insert a pure function (in the functional programming sense) in the given module. readonlyZnounwind)get_or_insert_function attributesaddmodulefntyrfnrrrinsert_pure_functions   rcCs(|j|d}|dkr$t|||}|S)zm Get the function named *name* with type *fnty* from *module*, or insert it if it doesn't exist. N)globalsr-rFunctionrrrrrsrcCs0z ||WStk r*||YSXdSr_)Zget_named_metadataKeyErrorZadd_named_metadata)rrrrrget_or_insert_named_metadatas rcCs||}t||||Sr_)Zget_unique_namerZGlobalVariable)rrrrZ unique_namerrradd_global_variables rcCs|j}|jdkr||dSr_) basic_block terminatorbranch)rbbendZbbrrr terminates rcCs|dSr_r)Zltyperrrget_null_valuesrcCst|j}|d||S)N==rr r rrerrrris_nulls rcCst|j}|d||S)Nr rrrrr is_not_nulls rcCs|j|ddS)NFlikelyif_thenrpredrrr if_unlikelysrcCs|j|ddS)NTrrrrrr if_likelysrcCs|||Sr_)rnot_rrrrifnotsrcCs|d}|j||dgdS)z# Increment an index *val*. rZnsw)flags)r r)rreonerrrincrement_indexs rLoop)rddo_breakc #s|dkr|j}|dkr|d}|}d}d}dfdd}j}||0j|dd } d | |} | |W5QRX|,t| |Vj}t | } t |W5QRX| ||| | | dS) a Generate LLVM IR for a for-loop in [start, count). *start* is equal to 0 by default. Yields a Loop namedtuple with the following members: - `index` is the loop index's value - `do_break` is a no-argument callable to break out of the loop Nrfor.condfor.bodyfor.endcsdSr_)rrrrrrrszfor_range..do_break loop.indexr<) r append_basic_blockrr goto_blockphi icmp_signedcbranchrrr add_incomingposition_at_end) rcountstartintpstopbbcondbbbodyrbbstartrdrincrrrr for_ranges.           rTc cs*|dkr|j}|d}|d}|d}|j} ||||R|j|dd} |j|dd} |rx|d| |} n|d | |} || ||W5QRX||6| | fV|j}|| |} t || }t ||W5QRX| || | | || t |d | | ||||dS) a[ Generate LLVM IR for a for-loop based on a slice. Yields a (index, count) tuple where `index` is the slice index's value inside the loop, and `count` the iteration count. Parameters ------------- builder : object IRBuilder object start : int The beginning value of the slice stop : int The end value of the slice step : int The step value of the slice intp : The data type inc : boolean, optional Signals whether the step is positive (True) or negative (False). Returns ----------- None Nrrrrrz loop.countr>r)r rrrrrrrrrrrrr"r)rrrsteprincrrrrrdrrrZ next_countrrrfor_range_slices2            rc cs|j}|d|t|d}t|||||dd}t|||||dd}tdd}|j|dd \} } || ||| |fVW5QRXd S) a A helper wrapper for for_range_slice(). This is a context manager which yields two for_range_slice()-alike context managers, the first for the positive step case, the second for the negative step case. Use: with for_range_slice_generic(...) as (pos_range, neg_range): with pos_range as (idx, count): ... with neg_range as (idx, count): ... >=rT)rFc ss*|| }|VW5QRXW5QRXdSr_r)condZinner_cmrrrrcm_cond`sz(for_range_slice_generic..cm_condrN)r rrr"rrif_else) rrrrrZ is_pos_stepZ pos_for_rangeZ neg_for_rangerZthenZ otherwiserrrfor_range_slice_genericLs rCc csp|dks t|sdVnT|dkr*dd}ndd}t||||$}t|t|ksXt||VW5QRXdS)a Generate a loop nest walking a N-dimensional array. Yields a tuple of N indices for use in the inner loop body, iterating over the *shape* space. If *order* is 'C' (the default), indices are incremented inside-out (i.e. (0,0), (0,1), (0,2), (1,0) etc.). If *order* is 'F', they are incremented outside-in (i.e. (0,0), (1,0), (2,0), (0,1) etc.). This has performance implications when walking an array as it impacts the spatial locality of memory accesses. CFrFcSs|dddS)Nrxrrr~zloop_nest..cSs|Sr_rrrrrrrN)rQ _loop_nestr!)rshaperorderZ_swapindicesrrr loop_nestjs  rc csht||d|dL}t|dkrPt||dd|}|jf|VW5QRXn |jfVW5QRXdS)Nrrr)rr!rrd)rrrlooprrrrrs  rcCsPt|}|dkr|dj}t||tj}t|D]\}}||||}q4|S)z Pack a sequence of values in a LLVM array. *ty* should be given if the array may be empty, in which case the type can't be inferred from the values. Nr)r!r rr#rrr)rrrr'aryrrrrr pack_arrays rcCsBtdd|D}|tj}t|D]\}}||||}q&|S)z7 Pack a sequence of values into a LLVM struct. cSsg|] }|jqSrrrrrrrszpack_struct..r)rrZstructtystrrrrr pack_structs  rcs0|dkrtjj}fddt|D}|S)zH Unpack an array or structure of values, return a Python tuple. Ncsg|]}|qSr) extract_value)rrrtuprrrsz unpack_tuple..)r!r elementsrange)rrrvalsrrr unpack_tuples   r c CsBt||j|jd}t||j|jd}t|||j|||j|||d S)N)r)r)rstrideslayoutinds wraparound boundscheck)r rndimr get_item_pointer2r)r ) rYrZarytyrr rrZshapesr rrrget_item_pointers rc sfdd}d}d}t|$tjr<||jt|fW5QRXdd}t|$tjr||jt|fW5QRXdS)NcsLdk r:ttr(tdqHtdntddS)NzFdebug: IndexError: index %d is out of bounds for axis {} with size %d zFdebug: IndexError: index %d is out of bounds for axis %d with size %d z9debug: IndexError: index %d is out of bounds for size %d )rGrprintfrLraxisrdimlenindrr_dbgs$ zdo_boundscheck.._dbgzindex is out of boundsrrr)rrrZFULL_TRACEBACKS call_convreturn_user_exc IndexErrorr ) rYrrrrrmsgZout_of_bounds_upperZout_of_bounds_lowerrrrdo_boundschecks  rc s|rVg} t||D]@\} } d| | d} | | } | | | }| |qn|} |rtt| |D]\}\} } t|| | |ql| s|t dgS| dj}|dkrg}|dkr t t |D]8}|d}||ddD]} ||}q||qnZ|dkr\t t |D]8}|d}|d|D]} ||}q8||q nt d|d}t| |D]"\}} ||}||}qv||g}|Sfdd t|| D}tj|}t||SdS) NrrrrrrZ unreachablecsg|]\}}||qSr)mul)rsrrrrrsz%get_item_pointer2..)ziprr rselectrrrrrrr!r Exception functoolsreduce pointer_add)rYrr)rr r r rrrrrnegativewrappedselectedrrZstepsrlastjlocrtmprZdimoffsrrr rrsL      rcCs\|d}t|jtjtjfr*|||}n.t|jtjrH||||}ntd|jf|S)Nrzunexpected value type %s)r rGrZ FloatTypeZ DoubleTyper$rrK)rrZfpredZicondZnullvalZisnullrrr_scalar_pred_against_zeros  r.cCst||t|jddS)zK Return a predicate representing whether *value* is equal to zero. rr.r$partialZ fcmp_orderedrrrris_scalar_zero%s  r1cCst||t|jddS)z Return a predicate representing whether a *value* is not equal to zero. (not exactly "not is_scalar_zero" because of nans) r r.r$r0Zfcmp_unorderedrrrris_not_scalar_zero-s  r3cCst||t|jddS)z] Return a predicate representing whether *value* is equal to either zero or NaN. rr2rrrris_scalar_zero_or_nan6s  r4cCst||t|jddS)z: Is *value* negative? Assumes *value* is signed. rr/rrrr is_scalar_negCs  r5c CsL|jt||dd.|d}|ddp,d}|j|||W5QRXdS)zu Guard against *value* being null or zero. *exc_tuple* should be a (exception type, arguments...) tuple. FrrrN)rr1rr)rYrrZ exc_tupleexcexc_argsrrr guard_nullKsr8c CsZt|jtjst|j|r"|fnd}|jt||dd|j|t |W5QRXdS)zG Guard against *pointer* being NULL (and raise a MemoryError). rFrN) rGr r PointerTyperQrrrr MemoryError)rYrpointerrr7rrrguard_memory_errorVsr<c cs*|jt|||d dVW5QRXdS)z> Execute the given block if the scalar value is zero. rN)rr1)rrrrrrif_zero`sr=cCs t|tjS)z7 Whether the LLVM type *typ* is a struct type. )rGrr9)ZltyprrrrPlsrPcCs.t||d|}t|jjrt|||Srh)rirPr rSrQrrT)rrecordrtypZpvalrrrget_record_memberssr@cCs|d||dS)Nrr)rr )rrerrr is_neg_intysrAcOst||f|ddi|S)z8 Same as *gep*, but add the `inbounds` keyword. rT)r)rrr kwsrrrri}sric Osb|dd}|dd}|r tg}|D]&}t|tr@t|}n|}||q(|j||||dS)z Emit a getelementptr instruction for the given pointer and indices. The indices can be LLVM values or Python int constants. rrrF)rr)r<rQrGrrrr) rrr rBrridxrrrrrrs     rcCs<||t}t|trt|}|||}|||p8|jS)z Add an integral *offset* to pointer *ptr*, and return a pointer of *return_type* (or, if omitted, the same type as *ptr*). Note the computation is done in bytes, and ignores the width of the pointed item type. )rrrGrrZinttoptrr )rrr return_typeZintptrrrrr&s    r&cCsN|jdt|jf}||t}t|tr2t|}|||||t dgdS)z= Fill *size* bytes starting from *ptr* with *value*. z llvm.memsetrN) rdeclare_intrinsic voidptr_tr rrGrint8_tcallbool_t)rrrrrrrrmemsets   rJcCs0||}t||t||jd|||dS)z7 Fill padding bytes of the pointee with zeros. rN)r|rJrr rU)rrrerrrmemset_paddings rKinternalcCs<t|tjr|}n|j}t||j|}||_d|_||_|S)zO Get or create a (LLVM module-)global constant with *name* or *value*. T) rGrModulerrr linkageglobal_constantZ initializer)Zbuilder_or_modulerrrNrr)rrrrOs rOc Cs|dks t||}|d}t||j}|t||n\}}||||}|||W5QRX|2|||}|||}|||||W5QRXW5QRX| |}||| ||} || fS)a  Compute the (quotient, remainder) of *val* divided by the constant positive *divisor*. The semantics reflects those of Python integer floor division, rather than C's / LLVM's signed division and modulo. The difference lies with a negative *val*. rr) rQr r^rrAZsdivrUrsubr|r) rreZdivisorrquotZif_negZif_posZquot_valZ val_plus_oneZrem_valrrrdivmod_by_constants       ( rRcCs&|d}|||||||S)z Branch conditionally or continue. Note: a new block is created and builder is moved to the end of the new block. z .continue)rrr)rrZbbtrueZbbcontrrrcbranch_or_continues  rSc Csb|j|jkstt|||jd8}|||jg}|||jg}||||W5QRXdS)z Emit a memcpy to the builder. Copies each element of dst to src. Unlike the C equivalent, each element can be any LLVM type. Assumes ------- * dst.type == src.type * count is positive rN)r rQrrrdrUr|)rr@rArrZout_ptrZin_ptrrrrmemcpys rTc Csd|j}t|trt||}|j|tt|g}t} | || |t| |t| ||| gdSr_) r rGrrr"rrErF false_bitrHrr) r func_namer@rAritemsizealignZsize_trTZ is_volatilerrr _raw_memcpy s    rYcCst|d|||||S)za Emit a raw memcpy() call for `count` items of size `itemsize` from `src` to `dest`. z llvm.memcpyrYrr@rArrWrXrrr raw_memcpysr\cCst|d|||||S)zb Emit a raw memmove() call for `count` items of size `itemsize` from `src` to `dest`. z llvm.memmoverZr[rrr raw_memmove#s r]c CsX|||}||d}||d}|||}||d}||||d} || fS)zq Compute (a * b + c) and return a (result, overflow bit) pair. The operands must be signed integers. rr)Zsmul_with_overflowrZsadd_with_overflowor_) rar&cpprodZprod_ovfrr5Zovfrrrmuladd_with_overflow,s     rcc Gst|tst|j}t}t|dd}t|d|}tj t |gdd}z| d}Wn$t k rztj ||dd}YnX|||} ||| gt|S)a Calls printf(). Argument `format` is expected to be a Python string. Values to be printed are listed in `args`. Note: There is no checking to ensure there is correct number of values in `args` and there type matches the declaration in the format string. asciiZ printf_formatTZvar_argrr)rGr1rQrrFr(encoderOr FunctionTyper get_globalrrrrHlist) rrLargsmodcstring fmt_bytes global_fmtrrptr_fmtrrrr:s   rc Gst|tst|j}t}t|dd}t|d|}tj t |t |gdd} d} t j r^d| } z|| } Wn$tk rtj|| | d} YnX|||} || ||| gt|S) z8Calls libc snprintf(buffer, bufsz, format, ...args) rdreZsnprintf_formatTrfsnprintfr*r)rGr1rQrrFr(rgrOrrhrrrZIS_WIN32rirrrrHrj) rbufferbufszrLrkrlrmrnrorsymbolrrprrrrqTs&  rqcGsVt|tstttd|}t||dd}||t}t ||t ||f||S)zwSimilar to `snprintf()` but the buffer is stack allocated to size *bufsz*. Returns the buffer pointer as i8*. r Tr\) rGrrQrr#r$r^rrFrqr)rrsrLrkZspacetyspacerrrrrsnprintf_stackbufferns  rvcCs|ddS)zk Normalize the given string to latin1 compatible encoding that is suitable for use in LLVM IR. utf8latin1)rgdecode)textrrrnormalize_ir_text{sr{c Csd}||t}t|d||td}|||}t||p}||j t|}| d|td}| |t|dW5QRX| ||j g}| |} t|d| W5QRXt|ddS) zIDebug print the memory region in *ptr* to *ptr + nbytes* as hex. zhexdump p=%p n=%zur rr z %02xN)Zzextrrrr$rrTrZuremrdr rrr|) rrnbytesZbytes_per_lineZbyte_trCZdiv_byZ do_new_linerrerrrhexdumps"     rcCs |dkpt|tjpt|tjS)z returns if 'ty' is none N)rGrZNoneTypeZOmitted)rrrr is_nonelikes   rcCstt|t||S)z Create an LLVM-constant of a fixed-length array from Python values. The type provided is the type of the elements. )rr"r#r!)rrerrrcreate_constant_arraysr)N)r)NrF)rF)r)NN)NT)r)N)N)FF)N)FF)N)F)N)rL)r)r)cr collections contextlibrr$ZllvmliterZ numba.corerrrrZnumba.core.datamodelrHr$rIrGrZ MACHINE_BITSrrTrFZtrue_bitrUZ true_byteZ false_byterrr(r,r8rDobjectrEr.r/rr^rrrrrrrrrrrrrr namedtuplerrrrrrrrr rrrr.r1r3r4Zis_trueZis_falser5r8r<r=Z guard_zerorPr@rArirr&rJrKrOrRrSrTrYr\r]rcrrqrvr{rrrrrrrs          l       + 9      :