+
iGV R t ^ RIHt ^ RIHt ]' g R]9 d ^RIH t M^ RI t ^ RI
t R t
R tR tR t ! R
R ]4 t^ RIt] P( t^ R IHtHtHt ^ RItR
t ! R R]4 t ] P: ! ] 4 R t R t ] P@ t ] PB t! ] PD t" ] PF t# ] PH t$ ] PJ t% ] PL t& ] PN t' ] PP t( ] PR t) ] PT t* ] PV t+ ] PX t, ] PZ t- ] P\ t. ] P^ t/ ] P` t0 ] Pb t1 ] Pd t2 R R lt3R R lt4R R lt5R R lt6R R lt7 ! R R ]4 t8] Pr ! ]84 ] Pt t: ] Pv t; ] Px t< ] Pz t= ] P| t> ] P~ t? R R lt@R R! ltAR" R# ltBR$ R% ltCR& R' ltDR( R) ltER* R+ ltFR, R- ltGR. R/ ltHR0 R1 ltIR2 R3 ltJR4 R5 ltKR6 R7 ltLR8 R9 ltMR: R; ltN] P tO] P tP ! R< R=]4 tQ] P ! ]Q4 ^ RIt]P ! ]Q4 ]:tO];tPR# ] d ^ RI t ELi ; i)>a Functions that deal with cross-references (xrefs).
There are 2 groups of xrefs: CODE and DATA references. All xrefs are kept in the bTree except the ordinary execution flow to the next instruction. The ordinary execution flow to the next instruction is kept in flags (see bytes.hpp)
The source address of an xref must be an item head (is_head) or a structure member id. Even if an xref is generated by an element in the middle of the item, the item head address must be used. There are some exceptions to the rule but they are not worth mentioning here.
Xrefs are automatically sorted by addresses. However, the flow to the next instruction is always at the beginning of the list.
Xrefs are usually created by the processor module, as a reaction to the ev_emu_insn event. Plugins may create xrefs too but please note that upon a reanalysis of an item, all its xrefs, except the ones marked with XREF_USER, are deleted by the kernel.
.. tip::
The `IDA Domain API `_ simplifies
common tasks and provides better type hints, while remaining fully compatible
with IDAPython for advanced use cases.
For cross-reference operations, see :mod:`ida_domain.xrefs`.) annotations) version_info.) _ida_xrefNc R V P P 4 , pRV P P
: RV P P : RV: R2# \ P d Rp LPi ; i)z proxy of )this__repr__ __builtin__ Exception __class__
__module____name__)selfstrthiss & @C:\Users\user\Downloads\ida93sp2\portable_win\python\ida_xref.py
_swig_reprr sg 2 2 44 "^^ 6 69 s !A A43A4c a V 3R lpV# )c < VR 8X d S! WV4 R# VR8X d V P P V4 R# \ W4 ' d5 \ \ \ V 4 V4 \ 4 ' d S! WV4 R# \ RV , 4 h)r thisownz(You cannot add instance attributes to %sN)r ownhasattr
isinstancegetattrtypepropertyAttributeError)r namevaluesets &&&r set_instance_attrE_swig_setattr_nondynamic_instance_variable..set_instance_attr( su 6> E "
Y
IIMM%
T
ZT
D0I & & E " !K"
)r r! s f r *_swig_setattr_nondynamic_instance_variabler% & s
r# c a V 3R lpV# )c < \ W4 ' d+ \ \ W4 \ 4 ' g S! WV4 R# \ R V , 4 h)z%You cannot add class attributes to %sN)r r r r r )clsr r r s &&&r set_class_attr?_swig_setattr_nondynamic_class_variable..set_class_attr8 s: 3 j1CX&N&N 5 ! !H3!NO Or# r$ )r r) s f r '_swig_setattr_nondynamic_class_variabler+ 6 s P
r# c a V 3R lpV# )zlClass decorator for adding a metaclass to a SWIG wrapped class - a slimmed down version of six.add_metaclassc p < S! V P V P V P P 4 4 # N)r __bases____dict__copy)r( metaclasss &r wrapper$_swig_add_metaclass..wrapperC s' s}}cll6G6G6IJJr# r$ )r2 r3 s f r _swig_add_metaclassr5 @ s K Nr# c > ] tR t^HtRt]! ]P 4 tRtR# )_SwigNonDynamicMetazKMeta class to enforce nondynamic attributes (no new attributes) for a classr$ N) r r __qualname____firstlineno____doc__r+ r __setattr____static_attributes__r$ r# r r7 r7 H s U9$:J:JKKr# r7 )TupleListUnionc . \ P ! W4 # )a> This function creates xrefs from the indirect jump.
Usually there is no need to call this function directly because the kernel
will call it for switch tables
Note: Custom switch information are not supported yet.
:param ea: address of the 'indirect jump' instruction
:param si: switch information
:returns: Boolean)r create_switch_xrefseasis &&r rA rA S s ( ( 00r# c ] tR t^bt$ ]! R R RR7 t]t]! ]P ]P 4 t R] R& ]! ]P ]P 4 tR] R& R t]P" tR
tR # ) cases_and_targets_tc 6 V P P 4 # r. r r xs &r cases_and_targets_t.c r# c 8 V P P V4 # r. rH rJ vs &&r rK rL c AFFJJqMr# The membership flagdoc 'casevec_t'casesz 'eavec_t'targetsc Z \ P ! V \ P ! 4 4 R # r. )r cases_and_targets_t_swiginitnew_cases_and_targets_tr s &r __init__ cases_and_targets_t.__init__k s$ ..tY # #6$ 6& 'r# r$ N)r r r8 r9 r r r r
r cases_and_targets_t_cases_get cases_and_targets_t_cases_setrV __annotations__ cases_and_targets_t_targets_get cases_and_targets_t_targets_setrW r\ delete_cases_and_targets_t__swig_destroy__r< r$ r# r rF rF b sq -/I !#GH!)"I"I//1E; 1!)"K"K113GY 3' !;;r# rF c . \ P ! W4 # )a Get information about a switch's cases.
The returned information can be used as follows:
for idx in range(len(results.cases)):
cur_case = results.cases[idx]
for cidx in range(len(cur_case)):
print("case: %d" % cur_case[cidx])
print(" goto 0x%x" % results.targets[idx])
:param ea: address of the 'indirect jump' instruction
:param si: switch information
:returns: a structure with 2 members: 'cases', and 'targets'.)r calc_switch_casesrB s &&r rf rf t s & &r ..r# c . \ P ! W4 # )zCreate switch table from the switch information
:param ea: address of the 'indirect jump' instruction
:param si: switch information
:returns: Boolean)r create_switch_tablerB s &&r rh rh s ( ( 00r# c V ^8 d QhRRRR/# ) xrtypez'char'returnr$ )formats "r __annotate__rn s & &V &v &r# c . \ P ! V 4 # )zGet character describing the xref type.
:param xrtype: combination of Cross-Reference type flags and a cref_t of dref_t value)r xrefchar)rk s &r rp rp s f %%r# c ( V ^8 d QhRRRRRRRR/# )rj frmida_idaapi.ea_ttor z'cref_t'rl boolr$ )rm s "r rn rn ( - -/ - -h -$ -r# c 0 \ P ! WV4 # )zCreate a code cross-reference.
:param to: linear address of referenced instruction
:param type: cross-reference type
:returns: success)r add_crefrr rt r s &&&r rx rx ct ,,r# c ( V ^8 d QhRRRRRRRR/# )rj rr rs rt expandru rl r$ )rm s "r rn rn s( / // / / / /r# c 0 \ P ! WV4 # )a| Delete a code cross-reference.
:param to: linear address of referenced instruction
:param expand: policy to delete the referenced instruction
* 1: plan to delete the referenced instruction if it has no more references.
* 0: don't delete the referenced instruction even if no more cross-references point to it
:returns: true: if the referenced instruction will be deleted)r del_cref)rr rt r| s &&&r r~ r~ s cv ..r# c ( V ^8 d QhRRRRRRRR/# )rj rr rs rt r z'dref_t'rl ru r$ )rm s "r rn rn rv r# c 0 \ P ! WV4 # )zCreate a data cross-reference.
:param to: linear address of referenced data
:param type: cross-reference type
:returns: success (may fail if user-defined xref exists from->to))r add_drefry s &&&r r r rz r# c $ V ^8 d QhRRRRRR/# )rj rr rs rt rl Noner$ )rm s "r rn rn s! ' '/ ' '$ 'r# c . \ P ! W4 # )zUDelete a data cross-reference.
:param to: linear address of referenced data)r del_dref)rr rt s &&r r r s c &&r# c \ ] tR t^t$ ]! R R RR7 t]t]! ]P ]P 4 t R] R& ]! ]P ]P 4 tR] R& ]! ]P ]P" 4 tR] R & ]! ]P& ]P( 4 tR
] R & ]! ]P, ]P. 4 tR] R & ]! ]P2 ]P4 4 tR
] R
& R!R R llt R!R R llt R R lt R R lt R t R t!R t"R t#R t$R t%R t&R t'R t(]PR t*R t+R # )" xrefblk_tc 6 V P P 4 # r. rH rI s &r rK xrefblk_t. rM r# c 8 V P P V4 # r. rH rO s &&r rK r rQ r# rR rS rs rr rt ru iscodez'uchar'r user_flagsc $ V ^8 d QhRRRRRR/# )rj _fromrs flagsintrl ru r$ )rm s "r rn xrefblk_t.__annotate__ s& B B B B Br# c 0 \ P ! WV4 # r. )r xrefblk_t_first_from)r r r s &&&r
first_fromxrefblk_t.first_from s --d5AAr# c $ V ^8 d QhRRRRRR/# )rj _tors r r rl ru r$ )rm s "r rn r s! > >O >C >T >r# c 0 \ P ! WV4 # r. )r xrefblk_t_first_to)r r r s &&&r first_toxrefblk_t.first_to s ++Du==r# c V ^8 d QhRR/# rj rl ru r$ )rm s "r rn r s : : :r# c 2 \ P ! V .VO5! # r. )r xrefblk_t_next_fromr argss &*r next_fromxrefblk_t.next_from ,,T9D99r# c V ^8 d QhRR/# r r$ )rm s "r rn r s 8 8t 8r# c 2 \ P ! V .VO5! # r. )r xrefblk_t_next_tor s &*r next_toxrefblk_t.next_to s **47$77r# c #
p " \ V4 pV\ P 8w d Vx \ W4 pK& R# 5i)zH
Provide an iterator on code references to ea including flow references
N)get_first_cref_to
ida_idaapiBADADDRget_next_cref_tor rC refs && r crefs_toxrefblk_t.crefs_to 3 #Z'''I"2+C ( 46c #
p " \ V4 pV\ P 8w d Vx \ W4 pK& R# 5i)z.
Provide an iterator on code references to ea
N)get_first_fcref_tor r get_next_fcref_tor s && r fcrefs_toxrefblk_t.fcrefs_to$ s3 !$Z'''I#B,C (r c #
p " \ V4 pV\ P 8w d Vx \ W4 pK& R# 5i)zJ
Provide an iterator on code references from ea including flow references
N)get_first_cref_fromr r get_next_cref_fromr s && r
crefs_fromxrefblk_t.crefs_from- 3 ""%Z'''I$R-C (r c #
p " \ V4 pV\ P 8w d Vx \ W4 pK& R# 5i)z0
Provide an iterator on code references from ea
N)get_first_fcref_fromr r get_next_fcref_fromr s && r fcrefs_fromxrefblk_t.fcrefs_from6 s3 #2&Z'''I%b.C (r c #
p " \ V4 pV\ P 8w d Vx \ W4 pK& R# 5i)z.
Provide an iterator on data references to ea
N)get_first_dref_tor r get_next_dref_tor s && r drefs_toxrefblk_t.drefs_to? r r c #
p " \ V4 pV\ P 8w d Vx \ W4 pK& R# 5i)z0
Provide an iterator on data references from ea
N)get_first_dref_fromr r get_next_dref_fromr s && r
drefs_fromxrefblk_t.drefs_fromH r r c #
a " V 3R lpS P W4 ' d- V! 4 x S P 4 ' d V! 4 x K! R# R# 5i)z;
Provide an iterator on from reference represented by flag
c r < ! R R\ 4 p V ! 4 pR F p\ W\ SV4 4 K V# )?Make a private copy of the xref class to preserve its contents c ] tR tRtRtR# )6xrefblk_t.refs_from.._copy_xref.._xrefiZ r$ Nr r r8 r9 r< r$ r# r _xrefr Z r# r rr rt r r r objectsetattrr r xrattrr s r
_copy_xref'xrefblk_t.refs_from.._copy_xrefV 7
B?'$"56 @Ir# N)r r r rC flagr s f&& r refs_fromxrefblk_t.refs_fromQ sC
??2 $ $ , .."" l" # % ._copy_xref.._xrefin r$ Nr r$ r# r r r n r r# r r r r s r r %xrefblk_t.refs_to.._copy_xrefj r r# N)r r r s f&& r refs_toxrefblk_t.refs_toe sA
== " " , ,,.. l" ! #r c Z \ P ! V \ P ! 4 4 R # r. )r xrefblk_t_swiginit
new_xrefblk_tr[ s &r r\ xrefblk_t.__init__y s $$T9+B+B+DEr# r$ N) ),r r r8 r9 r r r r
r xrefblk_t_frm_getxrefblk_t_frm_setrr r` xrefblk_t_to_getxrefblk_t_to_setrt xrefblk_t_iscode_getxrefblk_t_iscode_setr xrefblk_t_type_getxrefblk_t_type_setr xrefblk_t_user_getxrefblk_t_user_setr xrefblk_t__flags_getxrefblk_t__flags_setr r r r r r r r r r r r r r\ delete_xrefblk_trd r< r$ r# r r r sC -/I !#GH#I$?$? C "9#=#=yB I : :I FD Y 9 99 D' )66 D$ y = =y FG B>:8,-./,.#(#(F 11r# r c V ^8 d QhRRRR/# rj rr rs rl r$ )rm s "r rn rn . ._ . .r# c . \ P ! V 4 # )zGet first data referenced from the specified address.
:returns: linear address of first (lowest) data referenced from the specified address. Return BADADDR if the specified instruction/data doesn't reference to anything.)r r rr s &r r r ( ( --r# c $ V ^8 d QhRRRRRR/# rj rr rs currentrl r$ )rm s "r rn rn " 6 6O 6o 66r# c . \ P ! W4 # )a Get next data referenced from the specified address.
:param current: linear address of current referenced data. This value is returned by get_first_dref_from() or previous call to get_next_dref_from() functions.
:returns: linear address of next data or BADADDR.)r r rr r s &&r r r ' ' 55r# c V ^8 d QhRRRR/# rj rt rs rl r$ )rm s "r rn rn + +/ +_ +r# c . \ P ! V 4 # )zGet address of instruction/data referencing to the specified data.
:param to: linear address of referencing instruction or data
:returns: BADADDR if nobody refers to the specified data.)r r rt s &r r r
& &r **r# c $ V ^8 d QhRRRRRR/# rj rt rs r rl r$ )rm s "r rn rn " 3 3 3? 33r# c . \ P ! W4 # )aJ Get address of instruction/data referencing to the specified data
:param to: linear address of referencing instruction or data
:param current: current linear address. This value is returned by get_first_dref_to() or previous call to get_next_dref_to() functions.
:returns: BADADDR if nobody refers to the specified data.)r r rt r s &&r r r % %b 22r# c V ^8 d QhRRRR/# r r$ )rm s "r rn rn r r# c . \ P ! V 4 # )a Get first instruction referenced from the specified instruction. If the specified instruction passes execution to the next instruction then the next instruction is returned. Otherwise the lowest referenced address is returned (remember that xrefs are kept sorted!).
:returns: first referenced address. If the specified instruction doesn't reference to other instructions then returns BADADDR.)r r r s &r r r r r# c $ V ^8 d QhRRRRRR/# r r$ )rm s "r rn rn r r# c . \ P ! W4 # )a Get next instruction referenced from the specified instruction.
:param current: linear address of current referenced instruction This value is returned by get_first_cref_from() or previous call to get_next_cref_from() functions.
:returns: next referenced address or BADADDR.)r r r s &&r r r r r# c V ^8 d QhRRRR/# r r$ )rm s "r rn rn r r# c . \ P ! V 4 # )a Get first instruction referencing to the specified instruction. If the specified instruction may be executed immediately after its previous instruction then the previous instruction is returned. Otherwise the lowest referencing address is returned. (remember that xrefs are kept sorted!).
:param to: linear address of referenced instruction
:returns: linear address of the first referencing instruction or BADADDR.)r r r s &r r r r r# c $ V ^8 d QhRRRRRR/# r r$ )rm s "r rn rn r r# c . \ P ! W4 # )af Get next instruction referencing to the specified instruction.
:param to: linear address of referenced instruction
:param current: linear address of current referenced instruction This value is returned by get_first_cref_to() or previous call to get_next_cref_to() functions.
:returns: linear address of the next referencing instruction or BADADDR.)r r r s &&r r r r r# c V ^8 d QhRRRR/# r r$ )rm s "r rn rn s / /o / /r# c . \ P ! V 4 # r. )r r r s &r r r s ) )# ..r# c $ V ^8 d QhRRRRRR/# r r$ )rm s "r rn rn s" 7 7_ 7 77r# c . \ P ! W4 # r. )r r r s &&r r r s ( ( 66r# c V ^8 d QhRRRR/# r r$ )rm s "r rn rn s , ,? ,o ,r# c . \ P ! V 4 # r. )r r r s &r r r s ' ' ++r# c $ V ^8 d QhRRRRRR/# r r$ )rm s "r rn rn s" 4 4/ 4O 44r# c . \ P ! W4 # r. )r r r s &&r r r s & &r 33r# c $ V ^8 d QhRRRRRR/# )rj pfnz
'func_t *'rC rs rl ru r$ )rm s "r rn rn s! 0 0: 0? 0d 0r# c . \ P ! W4 # )z1Does 'ea' have references from outside of 'pfn'?
)r has_external_refs)r* rC s &&r r, r, s & &s //r# c V ^8 d QhRRRR/# )rj rC rs rl ru r$ )rm s "r rn rn s / /o / /r# c . \ P ! V 4 # )z)Are there jump or flow references to EA?
)r has_jump_or_flow_xref)rC s &r r/ r/ s * *2 ..r# c $ V ^8 d QhRRRRRR/# )rj jump_ears rD z'switch_info_t'rl r r$ )rm s "r rn rn s! 6 6 6o 6 6r# c . \ P ! W4 # r. )r delete_switch_table)r1 rD s &&r r3 r3 s ( ( 55r# c ] tR tRt]! R R RR7 t]tR t] P t R R lt R R
lt
R R ltR
R ltR R ltR R ltR R ltR R ltR R ltR R ltR R ltR R ltR R ltR! R" ltR# R$ ltR% R& ltR' R( lt R) R* lt R+ R, lt R- R. lt R/ R0 lt R1 R2 lt!R3 R4 lt"R5 R6 lt#R7 R8 lt$R9 R: lt%R; R< lt&R= R> lt'R? R@ lt(RA RB lt)]*PV t,]*PZ t.]*P^ t0RCt1RD# )E casevec_ti c 6 V P P 4 # r. rH rI s &r rK casevec_t. rM r# c 8 V P P V4 # r. rH rO s &&r rK r7 rQ r# rR rS c X \ P ! V \ P ! V! 4 R # r. )r casevec_t_swiginit
new_casevec_tr s &*r r\ casevec_t.__init__ s $$T9+B+BD+IJr# c V ^8 d QhRR/# )rj rl z'qvector< long long > &'r$ )rm s "r rn casevec_t.__annotate__ s : :!9 :r# c 2 \ P ! V .VO5! # r. )r casevec_t_push_backr s &*r push_backcasevec_t.push_back r r# c V ^8 d QhRR/# rj rl r r$ )rm s "r rn r> 2 2 2r# c . \ P ! V 4 # r. )r casevec_t_pop_backr[ s &r pop_backcasevec_t.pop_back ++D11r# c V ^8 d QhRR/# rj rl r r$ )rm s "r rn r> s . .S .r# c . \ P ! V 4 # r. )r casevec_t_sizer[ s &r sizecasevec_t.size s ''--r# c V ^8 d QhRR/# r r$ )rm s "r rn r> / /d /r# c . \ P ! V 4 # r. )r casevec_t_emptyr[ s &r emptycasevec_t.empty ((..r# c V ^8 d QhRRRR/# )rj _idxr rl 'qvector< long long > const &'r$ )rm s "r rn r> s 2 2s 2 < 2r# c . \ P ! W4 # r. )r casevec_t_at)r rY s &&r at casevec_t.at s %%d11r# c V ^8 d QhRR/# rD r$ )rm s "r rn r> s 0 0t 0r# c . \ P ! V 4 # r. )r casevec_t_qclearr[ s &r qclearcasevec_t.qclear s ))$//r# c V ^8 d QhRR/# rD r$ )rm s "r rn r> rR r# c . \ P ! V 4 # r. )r casevec_t_clearr[ s &r clearcasevec_t.clear rW r# c V ^8 d QhRR/# rD r$ )rm s "r rn r> s 7 7d 7r# c 2 \ P ! V .VO5! # r. )r casevec_t_resizer s &*r resizecasevec_t.resize s ))$666r# c V ^8 d QhRR/# rD r$ )rm s "r rn r> s 5 5D 5r# c 2 \ P ! V .VO5! # r. )r casevec_t_growr s &*r growcasevec_t.grow ''4t44r# c V ^8 d QhRR/# rL r$ )rm s "r rn r> ! s 2 2 2r# c . \ P ! V 4 # r. )r casevec_t_capacityr[ s &r capacitycasevec_t.capacity! rJ r# c V ^8 d QhRRRR/# )rj cntr rl r r$ )rm s "r rn r> $ s 6 63 6$ 6r# c . \ P ! W4 # r. )r casevec_t_reserve)r rz s &&r reservecasevec_t.reserve$ s **455r# c V ^8 d QhRR/# rD r$ )rm s "r rn r> ' rE r# c . \ P ! V 4 # r. )r casevec_t_truncater[ s &r truncatecasevec_t.truncate' rJ r# c V ^8 d QhRRRR/# )rj rrU rl r r$ )rm s "r rn r> * s 1 1k 1T 1r# c . \ P ! W4 # r. )r casevec_t_swapr r s &&r swapcasevec_t.swap* ''00r# c V ^8 d QhRR/# )rj rl 'qvector< long long > *'r$ )rm s "r rn r> - s 1 10 1r# c . \ P ! V 4 # r. )r casevec_t_extractr[ s &r extractcasevec_t.extract- **400r# c $ V ^8 d QhRRRRRR/# )rj sr lenr rl r r$ )rm s "r rn r> 0 s" 8 80 8s 8d 8r# c 0 \ P ! WV4 # r. )r casevec_t_inject)r r r s &&&r injectcasevec_t.inject0 s ))$377r# c V ^8 d QhRRRR/# rj r rU rl ru r$ )rm s "r rn r> 3 3 3 3t 3r# c . \ P ! W4 # r. )r casevec_t___eq__r s &&r __eq__casevec_t.__eq__3 ))$22r# c V ^8 d QhRRRR/# r r$ )rm s "r rn r> 6 r r# c . \ P ! W4 # r. )r casevec_t___ne__r s &&r __ne__casevec_t.__ne__6 r r# c V ^8 d QhRR/# rj rl z1'qvector< qvector< long long > >::const_iterator'r$ )rm s "r rn r> 9 s 6 6 N 6r# c 2 \ P ! V .VO5! # r. )r casevec_t_beginr s &*r begincasevec_t.begin9 ((555r# c V ^8 d QhRR/# r r$ )rm s "r rn r> < s 4 4L 4r# c 2 \ P ! V .VO5! # r. )r
casevec_t_endr s &*r end
casevec_t.end< s &&t3d33r# c $ V ^8 d QhRRRRRR/# )rj it+'qvector< qvector< long long > >::iterator'rJ rZ rl r$ )rm s "r rn r> ? s$ 7 7D 7&7 77r# c 0 \ P ! WV4 # r. )r casevec_t_insert)r r rJ s &&&r insertcasevec_t.insert? s ))$A66r# c V ^8 d QhRR/# )rj rl r r$ )rm s "r rn r> D s 6 6 H 6r# c 2 \ P ! V .VO5! # r. )r casevec_t_eraser s &*r erasecasevec_t.eraseD r r# c V ^8 d QhRR/# r r$ )rm s "r rn r> G s 5 5 M 5r# c 2 \ P ! V .VO5! # r. )r casevec_t_findr s &*r findcasevec_t.findG rs r# c V ^8 d QhRRRR/# rj rJ rZ rl ru r$ )rm s "r rn r> J s 0 03 0t 0r# c . \ P ! W4 # r. )r
casevec_t_hasr rJ s &&r has
casevec_t.hasJ s &&t//r# c V ^8 d QhRRRR/# r r$ )rm s "r rn r> M s 7 7 : 7d 7r# c . \ P ! W4 # r. )r casevec_t_add_uniquer s &&r
add_uniquecasevec_t.add_uniqueM s --d66r# c V ^8 d QhRRRR/# r r$ )rm s "r rn r> P s 1 14 1 1r# c . \ P ! W4 # r. )r casevec_t__delr s &&r _delcasevec_t._delP r r# c V ^8 d QhRR/# rL r$ )rm s "r rn r> S s 1 1 1r# c . \ P ! V 4 # r. )r casevec_t___len__r[ s &r __len__casevec_t.__len__S r r# c V ^8 d QhRRRR/# )rj ir rl rZ r$ )rm s "r rn r> V s 8 8S 8$B 8r# c . \ P ! W4 # r. )r casevec_t___getitem__)r r s &&r __getitem__casevec_t.__getitem__V s ..t77r# c $ V ^8 d QhRRRRRR/# )rj r r rP rZ rl r r$ )rm s "r rn r> Y s" ; ;S ;%C ;t ;r# c 0 \ P ! WV4 # r. )r casevec_t___setitem__)r r rP s &&&r __setitem__casevec_t.__setitem__Y s ..t::r# c V ^8 d QhRRRR/# )rj rJ rZ rl r r$ )rm s "r rn r> \ s 3 36 3$ 3r# c . \ P ! W4 # r. )r casevec_t_appendr s &&r appendcasevec_t.append\ r r# c V ^8 d QhRRRR/# )rj rJ rU rl r r$ )rm s "r rn r> _ r r# c . \ P ! W4 # r. )r casevec_t_extendr s &&r extendcasevec_t.extend_ r r# r$ N)2r r r8 r9 r r r r
r\ r delete_casevec_trd rA rH rO rU r] rb rg rl rq rw r} r r r r r r r r r r r r r r r r r r r r _qvector_frontfront
_qvector_backback_bounded_getitem_iterator__iter__r< r$ r# r r5 r5 s -/I !#GHK 11:2./20/7526211833647
6507118;33 % %E # #D33Hr# r5 )Tr:
__future__r sysr _swig_python_version_info __package__r r r builtinsr ImportErrorr r% r+ r5 r r7 weakrefSWIG_PYTHON_LEGACY_BOOLtypingr= r> r? r rA r rF cases_and_targets_t_swigregisterrf rh fl_Ufl_CFfl_CNfl_JFfl_JN
fl_USobsoletefl_Fdr_Udr_Odr_Wdr_Rdr_Tdr_Idr_S XREF_USER XREF_TAIL XREF_BASE XREF_MASK XREF_PASTENDrp rx r~ r r r xrefblk_t_swigregister XREF_FLOW XREF_NOFLOW XREF_DATA XREF_CODEXREF_EAXREF_TIDr r r r r r r r r r r r r, r/ r3 XREF_ALLXREF_FARr5 casevec_t_swigregister_listify_typesr$ r# r r s C # 9#/"
L$ L
#;; % % 1 <& <
* *+> ?/$1 ~~''
~~~~~~~~~~~~~~~~ %% &-/-'E2 E2P
+ ##
.6+3.6+3/7
,4
0 / 6 f4 f4R
+
) $ c s J4 4 KK