| /prebuilts/go/darwin-x86/src/internal/cpu/ |
| cpu_x86.go | 38 // For XGETBV, OSXSAVE bit is required and sufficient.
|
| /prebuilts/go/darwin-x86/src/os/exec/ |
| exec_posix_test.go | 48 // For issue #19314: make sure that SIGSTOP does not cause the process
|
| /prebuilts/go/darwin-x86/src/os/ |
| stat_darwin.go | 48 // For testing.
|
| stat_freebsd.go | 48 // For testing.
|
| stat_linux.go | 48 // For testing.
|
| stat_nacl.go | 48 // For testing.
|
| stat_netbsd.go | 48 // For testing.
|
| stat_openbsd.go | 48 // For testing.
|
| /prebuilts/go/darwin-x86/src/reflect/ |
| tostring_test.go | 5 // Formatting of reflection types and values for debugging.
17 // For debugging only.
56 for i := 0; i < v.Len(); i++ {
79 for i, n := 0, v.NumField(); i < n; i++ {
|
| /prebuilts/go/darwin-x86/src/runtime/testdata/testprogcgo/ |
| pprof.go | 19 for (i = 0; i < 100000; i++) {
39 // For testing purposes it pretends that all CPU hits in C code are in cpuHog.
84 for C.getCpuHogCount() < 2 && time.Since(t0) < time.Second {
|
| threadpprof.go | 23 for (i = 0; i < 100000; i++) {
43 // For testing purposes it pretends that all CPU hits in C code are in cpuHog.
110 for C.getCPUHogThreadCount() < 2 && time.Since(t0) < time.Second {
|
| /prebuilts/go/darwin-x86/src/sort/ |
| slice.go | 13 // The sort is not guaranteed to be stable. For a stable sort, use
40 for i := n - 1; i > 0; i-- {
|
| /prebuilts/go/darwin-x86/src/vendor/golang_org/x/net/idna/ |
| trie.go | 9 // appendMapping appends the mapping for the respective rune. isMapped must be
22 for p := len(b) - int(xorData[index]); p < len(b); p++ {
50 // lookup determines the type of block n and looks up the value for b.
51 // For n < t.cutoff, the block is a simple lookup table. Otherwise, the block
53 // the value for b is by r.value + (b - r.lo) * stride.
59 for lo < hi {
|
| /prebuilts/go/darwin-x86/test/ |
| import6.go | 15 // For example `"\x00"` tests import "\x00"
|
| /prebuilts/go/darwin-x86/test/stress/ |
| maps.go | 16 // For now, just one:
35 for m.Len() < 10000 {
46 for i := 0; i < numGets; i++ {
58 for m.Len() > 0 {
75 for len(m) == s0 {
82 for k := range m {
98 for _ = range m {
100 for range m {
105 for {
107 for _, mt := range mapTypes()
[all...] |
| /prebuilts/go/linux-x86/src/cmd/asm/ |
| doc.go | 7 file named for the basename of the argument source file with a .o suffix. The
17 The same assembler is used for all target operating systems and architectures.
26 Search for #include files in dir1, dir2, etc,
37 Write output to file. The default is foo.o for /a/b/c/foo.s.
44 The assembler uses mostly the same syntax for all architectures,
49 For more information, see https://golang.org/doc/asm.
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/testdata/ |
| phi.go | 23 for i := 0; i < 26; i++ {
88 // Some will be stack phis. For those stack phis, make sure the spill
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| unsafe.go | 51 // Sum offsets for dots until we reach base.
53 for r := n.Left; r != base; r = r.Left {
56 // For Offsetof(s.f), s may itself be a pointer,
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| phielim.go | 8 // A phi is redundant if its arguments are all equal. For
20 for {
22 for _, b := range f.Blocks {
23 for _, v := range b.Values {
44 for _, x := range v.Args {
|
| sparsetree.go | 61 for _, b := range f.Blocks {
79 for _, b := range reverseOrder {
99 for i, e := range b.Succs {
108 for c := c0; c != nil; c = t[c.ID].sibling {
119 // numberBlock assigns entry and exit numbers for b and b's
122 // be larger than zero. For each entry and exit number, the
143 // for the last example:
148 // reserve n for entry-1, assign n+1 to entry
151 // reserve n+1 for entry+1, n+2 is next free number
153 for c := t[b.ID].child; c != nil; c = t[c.ID].sibling
[all...] |
| /prebuilts/go/linux-x86/src/go/types/ |
| sizes.go | 9 // Sizes defines the sizing functions for package unsafe.
24 // StdSizes is a convenience type for creating commonly used Sizes.
49 // For arrays and structs, alignment is defined in terms
53 // spec: "For a variable x of array type: unsafe.Alignof(x)
57 // spec: "For a variable x of struct type: unsafe.Alignof(x)
58 // is the largest of the values unsafe.Alignof(x.f) for each
61 for _, f := range t.fields {
78 // spec: "For a variable x of any type: unsafe.Alignof(x) is at least 1."
95 for i, f := range fields {
174 // SizesFor returns the Sizes used by a compiler for an architecture
[all...] |
| /prebuilts/go/linux-x86/src/image/png/ |
| paeth.go | 25 // For example, the sample code starts with:
49 for i := 0; i < bytesPerPixel; i++ {
51 for j := i; j < len(cdat); j += bytesPerPixel {
|
| /prebuilts/go/linux-x86/src/internal/cpu/ |
| cpu_x86.go | 38 // For XGETBV, OSXSAVE bit is required and sufficient.
|
| /prebuilts/go/linux-x86/src/os/exec/ |
| exec_posix_test.go | 48 // For issue #19314: make sure that SIGSTOP does not cause the process
|
| /prebuilts/go/linux-x86/src/os/ |
| stat_darwin.go | 48 // For testing.
|
