- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 116 for ones (0.17 sec)
-
src/cmd/compile/internal/test/inl_test.go
"stackmapdata", "stringStructOf", "subtract1", "subtractb", "tophash", "(*bmap).keys", "(*bmap).overflow", "(*waitq).enqueue", "funcInfo.entry", // GC-related ones "cgoInRange", "gclinkptr.ptr", "guintptr.ptr", "heapBitsSlice", "markBits.isMarked", "muintptr.ptr", "puintptr.ptr", "spanOf", "spanOfUnchecked", "typePointers.nextFast",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 04:07:57 UTC 2024 - 10.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/decompose.go
f.NamedValues[*dataName] = append(f.NamedValues[*dataName], v.Args[1]) toDelete = append(toDelete, namedVal{i, j}) } case t.IsFloat(): // floats are never decomposed, even ones bigger than RegSize case t.Size() > f.Config.RegSize: f.Fatalf("undecomposed named type %s %v", name, t) } } deleteNamedVals(f, toDelete) f.Names = append(f.Names, newNames...) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 23 21:22:15 UTC 2022 - 13.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/nowb.go
// it's a lot harder to work out the argument after. for _, n := range typecheck.Target.Funcs { c.curfn = n if c.curfn.ABIWrapper() { // We only want "real" calls to these // functions, not the generated ones within // their own ABI wrappers. continue } ir.Visit(n, c.findExtraCalls) } c.curfn = nil return c } func (c *nowritebarrierrecChecker) findExtraCalls(nn ir.Node) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 17:29:46 UTC 2024 - 5.9K bytes - Viewed (0) -
src/bytes/buffer_test.go
t.Fatalf("ReadRune(%U) after UnreadRune got %U,%d not %U,%d (err=%s)", r, r2, nbytes, r, size, err) } } } func TestWriteInvalidRune(t *testing.T) { // Invalid runes, including negative ones, should be written as // utf8.RuneError. for _, r := range []rune{-1, utf8.MaxRune + 1} { var buf Buffer buf.WriteRune(r) check(t, fmt.Sprintf("TestWriteInvalidRune (%d)", r), &buf, "\uFFFD") } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 13:31:36 UTC 2024 - 18.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/memcombine.go
package ssa import ( "cmd/compile/internal/base" "cmd/compile/internal/types" "cmd/internal/src" "sort" ) // memcombine combines smaller loads and stores into larger ones. // We ensure this generates good code for encoding/binary operations. // It may help other cases also. func memcombine(f *Func) { // This optimization requires that the architecture has
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 21 19:45:41 UTC 2024 - 18.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/regalloc.go
// Liveness information flows backward, so starting at the end // increases the probability that we will stabilize quickly. // TODO: Do a better job yet. Here's one possibility: // Calculate the dominator tree and locate all strongly connected components. // If a value is live in one block of an SCC, it is live in all. // Walk the dominator tree from end to beginning, just once, treating SCC
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/cgo/gcc.go
// Keep a list of all the functions, to remove the ones // only used as expressions and avoid generating bridge // code for them. functions := make(map[string]bool) for _, n := range f.Name { if n.Kind == "func" { functions[n.Go] = false } } // Now that we have all the name types filled in, // scan through the Refs to identify the ones that // are trying to do a ,err call. Also check that
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 15:50:06 UTC 2024 - 97K bytes - Viewed (0) -
src/bufio/bufio_test.go
t.Fatalf("n = %d: unexpected error on ReadByte: %v", n, err) } if b != data[i] { t.Fatalf("n = %d: incorrect byte returned from ReadByte: got %q, want %q", n, b, data[i]) } } // Unread one byte if there is one. if n > 0 { if err := r.UnreadByte(); err != nil { t.Errorf("n = %d: unexpected error on UnreadByte: %v", n, err) } } // Test that we cannot unread any further.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 10 18:56:01 UTC 2023 - 51.5K bytes - Viewed (0) -
src/archive/tar/writer_test.go
// but does not do the following properly: // * It does not treat an empty record as deletion. // * It does not use subsequent global headers to update previous ones. // // $ gnutar -tvf pax-global-records.tar // ---------- 0/0 0 2017-07-13 19:40 global1 // ---------- 0/0 0 2017-07-13 19:40 file2 // gnutar: Substituting `.' for empty member name
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 38.7K bytes - Viewed (0) -
src/cmd/compile/internal/ir/visit.go
// // Visit and Any are presented above as examples of how to use // DoChildren effectively, but of course, usage that fits within the // simplifications captured by Visit or Any will be best served // by directly calling the ones provided by this package. func DoChildren(n Node, do func(Node) bool) bool { if n == nil { return false } return n.doChildren(do) } // Visit visits each non-nil node x in the IR tree rooted at n
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 23 14:29:16 UTC 2023 - 6K bytes - Viewed (0)