Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 12 for yerine (0.1 sec)

  1. src/cmd/cgo/gcc.go

    				// are in hex and half are in whatever the #define used.
    				n.Const = fmt.Sprintf("%#x", i)
    			} else if n.Define[0] == '\'' {
    				if _, err := parser.ParseExpr(n.Define); err == nil {
    					n.Kind = "iconst"
    					n.Const = n.Define
    				}
    			} else if n.Define[0] == '"' {
    				if _, err := parser.ParseExpr(n.Define); err == nil {
    					n.Kind = "sconst"
    					n.Const = n.Define
    				}
    			}
    
    			if n.IsConst() {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 20 15:50:06 UTC 2024
    - 97K bytes
    - Viewed (0)
  2. src/cmd/dist/build.go

    		"-D", "GOARCH_" + goarch,
    		"-D", "GOOS_GOARCH_" + goos + "_" + goarch,
    		"-p", pkg,
    	}
    	if goarch == "mips" || goarch == "mipsle" {
    		// Define GOMIPS_value from gomips.
    		asmArgs = append(asmArgs, "-D", "GOMIPS_"+gomips)
    	}
    	if goarch == "mips64" || goarch == "mips64le" {
    		// Define GOMIPS64_value from gomips64.
    		asmArgs = append(asmArgs, "-D", "GOMIPS64_"+gomips64)
    	}
    	if goarch == "ppc64" || goarch == "ppc64le" {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 20 18:34:40 UTC 2024
    - 54K bytes
    - Viewed (0)
  3. src/cmd/link/internal/ld/elf.go

    			// in a loadable segment (e.g. the abihash note) but not for
    			// notes that we do not want to be mapped (e.g. the package
    			// list note). The real fix is probably to define new values
    			// for Symbol.Type corresponding to mapped and unmapped notes
    			// and handle them in dodata().
    			Errorf(nil, "sh.Type == SHT_NOTE in elfshbits when linking internally")
    		}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Apr 22 13:29:54 UTC 2024
    - 63.6K bytes
    - Viewed (0)
  4. src/cmd/vendor/golang.org/x/sys/unix/syscall_linux.go

    	sa.raw.Ifindex = sa.Ifindex
    	sa.raw.Queue_id = sa.QueueID
    	sa.raw.Shared_umem_fd = sa.SharedUmemFD
    
    	return unsafe.Pointer(&sa.raw), SizeofSockaddrXDP, nil
    }
    
    // This constant mirrors the #define of PX_PROTO_OE in
    // linux/if_pppox.h. We're defining this by hand here instead of
    // autogenerating through mkerrors.sh because including
    // linux/if_pppox.h causes some declaration conflicts with other
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Mar 07 05:26:45 UTC 2024
    - 77.5K bytes
    - Viewed (0)
  5. src/cmd/compile/internal/ssa/regalloc.go

    //  - Otherwise, if v is in a register at the start of b,
    //    put the spill of v at the start of b.
    //  - Otherwise, set b = immediate dominator of b, and repeat.
    //
    // Phi values are special, as always. We define two kinds of phis, those
    // where the merge happens in a register (a "register" phi) and those where
    // the merge happens in a stack location (a "stack" phi).
    //
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Nov 21 17:49:56 UTC 2023
    - 87.2K bytes
    - Viewed (0)
  6. src/cmd/vendor/golang.org/x/sys/unix/syscall_zos_s390x.go

    var SocketDisableIPv6 bool
    
    // Sockaddr represents a socket address.
    type Sockaddr interface {
    	sockaddr() (ptr unsafe.Pointer, len _Socklen, err error) // lowercase; only we can define Sockaddrs
    }
    
    // SockaddrInet4 implements the Sockaddr interface for AF_INET type sockets.
    type SockaddrInet4 struct {
    	Port int
    	Addr [4]byte
    	raw  RawSockaddrInet4
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 08 16:12:58 UTC 2024
    - 84.4K bytes
    - Viewed (0)
  7. src/cmd/link/internal/ld/lib.go

    		// If the module (toolchain-speak for "executable or shared
    		// library") we are linking contains the runtime package, it
    		// will define the runtime.firstmoduledata symbol and we
    		// truncate it back to 0 bytes so we can define its entire
    		// contents in symtab.go:symtab().
    		mdsb.SetSize(0)
    
    		// In addition, on ARM, the runtime depends on the linker
    		// recording the value of GOARM.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue May 21 18:45:27 UTC 2024
    - 88.6K bytes
    - Viewed (0)
  8. src/cmd/link/internal/ld/dwarf.go

    	// circular definition loops, so that gdb can understand them.
    	die := d.newdie(parent, dwarf.DW_ABRV_TYPEDECL, name)
    
    	d.newrefattr(die, dwarf.DW_AT_type, tds)
    
    	return die
    }
    
    // Define gotype, for composite ones recurse into constituents.
    func (d *dwctxt) defgotype(gotype loader.Sym) loader.Sym {
    	if gotype == 0 {
    		return d.mustFind("<unspecified>")
    	}
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 02 16:25:18 UTC 2024
    - 72.4K bytes
    - Viewed (0)
  9. src/cmd/go/go_test.go

    	testenv.MustHaveCGO(t)
    	tooSlow(t, "builds a package with cgo dependencies")
    
    	tg := testgo(t)
    	defer tg.cleanup()
    	tg.parallel()
    	tg.tempFile("src/x/a.go", `package main
    		// #ifndef VAL
    		// #define VAL 0
    		// #endif
    		// int val = VAL;
    		import "C"
    		import "fmt"
    		func main() { fmt.Println(C.val) }
    	`)
    	tg.setenv("GOPATH", tg.path("."))
    	exe := tg.path("x.exe")
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 01:00:11 UTC 2024
    - 81.1K bytes
    - Viewed (0)
  10. src/cmd/compile/internal/ssa/prove.go

    				// If we know that x+delta > w but w is not constant, we can derive:
    				//    if delta < 0 and x+delta cannot underflow, then x > w
    				// This is useful for loops with bounds "len(slice)-K" (delta = -K)
    				if delta < 0 && !underflow {
    					ft.update(parent, x, w, signed, r)
    				}
    			} else {
    				// With w,delta constants, we want to derive: x+delta > w  ⇒  x > w-delta
    				//
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 04 17:30:21 UTC 2024
    - 48.9K bytes
    - Viewed (0)
Back to top