Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 863 for Fn (0.25 sec)

  1. src/cmd/compile/internal/test/testdata/cmpConst_test.go

    	{idx: 3, exp: eq, fn: eq_127_uint64},
    	{idx: 3, exp: ne, fn: ne_127_uint64},
    	{idx: 4, exp: lt, fn: lt_128_uint64},
    	{idx: 4, exp: le, fn: le_128_uint64},
    	{idx: 4, exp: gt, fn: gt_128_uint64},
    	{idx: 4, exp: ge, fn: ge_128_uint64},
    	{idx: 4, exp: eq, fn: eq_128_uint64},
    	{idx: 4, exp: ne, fn: ne_128_uint64},
    	{idx: 5, exp: lt, fn: lt_254_uint64},
    	{idx: 5, exp: le, fn: le_254_uint64},
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Dec 23 06:40:04 UTC 2020
    - 103.1K bytes
    - Viewed (0)
  2. test/fixedbugs/issue13799.go

    	m := &x
    
    	var fn func() // ERROR "moved to heap: fn$"
    	for i := 0; i < maxI; i++ {
    		// var fn func() // this makes it work, because fn stays off heap
    		j := 0        // ERROR "moved to heap: j$"
    		fn = func() { // ERROR "func literal escapes to heap$"
    			if j < 100 {
    				j++
    				fn()
    			} else {
    				*m = *m + 1
    			}
    		}
    		fn()
    	}
    
    	if *m != maxI {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Sep 08 18:50:24 UTC 2023
    - 4.9K bytes
    - Viewed (0)
  3. src/compress/zlib/writer_test.go

    	const dictionary = "0123456789."
    	for _, fn := range filenames {
    		testFileLevelDictReset(t, fn, NoCompression, nil)
    		testFileLevelDictReset(t, fn, DefaultCompression, nil)
    		testFileLevelDictReset(t, fn, HuffmanOnly, nil)
    		testFileLevelDictReset(t, fn, NoCompression, []byte(dictionary))
    		testFileLevelDictReset(t, fn, DefaultCompression, []byte(dictionary))
    		testFileLevelDictReset(t, fn, HuffmanOnly, []byte(dictionary))
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Dec 09 19:12:23 UTC 2020
    - 5.7K bytes
    - Viewed (0)
  4. src/runtime/os_solaris.go

    	}
    
    	var libcall libcall
    	libcall.fn = uintptr(unsafe.Pointer(fn))
    	libcall.n = 0
    	libcall.args = uintptr(unsafe.Pointer(fn)) // it's unused but must be non-nil, otherwise crashes
    	asmcgocall(unsafe.Pointer(&asmsysvicall6x), unsafe.Pointer(&libcall))
    	if mp != nil {
    		mp.libcallsp = 0
    	}
    	return libcall.r1
    }
    
    //go:nosplit
    func sysvicall1(fn *libcFunc, a1 uintptr) uintptr {
    	r1, _ := sysvicall1Err(fn, a1)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 06 18:49:01 UTC 2023
    - 6.6K bytes
    - Viewed (0)
  5. src/cmd/internal/obj/objfile.go

    		if fn.dwarfRangesSym != nil && fn.dwarfRangesSym.Size != 0 {
    			w.aux1(goobj.AuxDwarfRanges, fn.dwarfRangesSym)
    		}
    		if fn.dwarfDebugLinesSym != nil && fn.dwarfDebugLinesSym.Size != 0 {
    			w.aux1(goobj.AuxDwarfLines, fn.dwarfDebugLinesSym)
    		}
    		if fn.Pcln.Pcsp != nil && fn.Pcln.Pcsp.Size != 0 {
    			w.aux1(goobj.AuxPcsp, fn.Pcln.Pcsp)
    		}
    		if fn.Pcln.Pcfile != nil && fn.Pcln.Pcfile.Size != 0 {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 19:57:43 UTC 2024
    - 24K bytes
    - Viewed (0)
  6. src/cmd/compile/internal/ssagen/nowb.go

    	var q ir.NameQueue
    
    	for _, fn := range typecheck.Target.Funcs {
    		symToFunc[fn.LSym] = fn
    
    		// Make nowritebarrierrec functions BFS roots.
    		if fn.Pragma&ir.Nowritebarrierrec != 0 {
    			funcs[fn] = nowritebarrierrecCall{}
    			q.PushRight(fn.Nname)
    		}
    		// Check go:nowritebarrier functions.
    		if fn.Pragma&ir.Nowritebarrier != 0 && fn.WBPos.IsKnown() {
    			base.ErrorfAt(fn.WBPos, 0, "write barrier prohibited")
    		}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 17:29:46 UTC 2024
    - 5.9K bytes
    - Viewed (0)
  7. src/cmd/vendor/github.com/ianlancetaylor/demangle/ast.go

    	ps.print(t.Name)
    }
    
    func (t *Typed) Traverse(fn func(AST) bool) {
    	if fn(t) {
    		t.Name.Traverse(fn)
    		t.Type.Traverse(fn)
    	}
    }
    
    func (t *Typed) Copy(fn func(AST) AST, skip func(AST) bool) AST {
    	if skip(t) {
    		return nil
    	}
    	name := t.Name.Copy(fn, skip)
    	typ := t.Type.Copy(fn, skip)
    	if name == nil && typ == nil {
    		return fn(t)
    	}
    	if name == nil {
    		name = t.Name
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 31 19:48:28 UTC 2024
    - 105.8K bytes
    - Viewed (0)
  8. src/cmd/compile/internal/test/testdata/arithConst_test.go

    	test_uint64{fn: sub_0_uint64, fnname: "sub_0_uint64", in: 0, want: 0},
    	test_uint64{fn: sub_uint64_0, fnname: "sub_uint64_0", in: 0, want: 0},
    	test_uint64{fn: sub_0_uint64, fnname: "sub_0_uint64", in: 1, want: 18446744073709551615},
    	test_uint64{fn: sub_uint64_0, fnname: "sub_uint64_0", in: 1, want: 1},
    	test_uint64{fn: sub_0_uint64, fnname: "sub_0_uint64", in: 4294967296, want: 18446744069414584320},
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Dec 23 06:40:04 UTC 2020
    - 633.8K bytes
    - Viewed (0)
  9. test/typeparam/issue51233.go

    type RC[RG any] interface {
    	~[]RG
    }
    
    type Fn[RCT RC[RG], RG any] func(RCT)
    
    type FFn[RCT RC[RG], RG any] func() Fn[RCT] // ERROR "not enough type arguments for type Fn: have 1, want 2"
    
    type F[RCT RC[RG], RG any] interface {
    	Fn() Fn[RCT] // ERROR "not enough type arguments for type Fn: have 1, want 2"
    }
    
    type concreteF[RCT RC[RG], RG any] struct {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Dec 08 00:50:55 UTC 2023
    - 816 bytes
    - Viewed (0)
  10. test/typeparam/issue51232.go

    type RC[RG any] interface {
    	~[]RG
    }
    
    type Fn[RCT RC[RG], RG any] func(RCT)
    
    type F[RCT RC[RG], RG any] interface {
    	Fn() Fn[RCT] // ERROR "not enough type arguments for type Fn: have 1, want 2"
    }
    
    type concreteF[RCT RC[RG], RG any] struct {
    	makeFn func() Fn[RCT] // ERROR "not enough type arguments for type Fn: have 1, want 2"
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Dec 08 00:50:55 UTC 2023
    - 898 bytes
    - Viewed (0)
Back to top