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 2023 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.exectracer2 // Simple hash table for tracing. Provides a mapping // between variable-length data and a unique ID. Subsequent // puts of the same data will return the same ID. // // Uses a region-based allocation scheme and assumes that the // table doesn't ever grow very big. // // This is definitely not a general-purpose hash table! It avoids // doing any high-level Go operations so it's safe to use even in // sensitive contexts. package runtime import ( "runtime/internal/atomic" "runtime/internal/sys" "unsafe" ) type traceMap struct { lock mutex // Must be acquired on the system stack seq atomic.Uint64 mem traceRegionAlloc tab [1 << 13]atomic.UnsafePointer // *traceMapNode (can't use generics because it's notinheap) } type traceMapNode struct { _ sys.NotInHeap link atomic.UnsafePointer // *traceMapNode (can't use generics because it's notinheap) hash uintptr id uint64 data []byte } // next is a type-safe wrapper around link. func (n *traceMapNode) next() *traceMapNode { return (*traceMapNode)(n.link.Load()) } // stealID steals an ID from the table, ensuring that it will not // appear in the table anymore. func (tab *traceMap) stealID() uint64 { return tab.seq.Add(1) } // put inserts the data into the table. // // It's always safe to noescape data because its bytes are always copied. // // Returns a unique ID for the data and whether this is the first time // the data has been added to the map. func (tab *traceMap) put(data unsafe.Pointer, size uintptr) (uint64, bool) { if size == 0 { return 0, false } hash := memhash(data, 0, size) // First, search the hashtable w/o the mutex. if id := tab.find(data, size, hash); id != 0 { return id, false } // Now, double check under the mutex. // Switch to the system stack so we can acquire tab.lock var id uint64 var added bool systemstack(func() { lock(&tab.lock) if id = tab.find(data, size, hash); id != 0 { unlock(&tab.lock) return } // Create new record. id = tab.seq.Add(1) vd := tab.newTraceMapNode(data, size, hash, id) // Insert it into the table. // // Update the link first, since the node isn't published yet. // Then, store the node in the table as the new first node // for the bucket. part := int(hash % uintptr(len(tab.tab))) vd.link.StoreNoWB(tab.tab[part].Load()) tab.tab[part].StoreNoWB(unsafe.Pointer(vd)) unlock(&tab.lock) added = true }) return id, added } // find looks up data in the table, assuming hash is a hash of data. // // Returns 0 if the data is not found, and the unique ID for it if it is. func (tab *traceMap) find(data unsafe.Pointer, size, hash uintptr) uint64 { part := int(hash % uintptr(len(tab.tab))) for vd := tab.bucket(part); vd != nil; vd = vd.next() { // Synchronization not necessary. Once published to the table, these // values are immutable. if vd.hash == hash && uintptr(len(vd.data)) == size { if memequal(unsafe.Pointer(&vd.data[0]), data, size) { return vd.id } } } return 0 } // bucket is a type-safe wrapper for looking up a value in tab.tab. func (tab *traceMap) bucket(part int) *traceMapNode { return (*traceMapNode)(tab.tab[part].Load()) } func (tab *traceMap) newTraceMapNode(data unsafe.Pointer, size, hash uintptr, id uint64) *traceMapNode { // Create data array. sl := notInHeapSlice{ array: tab.mem.alloc(size), len: int(size), cap: int(size), } memmove(unsafe.Pointer(sl.array), data, size) // Create metadata structure. meta := (*traceMapNode)(unsafe.Pointer(tab.mem.alloc(unsafe.Sizeof(traceMapNode{})))) *(*notInHeapSlice)(unsafe.Pointer(&meta.data)) = sl meta.id = id meta.hash = hash return meta } // reset drops all allocated memory from the table and resets it. // // tab.lock must be held. Must run on the system stack because of this. // //go:systemstack func (tab *traceMap) reset() { assertLockHeld(&tab.lock) tab.mem.drop() tab.seq.Store(0) // Clear table without write barriers. The table consists entirely // of notinheap pointers, so this is fine. // // Write barriers may theoretically call into the tracer and acquire // the lock again, and this lock ordering is expressed in the static // lock ranking checker. memclrNoHeapPointers(unsafe.Pointer(&tab.tab), unsafe.Sizeof(tab.tab)) }