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 2012 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. package loopclosure import ( _ "embed" "go/ast" "go/types" "golang.org/x/tools/go/analysis" "golang.org/x/tools/go/analysis/passes/inspect" "golang.org/x/tools/go/analysis/passes/internal/analysisutil" "golang.org/x/tools/go/ast/inspector" "golang.org/x/tools/go/types/typeutil" "golang.org/x/tools/internal/versions" ) //go:embed doc.go var doc string var Analyzer = &analysis.Analyzer{ Name: "loopclosure", Doc: analysisutil.MustExtractDoc(doc, "loopclosure"), URL: "https://pkg.go.dev/golang.org/x/tools/go/analysis/passes/loopclosure", Requires: []*analysis.Analyzer{inspect.Analyzer}, Run: run, } func run(pass *analysis.Pass) (interface{}, error) { inspect := pass.ResultOf[inspect.Analyzer].(*inspector.Inspector) nodeFilter := []ast.Node{ (*ast.File)(nil), (*ast.RangeStmt)(nil), (*ast.ForStmt)(nil), } inspect.Nodes(nodeFilter, func(n ast.Node, push bool) bool { if !push { // inspect.Nodes is slightly suboptimal as we only use push=true. return true } // Find the variables updated by the loop statement. var vars []types.Object addVar := func(expr ast.Expr) { if id, _ := expr.(*ast.Ident); id != nil { if obj := pass.TypesInfo.ObjectOf(id); obj != nil { vars = append(vars, obj) } } } var body *ast.BlockStmt switch n := n.(type) { case *ast.File: // Only traverse the file if its goversion is strictly before go1.22. goversion := versions.Lang(versions.FileVersions(pass.TypesInfo, n)) // goversion is empty for older go versions (or the version is invalid). return goversion == "" || versions.Compare(goversion, "go1.22") < 0 case *ast.RangeStmt: body = n.Body addVar(n.Key) addVar(n.Value) case *ast.ForStmt: body = n.Body switch post := n.Post.(type) { case *ast.AssignStmt: // e.g. for p = head; p != nil; p = p.next for _, lhs := range post.Lhs { addVar(lhs) } case *ast.IncDecStmt: // e.g. for i := 0; i < n; i++ addVar(post.X) } } if vars == nil { return true } // Inspect statements to find function literals that may be run outside of // the current loop iteration. // // For go, defer, and errgroup.Group.Go, we ignore all but the last // statement, because it's hard to prove go isn't followed by wait, or // defer by return. "Last" is defined recursively. // // TODO: consider allowing the "last" go/defer/Go statement to be followed by // N "trivial" statements, possibly under a recursive definition of "trivial" // so that that checker could, for example, conclude that a go statement is // followed by an if statement made of only trivial statements and trivial expressions, // and hence the go statement could still be checked. forEachLastStmt(body.List, func(last ast.Stmt) { var stmts []ast.Stmt switch s := last.(type) { case *ast.GoStmt: stmts = litStmts(s.Call.Fun) case *ast.DeferStmt: stmts = litStmts(s.Call.Fun) case *ast.ExprStmt: // check for errgroup.Group.Go if call, ok := s.X.(*ast.CallExpr); ok { stmts = litStmts(goInvoke(pass.TypesInfo, call)) } } for _, stmt := range stmts { reportCaptured(pass, vars, stmt) } }) // Also check for testing.T.Run (with T.Parallel). // We consider every t.Run statement in the loop body, because there is // no commonly used mechanism for synchronizing parallel subtests. // It is of course theoretically possible to synchronize parallel subtests, // though such a pattern is likely to be exceedingly rare as it would be // fighting against the test runner. for _, s := range body.List { switch s := s.(type) { case *ast.ExprStmt: if call, ok := s.X.(*ast.CallExpr); ok { for _, stmt := range parallelSubtest(pass.TypesInfo, call) { reportCaptured(pass, vars, stmt) } } } } return true }) return nil, nil } // reportCaptured reports a diagnostic stating a loop variable // has been captured by a func literal if checkStmt has escaping // references to vars. vars is expected to be variables updated by a loop statement, // and checkStmt is expected to be a statements from the body of a func literal in the loop. func reportCaptured(pass *analysis.Pass, vars []types.Object, checkStmt ast.Stmt) { ast.Inspect(checkStmt, func(n ast.Node) bool { id, ok := n.(*ast.Ident) if !ok { return true } obj := pass.TypesInfo.Uses[id] if obj == nil { return true } for _, v := range vars { if v == obj { pass.ReportRangef(id, "loop variable %s captured by func literal", id.Name) } } return true }) } // forEachLastStmt calls onLast on each "last" statement in a list of statements. // "Last" is defined recursively so, for example, if the last statement is // a switch statement, then each switch case is also visited to examine // its last statements. func forEachLastStmt(stmts []ast.Stmt, onLast func(last ast.Stmt)) { if len(stmts) == 0 { return } s := stmts[len(stmts)-1] switch s := s.(type) { case *ast.IfStmt: loop: for { forEachLastStmt(s.Body.List, onLast) switch e := s.Else.(type) { case *ast.BlockStmt: forEachLastStmt(e.List, onLast) break loop case *ast.IfStmt: s = e case nil: break loop } } case *ast.ForStmt: forEachLastStmt(s.Body.List, onLast) case *ast.RangeStmt: forEachLastStmt(s.Body.List, onLast) case *ast.SwitchStmt: for _, c := range s.Body.List { cc := c.(*ast.CaseClause) forEachLastStmt(cc.Body, onLast) } case *ast.TypeSwitchStmt: for _, c := range s.Body.List { cc := c.(*ast.CaseClause) forEachLastStmt(cc.Body, onLast) } case *ast.SelectStmt: for _, c := range s.Body.List { cc := c.(*ast.CommClause) forEachLastStmt(cc.Body, onLast) } default: onLast(s) } } // litStmts returns all statements from the function body of a function // literal. // // If fun is not a function literal, it returns nil. func litStmts(fun ast.Expr) []ast.Stmt { lit, _ := fun.(*ast.FuncLit) if lit == nil { return nil } return lit.Body.List } // goInvoke returns a function expression that would be called asynchronously // (but not awaited) in another goroutine as a consequence of the call. // For example, given the g.Go call below, it returns the function literal expression. // // import "sync/errgroup" // var g errgroup.Group // g.Go(func() error { ... }) // // Currently only "golang.org/x/sync/errgroup.Group()" is considered. func goInvoke(info *types.Info, call *ast.CallExpr) ast.Expr { if !isMethodCall(info, call, "golang.org/x/sync/errgroup", "Group", "Go") { return nil } return call.Args[0] } // parallelSubtest returns statements that can be easily proven to execute // concurrently via the go test runner, as t.Run has been invoked with a // function literal that calls t.Parallel. // // In practice, users rely on the fact that statements before the call to // t.Parallel are synchronous. For example by declaring test := test inside the // function literal, but before the call to t.Parallel. // // Therefore, we only flag references in statements that are obviously // dominated by a call to t.Parallel. As a simple heuristic, we only consider // statements following the final labeled statement in the function body, to // avoid scenarios where a jump would cause either the call to t.Parallel or // the problematic reference to be skipped. // // import "testing" // // func TestFoo(t *testing.T) { // tests := []int{0, 1, 2} // for i, test := range tests { // t.Run("subtest", func(t *testing.T) { // println(i, test) // OK // t.Parallel() // println(i, test) // Not OK // }) // } // } func parallelSubtest(info *types.Info, call *ast.CallExpr) []ast.Stmt { if !isMethodCall(info, call, "testing", "T", "Run") { return nil } if len(call.Args) != 2 { // Ignore calls such as t.Run(fn()). return nil } lit, _ := call.Args[1].(*ast.FuncLit) if lit == nil { return nil } // Capture the *testing.T object for the first argument to the function // literal. if len(lit.Type.Params.List[0].Names) == 0 { return nil } tObj := info.Defs[lit.Type.Params.List[0].Names[0]] if tObj == nil { return nil } // Match statements that occur after a call to t.Parallel following the final // labeled statement in the function body. // // We iterate over lit.Body.List to have a simple, fast and "frequent enough" // dominance relationship for t.Parallel(): lit.Body.List[i] dominates // lit.Body.List[j] for i < j unless there is a jump. var stmts []ast.Stmt afterParallel := false for _, stmt := range lit.Body.List { stmt, labeled := unlabel(stmt) if labeled { // Reset: naively we don't know if a jump could have caused the // previously considered statements to be skipped. stmts = nil afterParallel = false } if afterParallel { stmts = append(stmts, stmt) continue } // Check if stmt is a call to t.Parallel(), for the correct t. exprStmt, ok := stmt.(*ast.ExprStmt) if !ok { continue } expr := exprStmt.X if isMethodCall(info, expr, "testing", "T", "Parallel") { call, _ := expr.(*ast.CallExpr) if call == nil { continue } x, _ := call.Fun.(*ast.SelectorExpr) if x == nil { continue } id, _ := x.X.(*ast.Ident) if id == nil { continue } if info.Uses[id] == tObj { afterParallel = true } } } return stmts } // unlabel returns the inner statement for the possibly labeled statement stmt, // stripping any (possibly nested) *ast.LabeledStmt wrapper. // // The second result reports whether stmt was an *ast.LabeledStmt. func unlabel(stmt ast.Stmt) (ast.Stmt, bool) { labeled := false for { labelStmt, ok := stmt.(*ast.LabeledStmt) if !ok { return stmt, labeled } labeled = true stmt = labelStmt.Stmt } } // isMethodCall reports whether expr is a method call of // ... func isMethodCall(info *types.Info, expr ast.Expr, pkgPath, typeName, method string) bool { call, ok := expr.(*ast.CallExpr) if !ok { return false } // Check that we are calling a method f := typeutil.StaticCallee(info, call) if f == nil || f.Name() != method { return false } recv := f.Type().(*types.Signature).Recv() if recv == nil { return false } // Check that the receiver is a . or // *.. rtype := recv.Type() if ptr, ok := recv.Type().(*types.Pointer); ok { rtype = ptr.Elem() } return analysisutil.IsNamedType(rtype, pkgPath, typeName) }