524 lines
247 KiB
Plaintext
524 lines
247 KiB
Plaintext
|
rust
|
|||
|
|
FØ #rustc 1.96.0 (ac68faa20 2026-05-25)ÁÀ뉊 ]!ÜÛê(¹Þ—šên -5be7b69c3ff7b5b8Á íàÄTËŸ ÜJîÄ)'ß\¥! -3d1337db07d0b3aeÁ ¤²XctÔ'ÐÓ©z¨É½Ó -a4945860e1c53b00Á ¤°ð ¾ä-±($²ï=©Ã -7e98a21bfd32b0edÁ–�òÖÀH•‘P IÓHã#£ -055f30b747f859b6Á rustc_std_workspace_coreÁCçß^ò½èÝ$Çÿ+Cé -c4878ee60b2242c9Á ŸÃï+Ñ]ŠqB<ÏïW# -8dd1dd90e70d0b6aÁ miniz_oxideÁ€š»J(P>àö÷g\K -1eb618da2918ab7fÁ adler2ÁÆ;+Þ®5¥ÌýÝ°¦ÛLˆ -f7919172d268e069Á hashbrownÁPäV9ÒÆèÜ�"ÊÖVŽ\ -0fc2184a5da6723aÁ rustc_std_workspace_allocÁs&ØòØy¯s•bæ!‰ýŠ -97e4bf30be240674Á
|
|||
|
|
std_detectÁhŠBîÙºÌI®Ë�Å�š -9dbbf8346ba7ac8bÁ rustc_demangleÁûë9´Ç×@Œ�’ùXFº -f33013f239bf9f14Á cfg_ifÁÜLh�ž§Œaã¯>� -0a71c8f33a838301Á addr2lineÁ׎Þ!]8V$É@@T· -e618e6be60e87ba2Á gimliÁ¸
|
|||
|
|
°µ~Î1‹Ñt ðÁ€w -1f7768a68858f670Á objectÁ
|
|||
|
|
áPÃ?À¶¼QHJ¥� -914cd6a4dbe590d1Á memchrÁ›º«8Ór2Ù $¨ûib‚ -cf21ca6f2bb15dcdÁë
|
|||
|
|
‹ás «LÖ€îâƒ×ɯŒ -ee6f3747e38367f0Á crossbeam_utilsÁ\€v€*˜‚³aÑl®Ø{Í -580ebf62485b3066Á loomÁ$ð crossbeam_loomÁ tÄ primitiveÁL¶ ‰ tý testsÁ,꤂ $ɤ¸¾,ë‚ $ÊÙ¾,›‚ $ú® MAX_OBJECTSÁ\� crossbeam_sanitizeÁ ”ëµ $ÿÔꮾ,žŸ‚ $ýž�¾,¸P‚ $—PÖ‚$þ=‚ $Ý=Ž¾,š‚ $ù
|
|||
|
|
À ¢ cellÁ ¥ æ withÁ £ impl FnOnce(*const T) -> RÁ with_mutÁ £ impl FnOnce(*mut T) -> RÁ ç atomicÁ ¤ µ
|
|||
|
|
|
|||
|
|
strongest_failure_orderingÁ / CompareAndSetErrorÁ 1 'gÁ 1¥ 1¡ CompareExchangeErrorÁ 5‚
|
|||
|
|
5¥ 5¡ 5 currentÁ 5æ ;¥ ;¡ ;× CompareAndSetOrderingÁ ? successÁ ? failureÁ B“ B¡ E“ E¡ low_bitsÁ H¥ ensure_alignedÁ J¥ compose_tagÁ L¥
|
|||
|
|
decompose_tagÁ N¥ PointableÁ P ALIGNÁ P InitÁ P initÁ P´ T 'aÁ P¶ Vò Pã Y¥ YÉ YÕ Yà Y´ ^ò Y¶ `ò Yã M c¥ c‘ c elementsÁ f h¥ h layoutÁ k¥ kÉ kÕ kà k´ pò k¶ rò kã V u¥ u dataÁ u _markerÁ y¥ {¥ }¥ }æ €¥ €à €€ €—
|
|||
|
|
€¬ …‚
|
|||
|
|
€ load_consumeÁ ‡‚
|
|||
|
|
€È ‰¡ € swapÁ ‹‚
|
|||
|
|
‹¡ € Ž‚
|
|||
|
|
Ž¡ Ž Ž €¡ “‚
|
|||
|
|
“¡ “ “ €¾ ˜‚
|
|||
|
|
˜— € compare_and_setÁ ›‚
|
|||
|
|
› ›¡ € compare_and_set_weakÁ Ÿ‚
|
|||
|
|
Ÿ Ÿ¡ € fetch_andÁ £‚
|
|||
|
|
€ fetch_orÁ ¥‚
|
|||
|
|
€ fetch_xorÁ §‚
|
|||
|
|
€
|
|||
|
|
into_ownedÁ € try_into_ownedÁ
|
|||
|
|
«¥ «× ®¥ ®× ±¥ ±ƒ
|
|||
|
|
´¥ ´> ·¥ ·÷ º¥ º÷ ½¥ ½÷ À‚
|
|||
|
|
À¥ À÷ Ä¥ Ä÷ ¶ Ç¥ Ç
|
|||
|
|
into_usizeÁ Ç€ OwnedÁ Ë¥ Ëâ Ëí Ï¥ Ï› Ï€ Ó¥ Ó from_rawÁ Ó into_boxÁ Óæ Ø¥ Øà Ø into_sharedÁ Û‚
|
|||
|
|
Ø tagÁ Ø with_tagÁ ߥ ßã ⥠â× å¥ åƒ è¥ èå è´ ì¥ ì¶ ï¥ ï÷ ò¥ ò÷ õ¥ õ borrowÁ ø¥ ø
|
|||
|
|
borrow_mutÁ û¥ ûÉ þ¥ þ as_mutÁ SharedÁ �‚
|
|||
|
|
�¥ �â �í !†¥ †ƒ "‰¥ #‹¥ ‹› ‹€ $�‚
|
|||
|
|
�¥ � as_rawÁ %“‚
|
|||
|
|
“¥ “—
|
|||
|
|
“ is_nullÁ “´ “¶ “É “© “» “Ø “ã &Ÿ¥ Ÿ÷ '¢‚
|
|||
|
|
¢¥ ¢� (¦¥ )¨‚
|
|||
|
|
¨¥ ¨ï
|
|||
|
|
*¬¥ ¬‹ +¯¥ ¯× ,²¥ ²× -µ¥ µ> collectorÁ ¸ ¸¸¸¸¸¸ CollectorÁ ¿ globalÁ ¸ ¸¸Ã> ¸Åæ Å registerÁ ¸Èƒ ¸Ê× ¸Ì� ¸¸ LocalHandleÁ Ï® ¸Ñÿ
|
|||
|
|
Ñ is_pinnedÁ Ñ� ¸ Õã ¸
|
|||
|
|
×× deferredÁ Ù ÙÙÙÙÙÙÙ
|
|||
|
|
DATA_WORDSÁ Ù DataÁ â Ù DeferredÁ äÑ äâ äí Ù è× Ùê NO_OPÁ ë
|
|||
|
|
no_op_callÁ êæ í— íÑ ï— íÑñ— êÑ epochÁ ô ôôô ø startingÁ øë øÖ ø pinnedÁ ø unpinnedÁ ø successorÁ ôÿæ ÿ¬ ÿÈ ÿ £ „ „„„„„„ GuardÁ ‹® „ � deferÁ Ž— Ž£ � defer_uncheckedÁ ‘— ‘£ ‘ �
|
|||
|
|
defer_destroyÁ •¥ • � flushÁ � repinÁ � repin_afterÁ š— š£ š
|
|||
|
|
ScopeGuardÁ �
|
|||
|
|
�ˆ š ã �� ¢ „¤ã „¦× „ unprotectedÁ ¨ GuardWrapperÁ ©
|
|||
|
|
©ˆ ¨ ¨ UNPROTECTEDÁ å ® ®®®®®®®®® ®
|
|||
|
|
® ® ®
|
|||
|
|
®®®®®®®®®®®®®®® ® ® ® ®� ® BagÁ Ð deferredsÁ Ñ Ð‘ ® ®Õæ Õ is_emptyÁ Õ try_pushÁ Õ sealÁ ®Ú> Û ®Ýã ®ß× ®®â
|
|||
|
|
is_expiredÁ ® GlobalÁ ä localsÁ ä queueÁ äî! ®è
|
|||
|
|
COLLECT_STEPSÁ èæ è push_bagÁ è collectÁ ì è try_advanceÁ ® LocalÁ ï entryÁ ï� ï bagÁ ï guard_countÁ ï handle_countÁ ï pin_countÁ ïî! ®÷ PINNINGS_BETWEEN_COLLECTÁ ÷ò ÷Á ÷� û ÷Ö ÷Â# þ ÷$ € ÷ÿ
|
|||
|
|
÷þ ÷º$ ÷ acquire_handleÁ ÷ release_handleÁ ÷ finalizeÁ ‡ ‡ ® Š entry_ofÁ Š
|
|||
|
|
element_ofÁ Š…, ç Ž listÁ � ��������� � IsElementÁ š¥ š¤, š´, š…, � IterÁ Ÿ‚
|
|||
|
|
Ÿ¥ Ÿ” Ÿ£ Ÿ predÁ Ÿ currÁ Ÿ headÁ Ÿí � ¨> �ª deleteÁ �¬¥ ¬” ¬æ ¬ insertÁ °‚
|
|||
|
|
¬ù ²‚
|
|||
|
|
�´¥ ´” ´ã �¸‚
|
|||
|
|
¸¥ ¸” ¸› ¸ó Ž once_lockÁ ¾ ¾¾¾ OnceLockÁ Â¥  onceÁ » ¾ Æ¥ ¾È¥ ¾Ê¥ Êæ Ê get_or_initÁ Í— Ê
|
|||
|
|
initializeÁ Ï— Ï Ê
|
|||
|
|
get_uncheckedÁ ¾Ó¥ Óã Ž‚) Ö ÖÖÖÖÖÖÖÖÖ Ö
|
|||
|
|
Ö Ö NodeÁ 㥠ãâ ãó Ö ç¥ Öé¥ Öë¥ ëæ ë
|
|||
|
|
push_internalÁ ë pushÁ ë pop_internalÁ ð ð ë pop_if_internalÁ ó— ó ó ë try_popÁ ë
|
|||
|
|
try_pop_ifÁ ø— Öú¥ úã
|
|||
|
|
|
|||
|
|
> Ž ŽŽŽŽŽŽ� • COLLECTORÁ Žÿ
|
|||
|
|
— ŽÖ ™ Ž default_collectorÁ Ž with_handleÁ œ— œ£ œ œ
|
|||
|
|
UnsafeCellÁ ¥
|
|||
|
|
¥¥ ¥ˆ ©¥ ©× ô EpochÁ ¬â ôôô°ƒ ô²> ô´× ô¶Ö ôô ¹� ô AtomicEpochÁ »â ô
|
|||
|
|
½> ô ¿× ® SealedBagÁ Áî! Á _bagÁ ®
|
|||
|
|
Ä> ® Æ× � EntryÁ Èó �Ê× � ListÁ Ì¥ Ì” ̈. Ìí �Ñ¥ Ñ” Ñ× � IterErrorÁ Õ StalledÁ Ö
|
|||
|
|
��Ù� � Û× Ö QueueÁ Ý¥ ݈. Ý tailÁ Öᥠá× Ž HANDLEÁ ä __rust_std_internal_init_fnÁ ä æ ç __RUST_STD_INTERNAL_VALÁ æ é�:
|
|||
|
|
|
|||
|
|
;
|
|||
|
|
>
|
|||
|
|
>
|
|||
|
|
>
|
|||
|
|
@
|
|||
|
|
A
|
|||
|
|
C
|
|||
|
|
D
|
|||
|
|
F
|
|||
|
|
G
|
|||
|
|
…
|
|||
|
|
‡
|
|||
|
|
‰
|
|||
|
|
‹
|
|||
|
|
Ž
|
|||
|
|
Ž
|
|||
|
|
“
|
|||
|
|
“
|
|||
|
|
˜
|
|||
|
|
›
|
|||
|
|
›
|
|||
|
|
Ÿ
|
|||
|
|
Ÿ
|
|||
|
|
£
|
|||
|
|
¥
|
|||
|
|
§
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
°
|
|||
|
|
³
|
|||
|
|
Ý
|
|||
|
|
á
|
|||
|
|
ä
|
|||
|
|
ä
|
|||
|
|
ä
|
|||
|
|
ç
|
|||
|
|
ë
|
|||
|
|
î
|
|||
|
|
÷
|
|||
|
|
ú
|
|||
|
|
ý
|
|||
|
|
€
|
|||
|
|
†
|
|||
|
|
ˆ
|
|||
|
|
‰
|
|||
|
|
‹
|
|||
|
|
’
|
|||
|
|
—
|
|||
|
|
˜
|
|||
|
|
™
|
|||
|
|
š
|
|||
|
|
�
|
|||
|
|
ž
|
|||
|
|
Ÿ
|
|||
|
|
¥
|
|||
|
|
¥
|
|||
|
|
¦
|
|||
|
|
«
|
|||
|
|
«
|
|||
|
|
¬
|
|||
|
|
®
|
|||
|
|
®
|
|||
|
|
¯
|
|||
|
|
±
|
|||
|
|
±
|
|||
|
|
±
|
|||
|
|
²
|
|||
|
|
´
|
|||
|
|
´
|
|||
|
|
´
|
|||
|
|
µ
|
|||
|
|
Ç
|
|||
|
|
É
|
|||
|
|
Ë
|
|||
|
|
Ë
|
|||
|
|
Ë
|
|||
|
|
Í
|
|||
|
|
Í
|
|||
|
|
Ò
|
|||
|
|
Ó
|
|||
|
|
Ô
|
|||
|
|
Ö
|
|||
|
|
Ø
|
|||
|
|
Ø
|
|||
|
|
Ø
|
|||
|
|
é
|
|||
|
|
é
|
|||
|
|
é
|
|||
|
|
�
|
|||
|
|
‚
|
|||
|
|
ƒ
|
|||
|
|
Ž
|
|||
|
|
‘
|
|||
|
|
•
|
|||
|
|
•
|
|||
|
|
˜
|
|||
|
|
™
|
|||
|
|
š
|
|||
|
|
¡
|
|||
|
|
¢
|
|||
|
|
¥
|
|||
|
|
§
|
|||
|
|
§
|
|||
|
|
§
|
|||
|
|
×
|
|||
|
|
Ø
|
|||
|
|
Þ
|
|||
|
|
à
|
|||
|
|
à
|
|||
|
|
à
|
|||
|
|
ã
|
|||
|
|
ë
|
|||
|
|
ë
|
|||
|
|
ë
|
|||
|
|
ì
|
|||
|
|
ì
|
|||
|
|
ì
|
|||
|
|
î
|
|||
|
|
î
|
|||
|
|
ù
|
|||
|
|
ú
|
|||
|
|
û
|
|||
|
|
ý
|
|||
|
|
þ
|
|||
|
|
þ
|
|||
|
|
€
|
|||
|
|
€
|
|||
|
|
‚
|
|||
|
|
ƒ
|
|||
|
|
„
|
|||
|
|
…
|
|||
|
|
†
|
|||
|
|
‡
|
|||
|
|
‹
|
|||
|
|
Œ
|
|||
|
|
�
|
|||
|
|
�
|
|||
|
|
œ
|
|||
|
|
�
|
|||
|
|
ž
|
|||
|
|
ž
|
|||
|
|
«
|
|||
|
|
«
|
|||
|
|
·
|
|||
|
|
½
|
|||
|
|
Í
|
|||
|
|
Ï
|
|||
|
|
Ò
|
|||
|
|
Õ
|
|||
|
|
î
|
|||
|
|
î
|
|||
|
|
î
|
|||
|
|
î
|
|||
|
|
ï
|
|||
|
|
ï
|
|||
|
|
ð
|
|||
|
|
ð
|
|||
|
|
ó
|
|||
|
|
ó
|
|||
|
|
ó
|
|||
|
|
÷
|
|||
|
|
÷
|
|||
|
|
ø
|
|||
|
|
ø
|
|||
|
|
ø
|
|||
|
|
ü
|
|||
|
|
œ
|
|||
|
|
«
|
|||
|
|
«
|
|||
|
|
«
|
|||
|
|
±
|
|||
|
|
µ
|
|||
|
|
µ
|
|||
|
|
µ
|
|||
|
|
·
|
|||
|
|
º
|
|||
|
|
º
|
|||
|
|
À
|
|||
|
|
À
|
|||
|
|
À
|
|||
|
|
Ç
|
|||
|
|
Ç
|
|||
|
|
Ç
|
|||
|
|
Ë
|
|||
|
|
Ë
|
|||
|
|
Ë
|
|||
|
|
Ô
|
|||
|
|
Ô
|
|||
|
|
Ô
|
|||
|
|
Ú
|
|||
|
|
Ú
|
|||
|
|
Ü
|
|||
|
|
Ü
|
|||
|
|
Ü
|
|||
|
|
ã
|
|||
|
|
ã
|
|||
|
|
ã
|
|||
|
|
?PÇš¿c ¥ ¥ ¦Ô5 ¨ˆ r÷MŠH‹ ¥ ¿c 5 5 ™
|
|||
|
|
9É
|
|||
|
|
:æ »c,ç´ÏÆ 8¥¡ ?¼À½À¾ÀË ¿ÀÀÀÌ ÁÀÂÀG ÃÀÄÀF ÅÀÆÀ× `šÁ¬S øB ?ªDªD PÖC P
|
|||
|
|
ÑÛÑÛ MaybeUninitÁ ÓÛ uninitÁÝ ÔÛ»Ý Íõƒ«%9ÖC Ìì u u V wâ xí J°*‰®†ÚÖC � �F ¿c�F Îc�F Ø�F ³ �F é �F Ë Ë ´ Íâ Îí ݶçPrhìþÖC é �F�� ž BoxÁ ¡ˆˆ ¢‰ˆ l }.xÏÖCçEçEèEæ( ¿±‡§í# é �FÖC é u u V wâ xí J°*‰®†Ú˜D � � ì „â …í Ê,8ܪÏý ‚
|
|||
|
|
˜D é �F ÖC Ç‚GÖC Œ"‚G ¿c‚G Ø‚G é!‚G ö!‚G é ‚GÖC é ‚GÇG ‚GÖC £‚GÖC à ‚GÖC ã ‚GÖC Ø � � ì „â …í Ê,8ܪÏý 8˜D Š ßJ ÇßJ˜D é ßJ ˜D µßûHûH ™ßJ íßûHûH ºßJ ¿cßJ ÎcßJ ³ ßJ Ìì ¿ ¿ ° ÀÁ êðL¹ƒ~/ô � ›L ³ ›L Ø›L ¿c›L µß›L›L ™›L Œ" Ï Ï ® Ю k8,g
|
|||
|
|
öÀ ¿c�M ¿c ä ä Þ åÑ Ù æâ Ù çí ٠Х0ß”CW Š ¬ ¬ �6 â ô pÄ�žPƒ ÛšN ØšN ³ šN ¿cšN ™šN ÐìšN µßšNšN ³ » » ó6 ¼â ô ºÿ‚2s™…6 ¿cšO Œ" � � žê$ Ÿˆ „ �Ä¿²¥q Œ" ‹ ‹ ¨# Œ® }<8‡nöK ¿c’P � © © ªÐ% «ˆ „ Ú óÞ Ìì Ð Ð ¸' ÑÃ' ® Ó‘ ® Éú?R?éw7 ³ ŠQ Œ"ŠQ ¿cŠQ ³ Á Á §7 Âî! ® ÃÀ7 ® ìu 2«Ä ¿céQ � éQ š ï ï ð) ðý) ® ñ� ® ò’* ó�* ® ô°* ® õÄ* ® öî! ® :È¡¸§%¶¥ ¾R ¿c È È å7 Éó � ,•$Sše|³ ¿c Ì Ì ‡8 ψ. � Ðí � ö°+j”PÖC” Ðì Õ Ö ×á8 웫 Èá'v µß½T½T ¿c½T ³ ½S Œ"òS ùM Ÿ Ÿ Ä- ££ � ¤ð- � ¥ü- � ¦ˆ. � §í � QøíI½Ï†× ‚
|
|||
|
|
˜D” �   è/ Ä€0 ¾ Å» ¾ ÜæâñâºãpÖC ÌìŠV Œ"ŠV ¿c Ý Ý ”9 ߈. Ö à±9 Ö ¯Á™ZÖC � ãV ÌìãV Œ"ãV © ¥; 5« uâ ˯ �Ê ¿× Ïè ä´ ¬¿ »¦ ‹ß ÐÆ ÁÊ ÈÑ ÌÛ Õá ÝB¼ÀE
|
|||
|
|
Y k y uÁ ¿Ô ÐÈ Âé Ý{ u ¿¬ ©á ÁÆ Âç Ý® u² �± uå ˆ �È ¿° ¬´ uµ �à ¿² ¬½ »Ú ÐÄ Á¨ È· uº u½ uÀ uÄ uï Ëò ËŸ �Ï Ë‹ �ß ËÕ Ï �¤ ‹Ý д ÌÓ Âú Ýè Ëì Ëõ Ëø Ëû Ëþ ˉ �® ¬¢ �Ì ¿¹ ¬Ù Õ¦ �Î ¿¶ ¬¨ �¬ �¯ ¬¸ ¬Ø ÕŠ ï¸ Ÿ¿cÆ ?t P Ìì� !Îc(Ø
|
|||
|
|
³ "é 7 Ç3Œ"é!8ö! £à ã Š µß™ íߺÛÐì šùMüˆ%# $¦%
|
|||
|
|
# ìˆ%
|
|||
|
|
õ0ÖC 3 E ª% üý$/ ¥ ÖC «% º% ü¹$� ¥C lÝ$ ÖC $Ñ$ î0î0 Ô5 ð0»Ì- ·}—KEüC£ÖC Û ÖC Ù âH w ¤Ó3
|
|||
|
|
”Ó3
|
|||
|
|
ÊÖC % ü¾3* [ ,Ë3 $ _Á Ô_ 0Áܱ>
|
|||
|
|
̱>
|
|||
|
|
Ê c c M e‘ fç €çΑÖÏÇÖC X üœ>1 m Ô_ ,©> $ _Á œ÷U
|
|||
|
|
„÷U
|
|||
|
|
ŒÄ ˆV Ô_ > \¡V • ÖC üÞUY u ÖC ¶V ½V „ ü³UŠ �F LÊU ¤]¤] V ¦]Á‚] üß3ø¤”&Ô_ â • • – PhantomDataÁ Fu\»Ÿöa Ø „ Ô_ 3Á Ô_
|
|||
|
|
DATA_WORDSÁTµ
|
|||
|
|
ì ¬Ó
|
|||
|
|
œÓ
|
|||
|
|
òÔ_Ô_ 9 \ÿ • ¢d üœy ä ” üËÑ ë ÍM $ã ›d ß ÑÛÑÛ ÂD ÓÛ×DÝ ÔÛ»Ý Íõƒ«%9Êd ù • • – ’b Fu\»Ÿûd é Ÿ _Á @ Ô_ 64Á @ Ô_ MAX_OBJECTSÁ @ Ô_ MAX_OBJECTSÁ Ô_ 8Á € Ô_ 128Á\³
|
|||
|
|
L³
|
|||
|
|
þ8 ' üÓ& ¬ã
|
|||
|
|
ϋ
|
|||
|
|
òÖC + 8
|
|||
|
|
? |Ó
|
|||
|
|
õ0¶E O ` ø üšj  ÖC ƒ Š Ì üîœ ŠV $‹ ï8ï8 OnceÁ ð8 innerÁé8 ãTPàVça ! î0î0 Ô5 ð0»Ì- ·}—KEüC£¶E , ¶E + ’ ùW· ™e
|
|||
|
|
|
|||
|
|
éW· e
|
|||
|
|
¾�MùWÕ úe æ ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡z٠ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ�M �M �k± ß ùV�f�a ä ®® £ °åh¨ it§ÅLS¶�M áV¢fa X æ�k �k _Á ùWð e
|
|||
|
|
éWð e
|
|||
|
|
Ð�M / 5 ùW¦ ®e ç ’k¥l ¢d / �k W¿ e ùWí Ôe ùW‚!e é”n—n¢d # �k W›!e M WÀ$e ùWÛ ôe æ �k ç”n—n¢d å é”n—n¢d Ÿ S _Á üõ ¥ ÖC ¦ ) ¥C 4 ¸^ ; B Œÿq � ž % ÙO 0 ¾R 9 @ œù– © ª & ÐP 1 ’P 8 ? ¸Ùô„®ŽŽÀ ¤, + é ”ý/ 1 þ÷
|
|||
|
|
¬‘0 ? ÿV4�1 u ‚™
|
|||
|
|
¤‰1 5 ƒ´,Ÿ1 Ë „¹L¦1 P …¶<±1 Ç †ì4º1 � ‡° LÓ1 ¿ ‰® \Þ1 Ï Š½%\ø1 ¨ Œ¨#,…2 ‹ �ÿ4Œç2 › ¢Ö Lú2 ™ £ÿ
|
|||
|
|
…3 — ¤ü Š3 ü # Epoch-based memory reclamation.Á $ ú ü(\ Y An interesting problem concurrent collections deal with comes from the remove operation.Á ü…b _ Suppose that a thread removes an element from a lock-free map, while another thread is readingÁ üè` ] that same element at the same time. The first thread must wait until the second thread stopsÁ üÉ= : reading the element. Only then it is safe to destruct it.Á ‡ ú ü‹] Z Programming languages that come with garbage collectors solve this problem trivially. TheÁ üéa ^ garbage collector will destruct the removed element when no thread can hold a reference to itÁ dË anymore.Á Ø ú üÜa ^ This crate implements a basic memory reclamation mechanism, which is based on epochs. When anÁ ü¾` ] element gets removed from a concurrent collection, it is inserted into a pile of garbage andÁ üŸc ` marked with the current epoch. Every time a thread accesses a collection, it checks the currentÁ üƒa ^ epoch, attempts to increment it, and destructs some garbage that became so old that no threadÁ üå" can be referencing it anymore.Á ˆ ú üŒb _ That is the general mechanism behind epoch-based memory reclamation, but the details are a bitÁ üï` ] more complicated. Anyhow, memory reclamation is designed to be fully automatic and somethingÁ üÐ C @ users of concurrent collections don't have to worry much about.Á ”
|
|||
|
|
ú t˜
|
|||
|
|
# PointersÁ §
|
|||
|
|
ú ü«
|
|||
|
|
b _ Concurrent collections are built using atomic pointers. This module provides [`Atomic`], whichÁ üŽ ^ [ is just a shared atomic pointer to a heap-allocated object. Loading an [`Atomic`] yields aÁ üí a ^ [`Shared`], which is an epoch-protected pointer through which the loaded object can be safelyÁ LÏ read.Á Ù ú lÝ
|
|||
|
|
# PinningÁ ë ú üï b _ Before an [`Atomic`] can be loaded, a participant must be [`pin`]ned. By pinning a participantÁ üÒ
|
|||
|
|
X U we declare that any object that gets removed from now on must not be destructed justÁ ü«\ Y yet. Garbage collection of newly removed objects is suspended until the participant getsÁ lˆ
|
|||
|
|
unpinned.Á – ú lš
|
|||
|
|
# GarbageÁ ¨ ú ü¬a ^ Objects that get removed from concurrent collections must be stashed away until all currentlyÁ üŽ^ [ pinned participants get unpinned. Such objects can be stored into a thread-local or globalÁ üíR O storage, where they are kept until the right time for their destruction comes.Á À ú üÄk h There is a global shared instance of garbage queue. You can [`defer`](Guard::defer) the execution of anÁ ü°_ \ arbitrary function until the global epoch is advanced enough. Most notably, concurrent dataÁ ü�7 4 structures may defer the deallocation of an object.Á È ú TÌ # APIsÁ × ú üÛa ^ For majority of use cases, just use the default garbage collector by invoking [`pin`]. If youÁ ü½I F want to create your own garbage collector, use the [`Collector`] API.Á ü¼ üæ6 |™ ¸Ùô„®ŽŽÀ’
|
|||
|
|
¤“
|
|||
|
|
é ’
|
|||
|
|
1 þ÷
|
|||
|
|
‘
|
|||
|
|
? ÿV�
|
|||
|
|
u ‚™
|
|||
|
|
�
|
|||
|
|
5 ƒ´Ž
|
|||
|
|
Ë „¹�
|
|||
|
|
P …¶Œ
|
|||
|
|
Ç †ì‹
|
|||
|
|
� ‡° Š
|
|||
|
|
¿ ‰® ‰
|
|||
|
|
Ï Š½%ˆ
|
|||
|
|
¨ Œ¨#‡
|
|||
|
|
‹ �ÿ4†
|
|||
|
|
› ¢Ö …
|
|||
|
|
™ £ÿ
|
|||
|
|
„
|
|||
|
|
— ¤ª°l� óµ ̱ ü« ! ‰ t× „Ö ÜÍ L‘ ‹dÈ* µ œ¡ $° ¥¦¬ÿ# ¥ ÍìÖC „$ ¥C
|
|||
|
|
ü¹$1 Í$ ÖC¥C
|
|||
|
|
ÖCâeüÞ%@ $ì% ë ë¥C Ø
|
|||
|
|
£ £ Ø
|
|||
|
|
|
|||
|
|
|
|||
|
|
ô% ÍìÓ‘ ñ% ÍìΑ Ôþ% –"ΑÆI ¬ƒ& Α³’˜" Ó‘ —&
|
|||
|
|
ÖCӑΑ$õ% ± û% _a [] üò&B D€' ì ì¥C � Ó‘ £ �
|
|||
|
|
|
|||
|
|
Œ' †’ ‰' Íì¿“ Ä–' –"¿“öa œ›' ¿“™”˜" Ó‘ '
|
|||
|
|
ÖCÓ‘¿“$�' ± “' _a [] œù' $ˆ( K ˆ* †J ¬—( 4¦( ¦tð( ›_ ¼,€) –_ AtomicPtrÁL‡) ¯] AtomicUsizeÁ\’) „Ä ®DŸ) ¼À ”Ê( vxgiOQ57%'„û) ŒÃ* ?”“+ Tâ+ »¤Œ²+ óµ ÌÅ+ ü±+. ü¨+9 4æ+ /15?HJLNPcuÇË�ÕF � 4( èØ Y4C ZLK £ ‹ a ‹ × p ` ’b\‡ • !’b – !í$¤ ë #ÂD\ª ÑÛ $r,È é! & DerefMutÁDÏ ö! 'µ ä “ (ž,ó ‰f )¨#,� ‹ *ß”\¹ „Ä , ®DÆ ¼À -
|
|||
|
|
AtomicConsumeÁlî ” .Œmœad4UXJML[ALj5Ìy)L˜
|
|||
|
|
žþ L¼ôöÝßLÞÒ\íÅœÿ¸ô˜ª¬—™üÕ&|ü–8Ô™ ªDªD
|
|||
|
|
/ ordÁ ´tÙü‡% üå; 8 The error returned on failed compare-and-set operation.Á "Use `CompareExchangeError` insteadÁüà$ üÌ:”� íš ‚
|
|||
|
|
2 ¥ 3 ¡ 4 4 2 3 Íì˜D § ÍìžD ª 5 5 ™
|
|||
|
|
9É
|
|||
|
|
:æ »c,ç´ÏÆ ‚
|
|||
|
|
˜DžD£UW RT ü�I üÐ< 9 The error returned on failed compare-and-swap operation.Á ¤˜ ‚
|
|||
|
|
6 ¥ 7 ¡ 8 8 6 7 Îì˜D ± èœ È P˜D L½ ÇžD˜D TË ˜D ‚
|
|||
|
|
»Í÷œ »c,ç´ÏÆ 9:[] `b Ôª üÝH E The value in the atomic pointer at the time of the failed operation.Á<® 5 5 ûHT‡
|
|||
|
|
üË 7 4 The new value, which the operation failed to store.Á ‹
|
|||
|
|
5 5 žDü–
|
|||
|
|
Q 8 í ¥ < ¡ = í = < Øœ ›
|
|||
|
|
èœ ž
|
|||
|
|
ûžT¡
|
|||
|
|
¿cžD T®
|
|||
|
|
ãC> Àc > /1 46 üî
|
|||
|
|
8 ñ
|
|||
|
|
î ï ð îãC ï c c ˆ ¢cµ
|
|||
|
|
` £c bufÁ ` àB¤GS
|
|||
|
|
ðÖ¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
¢dŸÈŸÈ È ErrorÁ O˜éBL ; õ
|
|||
|
|
;
|
|||
|
|
> 8˜DžD$ö
|
|||
|
|
± ü
|
|||
|
|
üÛ üÉ 4 1 Memory orderings for compare-and-set operations.Á þ ú ü‚
|
|||
|
|
[ X A compare-and-set operation can have different memory orderings depending on whether itÁ üÞ
|
|||
|
|
\ Y succeeds or fails. This trait generalizes different ways of specifying memory orderings.Á »ú ü¿A > The two ways of specifying orderings for compare-and-set are:Á �ú ü…^ [ 1. Just one `Ordering` for the success case. In case of failure, the strongest appropriateÁ Ôä ordering is chosen.Á üÿ\ Y 2. A pair of `Ordering`s. The first one is for the success case, while the second one isÁ äÜ for the failure case.Á Š`compare_and_set` and `compare_and_set_weak` that use this trait are deprecated, use `compare_exchange` or `compare_exchange_weak instead`Áü½š ü¤¶ ¬å ë¨ ? ? Îì üÛß ? ª« ª« @A@A A @ ô¹ ü�3 0 The ordering of the operation when it succeeds.Á<¼ ë¨Ì ñ ñ²« ªD ? Ä ?
|
|||
|
|
@²«$Åôš üÝ0 - The ordering of the operation when it fails.Á ’ú üš] Z The failure ordering can't be `Release` or `AcqRel` and must be equivalent or weaker thanÁ Ìü the success ordering.Á<� ë¨ù ò ò²« ªD ? ¥ ?
|
|||
|
|
A²«$¦üÑ' ªDCD @ A D C ì�<� ó óªD ªD B ˜ B
|
|||
|
|
C $™ìÔ<× ô ôªD ªD B ß B
|
|||
|
|
D $àü¼3 ŸEFG @ A F G ì„<‡ õ õŸE ªD E � E
|
|||
|
|
F $�ìÌ<Ï ö öŸE ªD E × E
|
|||
|
|
G $Øüï-Dò Ô_ ¥ I I ÎìÖC û PÖC L‡
|
|||
|
|
HÖC üŠ4t� Ô_¢d ¥ K K ê² œ ú²L¨
|
|||
|
|
JÖC@ ³ ü¯ G\² Ô_Ô_Ô_ ¥ M M ê² ¾ ú²LÊ
|
|||
|
|
LÖCâ$Õ Ø â #% üƒ Fl† Ô_Ô_Ô_ ¥ O O ê² ” ú²L
|
|||
|
|
NÖCâ$« œÈ' ü… / , Types that are pointed to by a single word.Á µ ú ü¹ b _ In concurrent programming, it is necessary to represent an object within a word because atomicÁ üœ!_ \ operations (e.g., reads, writes, read-modify-writes) support only single words. This traitÁ üü!> ; qualifies such types that are pointed to by a single word.Á »"ú ü¿"\ Y The trait generalizes `Box<T>` for a sized type `T`. In a box, an object of type `T` isÁ üœ#c ` allocated in heap and it is owned by a single-word pointer. This trait is also implemented forÁ ü€$d a `[MaybeUninit<T>]` by storing its size along with its elements and pointing to the pair of arrayÁ ´å$ size and elements.Á ü$ú ü€%] Z Pointers to `Pointable` types can be stored in [`Atomic`], [`Owned`], and [`Shared`]. InÁ üÞ%G D particular, Crossbeam supports dynamically sized slices as follows.Á ¦&ú <ª& ```Á ô²& use std::mem::MaybeUninit;Á üÑ& use crossbeam_epoch::Owned;Á ñ&ú üõ&J G let o = Owned::<[MaybeUninit<i32>]>::init(10); // allocating [i32; 10]Á <À'�¼ LÒ' P P ª«üÈ'Ö P ª« ª« QRSTVXQRSTVX Í첫 R TÀ( ¡¿ X V T S ”„( ìâ' The alignment of pointer.Á,Š( P P Ô_LÀ( ô�( The type for initializers.Á$Å( P P ü×)* üÐ(- * Initializes a with the given initializer.Á ‚)ú dŠ) # SafetyÁ ›)ú ü£)/ , The result should be a multiple of `ALIGN`.Á$á) ©¿Ô_ P P
|
|||
|
|
S²«à$æ)üÇ,, ü‡*# Dereferences the given pointer.Á ¯*ú d·*™À È*ú üÐ*L I - The given `ptr` should have been initialized with [`Pointable::init`].Á ü¡+D A - `ptr` should not have yet been dropped by [`Pointable::drop`].Á üê+X U - `ptr` should not be mutably der
|
|||
|
|
`Shared`.Á ¤lú ü¬lZÃã t‹m¦ä žmú t¦m¼Û ¹mú <Ám�¼ üÍm9 6 use crossbeam_epoch::{self as epoch, Atomic, Shared};Á ü‹n,«å ¼nú ôÄn¢Ü ôçnùå üŠo2 / let p = a.swap(Shared::null(), SeqCst, guard);Á üÁo4 1 # unsafe { drop(p.into_owned()); } // avoid leakÁ <úo�¼$�p Œ ú ú�F ÁõªD Œ’P � � ì „â …í Ê,8ܪÏý ŒÖC €¡ � � ’p € ïõ –p €öT™p
|
|||
|
|
‹ÖCÁõ$¦pæ ¬p‘š ´p ÃpDF;= üò~Š ü¼q` ] Stores the pointer `new` (either `Shared` or `Owned`) into the atomic pointer if the currentÁ ü¡r^ [ value is the same as `current`. The tag is also taken into account, so two pointers to theÁ ü„sG D same object, but with different tags, will not be considered equal.Á Ðsú üØs_ \ The return value is a result indicating whether the new pointer was written. On success theÁ ü¼t[ X pointer that was written is returned. On failure the actual current value and `new` areÁ lœu
|
|||
|
|
returned.Á ®uú ü¶uE B This method takes two `Ordering` arguments to describe the memoryÁ ü€vQ N ordering of this operation. `success` describes the required ordering for theÁ üÖv[ X read-modify-write operation that takes place if the comparison with `current` succeeds.Á ü¶wZ W `failure` describes the required ordering for the load operation that takes place whenÁ ü•xR O the comparison fails. Using `Acquire` as success ordering makes the store partÁ üìxN K of this operation `Relaxed`, and using `Release` makes the successful loadÁ ü¿yP M `Relaxed`. The failure ordering can only be `SeqCst`, `Acquire` or `Relaxed`Á ü”zB ? and must be equivalent to or weaker than the success ordering.Á Ûzú tãz¼Û özú <þz�¼ üŠ{@ = use crossbeam_epoch::{self as epoch, Atomic, Owned, Shared};Á üÏ{,«å €|ú ôˆ|¢Ü «|ú ô³|ùå üÖ|% " let curr = a.load(SeqCst, guard);Á ü€}O L let res1 = a.compare_exchange(curr, Shared::null(), SeqCst, SeqCst, guard);Á üÔ}Q N let res2 = a.compare_exchange(curr, Owned::new(5678), SeqCst, SeqCst, guard);Á üª~7 4 # unsafe { drop(curr.into_owned()); } // avoid leakÁ <æ~�¼„ù~ � û ü û�F � � ì „â …í Ê,8ܪÏý üÖCÁõªDªD �’P Ö¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
� � ì „â …í Ê,8ܪÏý �ÖC 5 5 ™
|
|||
|
|
9É
|
|||
|
|
:æ »c,ç´ÏÆ �ÖCÁõ €¡ � � Š € ïõ Ž €öTñ€
|
|||
|
|
ŽÖCÁõ$›É
|
|||
|
|
<©æ É“<Ù¡<ô �€UWLN •‚ Ž <closure_kind>Á ‘ <closure_signature>Á ‘ <upvars>Á ‘ ‘ Ž ‘ÖCÁõ Ô_ � � ì „â …í Ê,8ܪÏý ÖC Ô_ LÒ‚ ŽêŒ ’ ƒ� ’ ¡� ’ ’ Ž ’ÖCÁõ ÒŽ 5 5 ™
|
|||
|
|
9É
|
|||
|
|
:æ »c,ç´ÏÆ ÖCÁõ –�üå—� üŸ„`žû ü„…^ˆü üç…Gðü ³†ú ü»†_ \ Unlike [`compare_exchange`], this method is allowed to spuriously fail even when comparisonÁ üŸ‡_ \ succeeds, which can result in more efficient code on some platforms. The return value is aÁ üƒˆZ W result indicating whether the new pointer was written. On success the pointer that wasÁ üâˆT Q written is returned. On failure the actual current value and `new` are returned.Á »‰ú üÉE½ÿ ü�ŠQŒ€ üãŠ[ç€ üËZÌ� ü¢ŒR°‚ üùŒNŒƒ üÌ�Päƒ ü¡ŽB¾„ èŽú üðŽ2 / [`compare_exchange`]: Atomic::compare_exchangeÁ §�ú t¯�¼Û Â�ú <Ê��¼ üÖ�@¼… ü›�,«å Ì�ú ôÔ�¢Ü ô÷�ùå š‘ú ü¢‘# let mut new = Owned::new(5678);Á üÊ‘( % let mut ptr = a.load(SeqCst, guard);Á ü÷‘H E # unsafe { drop(a.load(SeqCst, guard).into_owned()); } // avoid leakÁ TÄ’ loop {Á üÓ’H E match a.compare_exchange_weak(ptr, new, SeqCst, SeqCst, guard) {Á ´ “ Ok(p) => {Á Ä»“ ptr = p;Á ´Ø“ break;Á ló“
|
|||
|
|
}Á Ì…” Err(err) => {Á ü£”" ptr = err.current;Á ôÊ” new = err.new;Á lí”ú˜ Lÿ” }Á ,�• }Á —•ú üŸ•) & let mut curr = a.load(SeqCst, guard);Á TÍ•±— üÜ•T Q match a.compare_exchange_weak(curr, Shared::null(), SeqCst, SeqCst, guard) {Á ܵ– Ok(_) => break,Á üÕ–+ ( Err(err) => curr = err.current,Á L…——š ,“—ªš ü�—7©ˆ <Ù—�¼¬ì— ” ý þ ý�F � � ì „â …í Ê,8ܪÏý þÖCÁõªDªD ”’P Ö¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
� � ì „â …í Ê,8ܪÏý ”ÖC 5 5 ™
|
|||
|
|
9É
|
|||
|
|
:æ »c,ç´ÏÆ ”ÖCÁõ €¡ • • ‚˜ € ïõ †˜ €öTé™
|
|||
|
|
“ÖCÁõ$“˜É
|
|||
|
|
<¡˜æ Á˜“<ј¡<ì˜ ‡™\^RT ’› “êŒ – ƒ� – ¡� – – “ –ÖCÁõÏŽ–�LÏ› “êŒ — ƒ� — ¡� — — “ —ÖCÁõû�–�üô«† üœ�T Q Fetches the pointer, and then applies a function to it that returns a new value.Á üõ�^ [ Returns a `Result` of `Ok(previous_value)` if the function returned `Some`, else `Err(_)`.Á Øžú üàž^ [ Note that the given function may be called multiple times if the value has been changed byÁ üß^ [ other threads in the meantime, as long as the function returns `Some(_)`, but the functionÁ ü¦ 9 6 will have been applied only once to the stored value.Á ä ú üì J G `fetch_update` takes two [`Ordering`] arguments to describe the memoryÁ ü»¡M J ordering of this operation. The first describes the required ordering forÁ ü�¢F C when the operation finally succeeds while the second describes theÁ üØ¢L I required ordering for loads. These correspond to the success and failureÁ ü©£; 8 orderings of [`Atomic::compare_exchange`] respectively.Á é£ú üñ£F C Using [`Acquire`] as success ordering makes the store part of thisÁ ü¼¤K H operation [`Relaxed`], and using [`Release`] makes the final successfulÁ üŒ¥H E load [`Relaxed`]. The (failed) load ordering can only be [`SeqCst`],Á üÙ¥K H [`Acquire`] or [`Relaxed`] and must be equivalent to or weaker than theÁ ¬©¦ success ordering.Á æú ü˦" [`Relaxed`]: Ordering::RelaxedÁ üò¦" [`Acquire`]: Ordering::AcquireÁ ü™§" [`Release`]: Ordering::ReleaseÁ üÀ§ [`SeqCst`]: Ordering::SeqCstÁ å§ú tí§¼Û €¨ú <ˆ¨�¼ ü”¨1ðä üʨ,«å û¨ú ôƒ©¢Ü ô¦©ùå É©ú üÑ©N K let res1 = a.fetch_update(SeqCst, SeqCst, guard, |x| Some(x.with_tag(1)));Á Ô¤ª assert!(res1.is_ok());Á êú ü˪? < let res2 = a.fetch_update(SeqCst, SeqCst, guard, |x| None);Á Ü�« assert!(res2.is_err());Á ü¯«4ÊÜ <è«�¼dû« ÿ ÿ�F ªDªD ‚
|
|||
|
|
’P —Ö¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
� � ì „â …í Ê,8ܪÏý ‚
|
|||
|
|
ÖC¥³ €‚
|
|||
|
|
™ — š š ™ ˜¬ € ÍìÒ² Œ¬ “"Ò²¥³ üÌ- Ò²¹´˜" ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ¥³¬ä
|
|||
|
|
˜ÖC ‚
|
|||
|
|
Ò²$™¬ set_orderÁL§¬
|
|||
|
|
fail_orderÁTĬ£,⬠funcÁ$€ˆ¬ÖØ ü¸¾Š üÝ°`žû ü±^ˆü ü¥²Gðü ñ²ú üù²_Íý üݳ[¶þ l½´šÿ Ï´ú ü×´U R This method takes a [`CompareAndSetOrdering`] argument which describes the memoryÁ ü±µ ordering of this operation.Á Õµú üݵ% " # Migrating to `compare_exchange`Á ‡¶ú ü�¶X U `compare_and_set` is equivalent to `compare_exchange` with the following mapping forÁ ¬ì¶ memory orderings:Á †·ú üŽ· Original | Success | FailureÁ ü³· -------- | ------- | -------Á üØ· Relaxed | Relaxed | RelaxedÁ üý· Acquire | Acquire | AcquireÁ ü¢¸ Release | Release | RelaxedÁ üǸ AcqRel | AcqRel | AcquireÁ üì¸ SeqCst | SeqCst | SeqCstÁ �¹ú t˜¹¼Û «¹ú <³¹�¼ Ü¿¹ # #![allow(deprecated)]Á üß¹@¼… ü¤º,«å Õºú ôݺ¢Ü €»ú ôˆ»ùå ü«»%Ɔ üÕ»F C let res1 = a.compare_and_set(curr, Shared::null(), SeqCst, guard);Á ü ¼H E let res2 = a.compare_and_set(curr, Owned::new(5678), SeqCst, guard);Á üí¼7©ˆ <©½�¼ Use `compare_exchange` insteadÁü‘¾ üý½6|¿¾ ˜¾, œ € � €�F � � ì „â …í Ê,8ܪÏý �ÖCžD œ’P Ö¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
� � ì „â …í Ê,8ܪÏý œÖC 5 5 ™
|
|||
|
|
9É
|
|||
|
|
:æ »c,ç´ÏÆ œÖCžD € � ¡ ž � ž Ͼ € ÍìÌÀ Ó¾ èœ Ö¾ ?ÌÀ ¬•À ÇžDÖC T·À
|
|||
|
|
›ÖCÌÀžD$ã¾É
|
|||
|
|
<ñ¾æ ‘¿‘š ¡¿£,±¿„†qs uw ü¡Õ� ü¥Á`žû üŠÂ^ˆü üíÂGðü ¹Ãú üÁÃ^ [ Unlike [`compare_and_set`], this method is allowed to spuriously fail even when comparisonÁ ü¤Ä_÷� üˆÅZá‘ üçÅTÆ’ ÀÆú üÈÆU‘¶ ü¢Ç ñ¶ ÆÇú üÎÇ0 - [`compare_and_set`]: Atomic::compare_and_setÁ ƒÈú ü‹È* ' # Migrating to `compare_exchange_weak`Á ºÈú üÂÈb _ `compare_and_set_weak` is equivalent to `compare_exchange_weak` with the following mapping forÁ ¬©ÉǸ ÃÉú üËÉ ô¸ üðÉ Ÿ¹ ü•Ê ʹ üºÊ õ¹ üßÊ º ü„Ë Ëº ü©Ë öº ÍËú tÕË¼Û èËú <ðË�¼ ÜüËÕ» üœÌ@¼… üáÌ,«å ’Íú ôšÍ¢Ü ô½Íùå àÍú üèÍ#þ• ü�Î(¬– ü½ÎHß– TŠÏ±— ü™Ï? < match a.compare_and_set_weak(ptr, new, SeqCst, guard) {Á ´ÝϘ˜ Äøϸ˜ ´•ÐÚ˜ l°Ðú˜ ÌÂБ™ üàÐ"µ™ ô‡Ñá™ lªÑú˜ L¼Ñ—š ,ÊѪš ÔÑú üÜÑ)Çš TŠÒ±— ü™ÒK H match a.compare_and_set_weak(curr, Shared::null(), SeqCst, guard) {Á ÜéÒç› ü‰Ó+�œ L¹Ó—š ,ÇÓªš üÑÓ7©ˆ <�Ô�¼ #Use `compare_exchange_weak` insteadÁüõÔ% üáÔ;¤¨Õ ˆÍ, ‚ ƒ ‚�F � � ì „â …í Ê,8ܪÏý ƒÖCžDÌÀ ’P Ö¿Ù¿ Ú¿« Û¿ˆ Ü¿ Ý¿Þ¿ˆ ‚†f|Â
|
|||
|
|
� � ì „â …í Ê,8ܪÏý ÖC 5 5 ™
|
|||
|
|
9É
|
|||
|
|
:æ »c,ç´ÏÆ ÖCžD € ¡ ¡ ¢ ¢ ¡ ½Õ € â ÁÕ èœ ÄÕ ý¬ƒ× �ÃT¥×
|
|||
|
|
ŸÖCÌÀžD$ÑÕÉ
|
|||
|
|
<ßÕæ ÿÕ‘š �Ö£,ŸÖjl`b df üìÝU ü˜Ø' $ Bitwise "and" with the current tag.Á ÄØú üÌØ^ [ Performs a bitwise "and" operation on the current tag and the argument `val`, and sets theÁ ü¯Ù8 5 new tag to the result. Returns the previous pointer.Á ìÙú üôÙZÃã tÓÚ¦ä æÚú tîÚ¼Û �Ûú <‰Û�¼ ü•Û9¤÷ üÓÛ,«å „Üú
|
|||
|
|
` £cý¡ ` àB¤GS
|
|||
|
|
‰¤£ « è‚ «
|
|||
|
|
ÖC$邱 ï‚ü……6 ¥ ¯ ¯ ê² Š… ú²L–…�F° Ïc ° üÂ…8 Å… Š ‹ Œ Š�F ‹ c c ˆ ¢cµ
|
|||
|
|
` £cý¡ ` àB¤GS
|
|||
|
|
Œ¤£ ® É… ®
|
|||
|
|
°ÖC$Ê…± Ð…ü²‡/ ¥ ² ² ê² ·‡ ú²LÇ�F³ Ù ³ ¼—‰ üè‡' $ Returns a copy of the atomic value.Á ”ˆú üœˆ[ X Note that a `Relaxed` load is used here. If you need synchronization, use it with otherÁ ´üˆ atomics or fences.Á,š‰ � ��F �F ± ‰ ±
|
|||
|
|
³ÖC$¡‰ü‘Š1 ¥ µ µ ê² –Š ú²L¢Š�F¶ ´ ¶ ¤ÉŠ<ÌŠ �F ´ ´
|
|||
|
|
¶ÖCü€‹8 ¥ ¸ ¸ ê² …‹ ú²L‘‹�F¹ ë ¹ üÚ� ü¿‹5 2 Returns a new atomic pointer pointing to `owned`.Á ù‹ú t�Œ¼Û ”Œú <œŒ�¼ ü¨Œ) & use crossbeam_epoch::{Atomic, Owned};Á ÖŒú üÞŒ2 / let a = Atomic::<i32>::from(Owned::new(1234));Á ü•�4ÊÜ <Î��¼$Ý� ‚G�F · ·
|
|||
|
|
¹ÖC ownedÁ,â�üàŽ" ¥ » » ±� åŽ�F¼ ë ¼ Ô‰�$Œ� ÇG�F º º
|
|||
|
|
¼ÖC ‘�ìÒ� ¥ ¾ ¾ ±� ×��F¿ ë ¿ ¬ö�$ù� ÖC�F ½ ½
|
|||
|
|
¿ÖC¿ þ�ü¬�A ‚
|
|||
|
|
Á ¥   Á Õž µ� ížLÁ�ÅHà ë à ±�#% üÚ’# üô�3 0 Returns a new atomic pointer pointing to `ptr`.Á ¬‘ú t´‘¼Û Ç‘ú <Ï‘�¼ üÛ‘* ' use crossbeam_epoch::{Atomic, Shared};Á Š’ú ü’’7 4 let a = Atomic::<i32>::from(Shared::<i32>::null());Á <Î’�¼$Ý’ ûHÅH À À
|
|||
|
|
à ‚
|
|||
|
|
˜Dµ â’ü¬“$ ¥ Å Å ±� ±“�FÆ ë Æ ôÆ• üד3 0 Returns a new atomic pointer pointing to `raw`.Á �”ú t—”¼Û ª”ú <²”�¼ Œ¾” use std::ptr;Á üÔ” íÛ ù”ú ü�•4 1 let a = Atomic::<i32>::from(ptr::null::<i32>());Á <º•�¼$É• ÆI�F Ä Ä
|
|||
|
|
ÆÖC@ ΕüÌ–( ü—–4 1 A trait for either `Owned` or `Shared` pointers.Á <Ö– Ç ¥ È Ç È ª«üÌ–Ì Õž Þ– ížLê– Ç ª«- ª«3ÉÊÉÊ Ê É =? 춗 üû–6 3 Returns the machine representation of the pointer.ÁT¹— ²«Ô_ Ç Ç
|
|||
|
|
ɲ«˜D$Ä—üì™* üÙ—@ = Returns a new pointer pointing to the tagged pointer `data`.Á ž˜ú d¦˜™À ·˜ú ü¿˜_ \ The given `data` should have been created by `Pointer::into_usize()`, and one `data` shouldÁ ü£™D A not be converted back by `Pointer::from_usize()` multiple times.ÁTö™ Ô_²« Ç Ç
|
|||
|
|
ʲ«˜Dâ$�šüÿ›' üšš# An owned heap-allocated object.Á ¾šú üš* ' This type is very similar to `Box<T>`.Á íšú üñšbþÓ üÔ›* ' least significant bits of the address.Á ,Šœ ¥ Ì Ì ê² �œ ú²Lœœ‚G ݶçPrhìþ ÍÎ á,. \œ$œ Ë Ë Ô_侜<¾œ Ë Ë • • – ’b Fu\»ŸÇGüßœ3 ¥ Ð Ð ê² äœ ú²Lðœ‚GÑÒ É Ê Ñ Ò ') ä§�Tª� ‚GÔ_ Ï Ï
|
|||
|
|
ÑÖC$µ�ü½Ÿ) ü—ž@¸‹ Üžú däž¿å õžú üýž- * Panics if the data is zero in debug mode.ÁTÇŸ Ô_‚G Ï Ï
|
|||
|
|
ÒÖCâ$ÒŸ„‚¡ ¥ Ô Ô ±� ‡¡‚GÕÖ× ü÷¦/ ü™¡2 / Returns a new owned pointer pointing to `raw`.Á Сú üØ¡\ Y This function is unsafe because improper use may lead to memory problems. Argument `raw`Á ü¹¢] Z must be a valid pointer. Also, a double-free may occur if the function is called twice onÁ Ì›£ the same raw pointer.Á ¹£ú dÁ£¿å Ò£ú üÚ£, ) Panics if `raw` is not properly aligned.Á ‹¤ú d“¤™À ¤¤ú ü¬
|
|||
|
|
` £cý¡ ` àB¤GS
|
|||
|
|
’¤£ â ž½ â
|
|||
|
|
äÖC$Ÿ½± ¥½üŠ¿! ¥ æ æ ±� �¿ ØÖC ,’¿‚Gç Ù ç #% ¼²¿,µ¿ “ “‚G ‚G å »¿ å
|
|||
|
|
çÖC$¼¿ü�À. ¥ é é ê² ”À ú²L À‚Gêë ê! ë! ë #% \ÄÀ4ÉÀ è è ÖC¬ÚÀ,ÝÀ ” ”‚G ”ÖC è ãÀ è
|
|||
|
|
ëÖC$äÀüÒÁ1 ¥ í í ê² ×Á ú²LãÁ‚Gî ÷! î üŠÂ!L� • •‚G •ÖC ì —Â ì
|
|||
|
|
îÖC$œÂä’à ¥ ð ð ±� —ÂGñ ë ñ ¬µÃ$¸Ã ÖC‚G ï ï
|
|||
|
|
ñÖC¿ ½ÃüìÃ! ¥ ó ó ±� ñÂGô ë ô ÔßÆ ü”Ä0 - Returns a new owned pointer pointing to `b`.Á ÉÄú dÑÄ¿å âÄú üêÄ> ; Panics if the pointer (the `Box`) is not properly aligned.Á Åú tµÅ¼Û ÈÅú <ÐÅ�¼ üÜŠǼ €Æú üˆÆF‚š <ÓÆ�¼$âÆ ÇG‚G ò ò
|
|||
|
|
ôÖC çÆü¹Ç2 ¥ ö ö ê² ¾Ç ú²LÊÇ‚G÷ ¢ ÷ ´òÇ4õÇ – –‚G –ÖC õ üÇ õ
|
|||
|
|
÷ÖC$ýÇü©È5 ¥ ù ù ê² ®È ú²LºÈ‚Gú ¥ ú üåÈ"TèÈ — —‚G —ÖC ø óÈ ø
|
|||
|
|
úÖC$øÈü¬É1 ¥ ü ü ê² ±É ú²L½É‚Gý â ý ´äÉ4çÉ ˜ ˜‚G ˜ÖC û îÉ û
|
|||
|
|
ýÖC$ïÉü›Ê1 ¥ ÿ ÿ ê² Ê ú²L¬Ê‚G€ å € ôÓÊ4ÖÊ ™ ™‚G ™ÖC þ ÝÊ þ
|
|||
|
|
€ÖC$âÊü¢Í1 ü–Ë5 2 A pointer to an object protected by the epoch GC.Á ÌËú üÐË? < The pointer is valid for use only during the lifetime `'g`.Á �Ìú ü”ÌbþÓ ü÷Ì*¾� 4Í ‚
|
|||
|
|
‚ ¥ ƒ ‚ ƒ Õž ¸Í �ŸO ížLÉÍûH Ê,8ܪÏý „…´Í79 ‚\ÚÍ$ÚÍ � � Ô_üëÍ(<ëÍ � � • • – ’b Fu\»Ÿ ‚
|
|||
|
|
¢d ÀKü˜Î3 8 š ¥ ‡ š ‡ Õž �Î ížL©ÎßJˆ Ù ˆ ¼ÒÎ,ÕÎ › ›ßJ ßJ † ÛÎ †
|
|||
|
|
ˆ 8˜D$ÜÎüƒÏ2 8 œ ¥ Š œ Š Õž ˆÏ ížL”ÏßJ üºÏ8 8 � ¥ Œ � Œ Õž ¿Ï ížLËÏßJ�Ž É Ê � Ž ') ä‡ÐTŠÐ ßJÔ_ ‹ ‹
|
|||
|
|
� 8˜D$•ÐüÑÐ)TÛÐ Ô_ßJ ‹ ‹
|
|||
|
|
Ž 8˜Dâ$æÐÌÕÑ ‚
|
|||
|
|
� ¥ ‘ ‘ � Øœ ÞÑûH’ ÚÑ üýÕ üõÑ< 9 Converts the pointer to a raw pointer (without the tag).Á ¶Òú t¾Ò¼Û ÑÒú <ÙÒ�¼ üåÒ8 5 use crossbeam_epoch::{self as epoch, Atomic, Owned};Á ü¢Ó,«å ÓÓú ìÛÓ°œ ôýÓ let raw = &*o as *const _;Á ä Ô let a = Atomic::from(o);Á ÁÔú ôÉÔùå üìÔ"¡æ ü“Õ assert_eq!(p.as_raw(), raw);Á ü¸Õ4ÊÜ <ñÕ�¼4„Ö ž žûH ÀK � ‹Ö �
|
|||
|
|
’ ‚
|
|||
|
|
˜D$ŒÖü÷Ö- ‚
|
|||
|
|
” ¥ • ” • Õž €× ížLŒ×ûH–—˜™š›œ�ž üÖ35 ôüØ ü«× Returns a new null pointer.Á Ï×ú t××¼Û ê×ú <ò×�¼ üþ× use crossbeam_epoch::Shared;Á £Øú ü«Ø" let p = Shared::<i32>::null();Á ÌÒØ assert!(p.is_null());Á <ðØ�¼$ƒÙ ûH “ “
|
|||
|
|
– ‚
|
|||
|
|
˜DìæÝ üúÙ* ' Returns `true` if the pointer is null.Á ©Úú t±Ú¼Û ÄÚú <ÌÚ�¼ üØÚ8ØÆ ü•Û,«å ÆÛú ÜÎÛ let a = Atomic::null();Á ôîÛùå
|
|||
|
|
,�œüÂœ0 8 ¨ ¥ § ¨ § Õž Çœ ížLÓœßJ ü÷œK ‚
|
|||
|
|
© ¥ ª © ª Õž €� ížLŒ�ûH« ïß « üœ$& üÉ�<\Ì� © ª ©ûH ªûH ۼݼ޼© ß¼ à¼ÛἈ cSñŸ«‡zÙ¿ßÀßÁß LessÁ Âß ÃßÄß~ Åß ÆßÇß GreaterÁ Èß åºÝÈnûê7 ¨ Ø� ¨
|
|||
|
|
« ‚
|
|||
|
|
˜D$Ù�¹
|
|||
|
|
,ß�ü¼ž1 8 « ¥ « Õž Áž ížLÍžßJ® » ® üôž, ÷ž ¬ ¬ßJ ßJ çƒ ¬ ûž ¬
|
|||
|
|
® 8˜D$üž¹
|
|||
|
|
,‚ŸüÏŸ8 8 ® ¥ ° ° ® Õž ÔŸ ížLàŸßJ± Àc ± üŽ 8 ‘ ¯ ° ± ¯ßJ ° c c ˆ ¢cµ
|
|||
|
|
` £cý¡ ` àB¤GS
|
|||
|
|
±¤£ ¯ • ¯
|
|||
|
|
± 8˜D$– ± œ ü‚¢: 8 ² ¥ ³ ² ³ Õž ‡¢ ížL“¢ßJ´ Ïc ´ üâ8 Æ¢ ³ ´ µ ³ßJ ´ c c ˆ ¢cµ
|
|||
|
|
` £cý¡ ` àB¤GS
|
|||
|
|
µ¤£ ² Ê¢ ²
|
|||
|
|
´ 8˜D$Ë¢± Ñ¢üÌ£5 8 ¶ ¥ ¶ ¶ ¶ Õž Ñ£ ížLÝ£ßJ· ´ · ¤ˆ¤<‹¤ ßJ µ µ
|
|||
|
|
· 8˜Dl¨, »¤Œø+ óµ Ì‹, ü÷+. üî+9 L¬, ¿Ï× ³ ` ¸ ¹¨#,Ë ‹ ¸ ºæ(4è ä ¸ ¼ð),ð ï ¸ ½K ” †J ¸ ¾ Llœ½]|ÖNP=?Üü1¤À üš% " An epoch-based garbage collector.Á LË ›L êðL¹ƒ~/ô ÀôÛ4æ ¿ ¿ †J†J K ‰Jµ �7 ŠJ phantomÁ�7 ‹J¤�7 ·0ØQd�è ä ä æ( åô( ® æ‚) ® çî! ɼ÷XBš ‹Hôþ ›L ô ›L Ôà ›LÄ ´ Ä ¤ä<ç ›L à Ã
|
|||
|
|
Ä tÊ ›LÆÇ ¤€ äß Creates a new collector.Á ‡ ›L Å Å
|
|||
|
|
Æ üì% üº- * Registers a new handle for the collector.ÁDó · ·›L �M Å ü Å
|
|||
|
|
Ç $ýÄ» ›LÉ Ù É ¼› üÚ< 9 Creates another reference to the same garbage collector.Á,ž ¸ ¸›L ›L È ¤ È
|
|||
|
|
É $¥ì… ›LË Àc Ë ü© 8 ¬ ¹ º » ¹›L º c c ˆ ¢cµ
|
|||
|
|
` £cý¡ ` àB¤GS
|
|||
|
|
»¤£ Ê ° Ê
|
|||
|
|
Ë $± ± · ä�
|
|||
|
|
›LÍ ·ß Í üî
|
|||
|
|
% ü²
|
|||
|
|
7 4 Checks if both handles point to the same collector.Áñ
|
|||
|
|
¼ ½ ¼›L ½›L Ì ô
|
|||
|
|
Ì
|
|||
|
|
Í $õ
|
|||
|
|
rhsÁ û
|
|||
|
|
¬Í ›L ´Œ üç $ ! A handle to a garbage collector.Á \— �M k8,g
|
|||
|
|
öÀ Ð Öô© ,´ Ï Ï ’q„Ì �MÒÓÔ ÔŠ
|
|||
|
|
¤ã Pins the handle.Á ‘
|
|||
|
|
¾ ¾�M ’P Ñ •
|
|||
|
|
Ñ
|
|||
|
|
Ò $–
|
|||
|
|
ü— üÙ
|
|||
|
|
+ ( Returns `true` if the handle is pinned.ÁLž ¿ ¿�M Ñ ¨ Ñ
|
|||
|
|
Ó $©ü¼% üñ8 5 Returns the `Collector` associated with this handle.ÁLà À À�M À›L Ñ Í Ñ
|
|||
|
|
Ô $ÎÌš �MÖ �" Ö ”È$Ë Á Á�M¢d Õ Ð Õ
|
|||
|
|
Ö $Õü² �MØ Àc Ø üØ8 Û Â Ã Ä Â�M à c c ˆ ¢cµ
|
|||
|
|
` £cý¡ ` àB¤GS
|
|||
|
|
Ĥ£ × ß ×
|
|||
|
|
Ø $à± ædñ, »¤ŒÁ, óµ ÌÔ, üÀ,. ü·,9 Dõ, áâäÕF � Ù Ú× ! ` Ù Û’b\8 • Ù Ü’b – Ù Üí$U ë Ù ÞÂD\[ ÑÛ Ù ßµ s “ Ù àŒŽLÌ*pLIL O=?Lm/¼ôTúÙ Ô_LË$ÐÙ Ô_ ã Tß Ô_Ô• D§ ÍM Ð¥0ß”CW åæçĶ$¶Ù ä ä ›d¼Ô$ÔÙ ä ä ÑÛÑÛ ÂD ÓÛ×DÝ ÔÛ»Ý Íõƒ«%9§ ìñ<ñÙ ä ä ¥fä¤ ÍMé Àc é üÇC Ê Å Æ Ç ÅÍM Æ c c ˆ ¢cµ
|
|||
|
|
` £cý¡ ` àB¤GS
|
|||
|
|
Ǥ£ è Î è
|
|||
|
|
é $ϱ Õl· ÍMëíó äË,Ü ê ê ÍMäôT÷ Ù žd¢d –d _rawÁ$‚üÙ , ç —ÍM ê — î î ê Íìߤ ë –"ߤ¢d Dî ߤ¢d˜" ¢d
|
|||
|
|
íߤ± ø ;= üÍ )$× Ù žd¢d — ð 𠇥 Ü ˜¥Dß «¥
|
|||
|
|
ïߤ@ é "$ üÊ)$Ô Ù žd¢d — ò ò ‡¥ Ù ˜¥DÜ «¥
|
|||
|
|
ñߤ@ æ"$ äì$ú ÍM¢d ê ê
|
|||
|
|
ó $ƒL¹- »¤Œ‰- óµ Ìœ- üˆ-. üÿ,9 ,½- »¬ß”\“
|
|||
|
|
„Ä ô ö ®D
|
|||
|
|
¼À ô ÷ ôò
|
|||
|
|
35 TÈ
|
|||
|
|
šNùúûüýþ ü�
|
|||
|
|
D«
|
|||
|
|
šN ø ø
|
|||
|
|
ù üÔ
|
|||
|
|
4
|
|||
|
|
dâ
|
|||
|
|
|
|||
|
|
šNšN ø ø
|
|||
|
|
ú $ï
|
|||
|
|
|
|||
|
|
›– õ
|
|||
|
|
|
|||
|
|
ü•%
|
|||
|
|
L£
|
|||
|
|
šN ø ø
|
|||
|
|
û $
|
|||
|
|
ü©#
|