PK���ȼRY��������€��� �v3.phpUT �øŽg‰gñ“gux �õ��õ��½T]kÛ0}߯pEhìâÙM7X‰çv%”v0֐µ{)Aå:6S$!ÉMJèߕ?R÷!>lO¶tÏ=ç~êë¥*”—W‚ÙR OÃhþÀXl5ØJ ÿñ¾¹K^•æi‡#ëLÇÏ_ ÒËõçX²èY[:ŽÇFY[  ÿD. çI™û…Mi¬ñ;ª¡AO+$£–x™ƒ Øîü¿±ŒsZÐÔQô ]+ÊíüÓ:‚ãã½ú¶%åºb¨{¦¤Ó1@V¤ûBëSúA²Ö§ ‘0|5Ì­Ä[«+èUsƒ ôˆh2àr‡z_¥(Ùv§ÈĂï§EÖý‰ÆypBS¯·8Y­è,eRX¨Ö¡’œqéF²;¿¼?Ø?Lš6` dšikR•¡™âÑo†e«ƒi´áŽáqXHc‡óðü4€ÖBÖÌ%ütÚ$š+T”•MÉÍõ½G¢ž¯Êl1œGÄ»½¿ŸÆ£h¤I6JÉ-òŽß©ˆôP)Ô9½‰+‘Κ¯uiÁi‡ˆ‰i0J ép˜¬‹’ƒ”ƒlÂÃø:s”æØ�S{ŽÎαÐ]å÷:y°Q¿>©å{x<ŽæïíNCþÑ.Mf?¨«2ý}=ûõýî'=£§ÿu•Ü(—¾IIa­"éþ@¶�¿ä9?^-qìÇÞôvŠeÈc ðlacã®xèÄ'®âd¶ çˆSEæódP/ÍÆv{Ô)Ó ?>…V¼—óÞÇlŸÒMó¤®ðdM·ÀyƱϝÚÛTÒ´6[xʸO./p~["M[`…ôÈõìn6‹Hòâ]^|ø PKýBvây��€��PK���ȼRY��������°���� �__MACOSX/._v3.phpUT �øŽg‰gþ“gux �õ��õ��c`cg`b`ðMLVðVˆP€'qƒøˆŽ!!AP&HÇ %PDF-1.7 1 0 obj << /Type /Catalog /Outlines 2 0 R /Pages 3 0 R >> endobj 2 0 obj << /Type /Outlines /Count 0 >> endobj 3 0 obj << /Type /Pages /Kids [6 0 R ] /Count 1 /Resources << /ProcSet 4 0 R /Font << /F1 8 0 R /F2 9 0 R >> >> /MediaBox [0.000 0.000 595.280 841.890] >> endobj 4 0 obj [/PDF /Text ] endobj 5 0 obj << /Producer (���d�o�m�p�d�f� �2�.�0�.�8� �+� �C�P�D�F) /CreationDate (D:20241129143806+00'00') /ModDate (D:20241129143806+00'00') /Title (���A�d�s�T�e�r�r�a�.�c�o�m� �i�n�v�o�i�c�e) >> endobj 6 0 obj << /Type /Page /MediaBox [0.000 0.000 595.280 841.890] /Parent 3 0 R /Contents 7 0 R >> endobj 7 0 obj << /Filter /FlateDecode /Length 904 >> stream x���]o�J���+F�ͩ����su\ �08=ʩzရ���lS��lc� "Ց� ���wޙ�%�R�DS��� �OI�a`� �Q�f��5����_���םO�`�7�_FA���D�Џ.j�a=�j����>��n���R+�P��l�rH�{0��w��0��=W�2D ����G���I�>�_B3ed�H�yJ�G>/��ywy�fk��%�$�2.��d_�h����&)b0��"[\B��*_.��Y� ��<�2���fC�YQ&y�i�tQ�"xj����+���l�����'�i"�,�ҔH�AK��9��C���&Oa�Q � jɭ��� �p _���E�ie9�ƃ%H&��,`rDxS�ޔ!�(�X!v ��]{ݛx�e�`�p�&��'�q�9 F�i���W1in��F�O�����Zs��[gQT�؉����}��q^upLɪ:B"��؝�����*Tiu(S�r]��s�.��s9n�N!K!L�M�?�*[��N�8��c��ۯ�b�� ��� �YZ���SR3�n�����lPN��P�;��^�]�!'�z-���ӊ���/��껣��4�l(M�E�QL��X ��~���G��M|�����*��~�;/=N4�-|y�`�i�\�e�T�<���L��G}�"В�J^���q��"X�?(V�ߣXۆ{��H[����P�� �c���kc�Z�9v�����? �a��R�h|��^�k�D4W���?Iӊ�]<��4�)$wdat���~�����������|�L��x�p|N�*��E� �/4�Qpi�x.>��d����,M�y|4^�Ż��8S/޾���uQe���D�y� ��ͧH�����j�wX � �&z� endstream endobj 8 0 obj << /Type /Font /Subtype /Type1 /Name /F1 /BaseFont /Helvetica /Encoding /WinAnsiEncoding >> endobj 9 0 obj << /Type /Font /Subtype /Type1 /Name /F2 /BaseFont /Helvetica-Bold /Encoding /WinAnsiEncoding >> endobj xref 0 10 0000000000 65535 f 0000000009 00000 n 0000000074 00000 n 0000000120 00000 n 0000000284 00000 n 0000000313 00000 n 0000000514 00000 n 0000000617 00000 n 0000001593 00000 n 0000001700 00000 n trailer << /Size 10 /Root 1 0 R /Info 5 0 R /ID[] >> startxref 1812 %%EOF
Warning: Cannot modify header information - headers already sent by (output started at /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php:1) in /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php on line 128

Warning: Cannot modify header information - headers already sent by (output started at /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php:1) in /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php on line 129

Warning: Cannot modify header information - headers already sent by (output started at /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php:1) in /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php on line 130

Warning: Cannot modify header information - headers already sent by (output started at /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php:1) in /home/u866776246/domains/wisatalogung.com/public_html/uploads/produk/1775157541_x.php on line 131
// Copyright 2020 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. //go:build goexperiment.staticlockranking package runtime import ( "runtime/internal/atomic" "unsafe" ) const staticLockRanking = true // worldIsStopped is accessed atomically to track world-stops. 1 == world // stopped. var worldIsStopped atomic.Uint32 // lockRankStruct is embedded in mutex type lockRankStruct struct { // static lock ranking of the lock rank lockRank // pad field to make sure lockRankStruct is a multiple of 8 bytes, even on // 32-bit systems. pad int } // lockInit(l *mutex, rank int) sets the rank of lock before it is used. // If there is no clear place to initialize a lock, then the rank of a lock can be // specified during the lock call itself via lockWithRank(l *mutex, rank int). func lockInit(l *mutex, rank lockRank) { l.rank = rank } func getLockRank(l *mutex) lockRank { return l.rank } // lockWithRank is like lock(l), but allows the caller to specify a lock rank // when acquiring a non-static lock. // // Note that we need to be careful about stack splits: // // This function is not nosplit, thus it may split at function entry. This may // introduce a new edge in the lock order, but it is no different from any // other (nosplit) call before this call (including the call to lock() itself). // // However, we switch to the systemstack to record the lock held to ensure that // we record an accurate lock ordering. e.g., without systemstack, a stack // split on entry to lock2() would record stack split locks as taken after l, // even though l is not actually locked yet. func lockWithRank(l *mutex, rank lockRank) { if l == &debuglock || l == &paniclk || l == &raceFiniLock { // debuglock is only used for println/printlock(). Don't do lock // rank recording for it, since print/println are used when // printing out a lock ordering problem below. // // paniclk is only used for fatal throw/panic. Don't do lock // ranking recording for it, since we throw after reporting a // lock ordering problem. Additionally, paniclk may be taken // after effectively any lock (anywhere we might panic), which // the partial order doesn't cover. // // raceFiniLock is held while exiting when running // the race detector. Don't do lock rank recording for it, // since we are exiting. lock2(l) return } if rank == 0 { rank = lockRankLeafRank } gp := getg() // Log the new class. systemstack(func() { i := gp.m.locksHeldLen if i >= len(gp.m.locksHeld) { throw("too many locks held concurrently for rank checking") } gp.m.locksHeld[i].rank = rank gp.m.locksHeld[i].lockAddr = uintptr(unsafe.Pointer(l)) gp.m.locksHeldLen++ // i is the index of the lock being acquired if i > 0 { checkRanks(gp, gp.m.locksHeld[i-1].rank, rank) } lock2(l) }) } // nosplit to ensure it can be called in as many contexts as possible. // //go:nosplit func printHeldLocks(gp *g) { if gp.m.locksHeldLen == 0 { println("") return } for j, held := range gp.m.locksHeld[:gp.m.locksHeldLen] { println(j, ":", held.rank.String(), held.rank, unsafe.Pointer(gp.m.locksHeld[j].lockAddr)) } } // acquireLockRank acquires a rank which is not associated with a mutex lock // // This function may be called in nosplit context and thus must be nosplit. // //go:nosplit func acquireLockRank(rank lockRank) { gp := getg() // Log the new class. See comment on lockWithRank. systemstack(func() { i := gp.m.locksHeldLen if i >= len(gp.m.locksHeld) { throw("too many locks held concurrently for rank checking") } gp.m.locksHeld[i].rank = rank gp.m.locksHeld[i].lockAddr = 0 gp.m.locksHeldLen++ // i is the index of the lock being acquired if i > 0 { checkRanks(gp, gp.m.locksHeld[i-1].rank, rank) } }) } // checkRanks checks if goroutine g, which has mostly recently acquired a lock // with rank 'prevRank', can now acquire a lock with rank 'rank'. // //go:systemstack func checkRanks(gp *g, prevRank, rank lockRank) { rankOK := false if rank < prevRank { // If rank < prevRank, then we definitely have a rank error rankOK = false } else if rank == lockRankLeafRank { // If new lock is a leaf lock, then the preceding lock can // be anything except another leaf lock. rankOK = prevRank < lockRankLeafRank } else { // We've now verified the total lock ranking, but we // also enforce the partial ordering specified by // lockPartialOrder as well. Two locks with the same rank // can only be acquired at the same time if explicitly // listed in the lockPartialOrder table. list := lockPartialOrder[rank] for _, entry := range list { if entry == prevRank { rankOK = true break } } } if !rankOK { printlock() println(gp.m.procid, " ======") printHeldLocks(gp) throw("lock ordering problem") } } // See comment on lockWithRank regarding stack splitting. func unlockWithRank(l *mutex) { if l == &debuglock || l == &paniclk || l == &raceFiniLock { // See comment at beginning of lockWithRank. unlock2(l) return } gp := getg() systemstack(func() { found := false for i := gp.m.locksHeldLen - 1; i >= 0; i-- { if gp.m.locksHeld[i].lockAddr == uintptr(unsafe.Pointer(l)) { found = true copy(gp.m.locksHeld[i:gp.m.locksHeldLen-1], gp.m.locksHeld[i+1:gp.m.locksHeldLen]) gp.m.locksHeldLen-- break } } if !found { println(gp.m.procid, ":", l.rank.String(), l.rank, l) throw("unlock without matching lock acquire") } unlock2(l) }) } // releaseLockRank releases a rank which is not associated with a mutex lock // // This function may be called in nosplit context and thus must be nosplit. // //go:nosplit func releaseLockRank(rank lockRank) { gp := getg() systemstack(func() { found := false for i := gp.m.locksHeldLen - 1; i >= 0; i-- { if gp.m.locksHeld[i].rank == rank && gp.m.locksHeld[i].lockAddr == 0 { found = true copy(gp.m.locksHeld[i:gp.m.locksHeldLen-1], gp.m.locksHeld[i+1:gp.m.locksHeldLen]) gp.m.locksHeldLen-- break } } if !found { println(gp.m.procid, ":", rank.String(), rank) throw("lockRank release without matching lockRank acquire") } }) } // nosplit because it may be called from nosplit contexts. // //go:nosplit func lockWithRankMayAcquire(l *mutex, rank lockRank) { gp := getg() if gp.m.locksHeldLen == 0 { // No possibility of lock ordering problem if no other locks held return } systemstack(func() { i := gp.m.locksHeldLen if i >= len(gp.m.locksHeld) { throw("too many locks held concurrently for rank checking") } // Temporarily add this lock to the locksHeld list, so // checkRanks() will print out list, including this lock, if there // is a lock ordering problem. gp.m.locksHeld[i].rank = rank gp.m.locksHeld[i].lockAddr = uintptr(unsafe.Pointer(l)) gp.m.locksHeldLen++ checkRanks(gp, gp.m.locksHeld[i-1].rank, rank) gp.m.locksHeldLen-- }) } // nosplit to ensure it can be called in as many contexts as possible. // //go:nosplit func checkLockHeld(gp *g, l *mutex) bool { for i := gp.m.locksHeldLen - 1; i >= 0; i-- { if gp.m.locksHeld[i].lockAddr == uintptr(unsafe.Pointer(l)) { return true } } return false } // assertLockHeld throws if l is not held by the caller. // // nosplit to ensure it can be called in as many contexts as possible. // //go:nosplit func assertLockHeld(l *mutex) { gp := getg() held := checkLockHeld(gp, l) if held { return } // Crash from system stack to avoid splits that may cause // additional issues. systemstack(func() { printlock() print("caller requires lock ", l, " (rank ", l.rank.String(), "), holding:\n") printHeldLocks(gp) throw("not holding required lock!") }) } // assertRankHeld throws if a mutex with rank r is not held by the caller. // // This is less precise than assertLockHeld, but can be used in places where a // pointer to the exact mutex is not available. // // nosplit to ensure it can be called in as many contexts as possible. // //go:nosplit func assertRankHeld(r lockRank) { gp := getg() for i := gp.m.locksHeldLen - 1; i >= 0; i-- { if gp.m.locksHeld[i].rank == r { return } } // Crash from system stack to avoid splits that may cause // additional issues. systemstack(func() { printlock() print("caller requires lock with rank ", r.String(), "), holding:\n") printHeldLocks(gp) throw("not holding required lock!") }) } // worldStopped notes that the world is stopped. // // Caller must hold worldsema. // // nosplit to ensure it can be called in as many contexts as possible. // //go:nosplit func worldStopped() { if stopped := worldIsStopped.Add(1); stopped != 1 { systemstack(func() { print("world stop count=", stopped, "\n") throw("recursive world stop") }) } } // worldStarted that the world is starting. // // Caller must hold worldsema. // // nosplit to ensure it can be called in as many contexts as possible. // //go:nosplit func worldStarted() { if stopped := worldIsStopped.Add(-1); stopped != 0 { systemstack(func() { print("world stop count=", stopped, "\n") throw("released non-stopped world stop") }) } } // nosplit to ensure it can be called in as many contexts as possible. // //go:nosplit func checkWorldStopped() bool { stopped := worldIsStopped.Load() if stopped > 1 { systemstack(func() { print("inconsistent world stop count=", stopped, "\n") throw("inconsistent world stop count") }) } return stopped == 1 } // assertWorldStopped throws if the world is not stopped. It does not check // which M stopped the world. // // nosplit to ensure it can be called in as many contexts as possible. // //go:nosplit func assertWorldStopped() { if checkWorldStopped() { return } throw("world not stopped") } // assertWorldStoppedOrLockHeld throws if the world is not stopped and the // passed lock is not held. // // nosplit to ensure it can be called in as many contexts as possible. // //go:nosplit func assertWorldStoppedOrLockHeld(l *mutex) { if checkWorldStopped() { return } gp := getg() held := checkLockHeld(gp, l) if held { return } // Crash from system stack to avoid splits that may cause // additional issues. systemstack(func() { printlock() print("caller requires world stop or lock ", l, " (rank ", l.rank.String(), "), holding:\n") println("") printHeldLocks(gp) throw("no world stop or required lock!") }) }