- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for Look (0.8 sec)
-
src/cmd/compile/internal/types2/api_test.go
} for _, test := range tests { info := Info{ Types: make(map[syntax.Expr]TypeAndValue), } name := mustTypecheck(test.src, nil, &info).Name() // look for expression var expr syntax.Expr for e := range info.Types { if ExprString(e) == test.expr { expr = e break } } if expr == nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 07 20:08:23 UTC 2024 - 93.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug.go
// SplitOf pointing to a parent slot, and SplitOffset // holding the offset into the parent object. pieceSlot := LocalSlot{N: n, Type: t, Off: offsets[k]} // Look up this piece to see if we've seen a reg op // for it. If not, create one. _, found := sc.lookup(pieceSlot) if !found { // This slot doesn't appear in the map, meaning it
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0) -
src/cmd/cgo/gcc.go
if len(names) == 0 { return needType } // Coerce gcc into telling us whether each name is a type, a value, or undeclared. // For names, find out whether they are integer constants. // We used to look at specific warning or error messages here, but that tied the // behavior too closely to specific versions of the compilers. // Instead, arrange that we can infer what we need from only the presence or absence
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 15:50:06 UTC 2024 - 97K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/regalloc.go
} // allocReg may have dropped registers from startRegsMask that // aren't actually needed in startRegs. Synchronize back to // startRegs. // // This must be done before placing spills, which will look at // startRegs to decide if a block is a valid block for a spill. if c := countRegs(s.startRegsMask); c != len(s.startRegs[b.ID]) { regs := make([]startReg, 0, c) for _, sr := range s.startRegs[b.ID] {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 17:49:56 UTC 2023 - 87.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/prove.go
// // TODO: Since prove now derives transitive relations, it // should be sufficient to learn that len(w) <= cap(w) at the // beginning of prove where we look for all len/cap ops. if v.Op == OpSliceLen && r< == 0 && ft.caps[v.Args[0].ID] != nil { // len(s) > w implies cap(s) > w // len(s) >= w implies cap(s) >= w // len(s) == w implies cap(s) >= w
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:30:21 UTC 2024 - 48.9K bytes - Viewed (0) -
src/cmd/cgo/out.go
for _, name := range typedefNames { def := typedef[name] fmt.Fprintf(fgo2, "type %s ", name) // We don't have source info for these types, so write them out without source info. // Otherwise types would look like: // // type _Ctype_struct_cb struct { // //line :1 // on_test *[0]byte // //line :1 // } // // Which is not useful. Moreover we never override source info,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 29 16:41:10 UTC 2024 - 59.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/S390XOps.go
// to prevent the compiler doing this so that it can be allocated as a normal // register. // // For more information about the z/Architecture, the instruction set and the // addressing modes it supports take a look at the z/Architecture Principles of // Operation: http://publibfp.boulder.ibm.com/epubs/pdf/dz9zr010.pdf // // Suffixes encode the bit width of pseudo-instructions. // D (double word) = 64 bit (frequently omitted)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 24 00:21:13 UTC 2023 - 52.5K bytes - Viewed (0) -
src/cmd/compile/internal/syntax/parser.go
i := len(s) if s[i-1] == '\r' { i-- } return s[2:i] // lop off //, and \r at end, if any } func trailingDigits(text string) (uint, uint, bool) { i := strings.LastIndexByte(text, ':') // look from right (Windows filenames may contain ':') if i < 0 { return 0, 0, false // no ':' } // i >= 0 n, err := strconv.ParseUint(text[i+1:], 10, 0) return uint(i + 1), uint(n), err == nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 62.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/rewrite.go
aa.Pos = aa.Pos.WithIsStmt() } else if v.Block == a.Block && v.Pos.Line() == a.Pos.Line() && v.Pos.IsStmt() != src.PosNotStmt { v.Pos = v.Pos.WithIsStmt() } else { // Record the lost line and look for a new home after all rewrites are complete. // TODO: it's possible (in FOR loops, in particular) for statement boundaries for the same
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 64.2K bytes - Viewed (0) -
src/cmd/compile/internal/types/type.go
return CMPeq } } } if c := t.Sym().cmpsym(x.Sym()); c != CMPeq { return c } if x.obj != nil { return CMPeq } // both syms nil, look at structure below. switch t.kind { case TBOOL, TFLOAT32, TFLOAT64, TCOMPLEX64, TCOMPLEX128, TUNSAFEPTR, TUINTPTR, TINT8, TINT16, TINT32, TINT64, TINT, TUINT8, TUINT16, TUINT32, TUINT64, TUINT: return CMPeq
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:29:45 UTC 2024 - 49.5K bytes - Viewed (0)