| /prebuilts/go/linux-x86/src/cmd/cgo/ |
| godefs.go | 101 // The most common case is union types, which begin with
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/syntax/ |
| tokens.go | 152 // Make sure we have at most 64 tokens so we can use them in a set.
|
| /prebuilts/go/linux-x86/src/crypto/x509/ |
| sec1.go | 23 // most cases it is not.
|
| /prebuilts/go/linux-x86/src/debug/dwarf/ |
| entry_test.go | 117 t.Fatalf("too many subprograms (expected at most %d)", i)
|
| /prebuilts/go/linux-x86/src/encoding/json/ |
| fold.go | 19 // functions, from most general (and slow) to fastest:
|
| /prebuilts/go/linux-x86/src/hash/adler32/ |
| adler32_test.go | 47 {0xd0201df6, "'Invariant assertions' is the most elegant programming technique! -Tom Szymanski"},
|
| /prebuilts/go/linux-x86/src/net/http/ |
| filetransport.go | 19 // incoming requests, as well as most other properties of the
|
| sniff.go | 12 // The algorithm uses at most sniffLen bytes to make its decision.
17 // Content-Type of the given data. It considers at most the
|
| /prebuilts/go/linux-x86/src/sync/atomic/ |
| value.go | 29 // Load returns the value set by the most recent Store.
|
| /prebuilts/go/linux-x86/src/sync/ |
| mutex.go | 6 // exclusion locks. Other than the Once and WaitGroup types, most are intended
|
| /prebuilts/go/linux-x86/src/time/ |
| zoneinfo_plan9.go | 97 // since that will be the most common lookup.
|
| /prebuilts/go/linux-x86/src/vendor/golang_org/x/text/unicode/norm/ |
| readwriter.go | 35 // Note that lastBoundary looks back at most 31 runes.
|
| /prebuilts/go/linux-x86/test/ |
| string_lit.go | 97 // test large and surrogate-half runes. perhaps not the most logical place for these tests.
|
| /build/make/tools/releasetools/ |
| edify_generator.py | 170 by the most recent ShowProgress call. 'frac' should be in
|
| /build/soong/cmd/sbox/ |
| sbox.go | 79 // and the sbox executable will most likely be at a fixed location relative to OUT_DIR too, so
80 // the value of sandboxesRoot will most likely be at a fixed location relative to the sbox executable
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/ |
| scopes.rb | 137 /* recursive rule scopes, access bottom-most scope */
|
| /external/autotest/server/hosts/ |
| cros_repair.py | 198 return 'The most recent AU attempt on this DUT succeeded'
|
| /external/libhevc/common/arm/ |
| ihevc_intra_pred_chroma_mode_3_to_9.s | 154 ldr r12, idx_neg_idx_chroma_3_9_addr @load most idx table
169 vdup.8 d26, r9 @most idx added to final idx values
174 vld1.8 {d0,d1,d2,d3}, [r6] @stores the 32 values reqd based on indices values (from most idx)
341 vld1.8 {d0,d1,d2,d3}, [r6] @stores the 32 values reqd based on indices values (from most idx)
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
| lex.go | 14 // lexlineno is the line number _after_ the most recently read rune.
18 // lineno is the line number at the start of the most recently lexed token.
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| block.go | 22 // If BranchLikely, Succs[0] is the most likely branch taken.
23 // If BranchUnlikely, Succs[1] is the most likely branch taken.
|
| /prebuilts/go/darwin-x86/src/net/http/ |
| sniff.go | 12 // The algorithm uses at most sniffLen bytes to make its decision.
17 // Content-Type of the given data. It considers at most the
|
| /prebuilts/go/darwin-x86/src/regexp/syntax/ |
| regexp.go | 34 // Character class operators are listed simplest to most complex
54 OpRepeat // matches Sub[0] at least Min times, at most Max (Max == -1 is no limit)
|
| /prebuilts/go/darwin-x86/src/runtime/debug/ |
| garbage.go | 18 Pause []time.Duration // pause history, most recent first
19 PauseEnd []time.Time // pause end times history, most recent first
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| lex.go | 14 // lexlineno is the line number _after_ the most recently read rune.
18 // lineno is the line number at the start of the most recently lexed token.
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| block.go | 22 // If BranchLikely, Succs[0] is the most likely branch taken.
23 // If BranchUnlikely, Succs[1] is the most likely branch taken.
|
