| /external/valgrind/massif/tests/ |
| malloc_usable.c | 9 // Because our allocations are in multiples of 8 or 16, 99 will round up
|
| realloc.c | 4 { // All sizes are multiples of 16 -- no slop.
|
| /external/fec/ |
| sumsq_mmx.c | 5 * The SSE2 and MMX assist routines both operate on multiples of
|
| sumsq_sse2.c | 3 * The SSE2 and MMX assist routines both operate on multiples of
|
| /frameworks/base/tests/CanvasCompare/res/values/ |
| values.xml | 18 <!-- NOTE: the below MUST be multiples of 64 -->
|
| /prebuilts/go/darwin-x86/src/go/types/ |
| methodset.go | 110 // (note that multiples of this type at the current depth
121 mset = mset.add(e.typ.methods, e.index, e.indirect, e.multiples)
130 fset = fset.add(f, e.multiples)
141 next = append(next, embeddedType{t, concat(e.index, i), e.indirect || isPtr, e.multiples})
147 mset = mset.add(t.allMethods, e.index, true, e.multiples)
205 // If multiples is set, f appears multiple times
207 func (s fieldSet) add(f *Var, multiples bool) fieldSet {
213 if !multiples {
229 // If multiples is set, every function in list appears multiple times
231 func (s methodSet) add(list []*Func, index []int, indirect bool, multiples bool) methodSet
[all...] |
| lookup.go | 102 // (note that multiples of this type at the current depth
118 if obj != nil || e.multiples {
137 if obj != nil || e.multiples {
158 next = append(next, embeddedType{t, concat(e.index, i), e.indirect || isPtr, e.multiples})
169 if obj != nil || e.multiples {
201 multiples bool // if set, typ appears multiple times at this depth
205 // into a single entry marked as containing multiples. The result is the
216 list[i].multiples = true
|
| /prebuilts/go/linux-x86/src/go/types/ |
| methodset.go | 110 // (note that multiples of this type at the current depth
121 mset = mset.add(e.typ.methods, e.index, e.indirect, e.multiples)
130 fset = fset.add(f, e.multiples)
141 next = append(next, embeddedType{t, concat(e.index, i), e.indirect || isPtr, e.multiples})
147 mset = mset.add(t.allMethods, e.index, true, e.multiples)
205 // If multiples is set, f appears multiple times
207 func (s fieldSet) add(f *Var, multiples bool) fieldSet {
213 if !multiples {
229 // If multiples is set, every function in list appears multiple times
231 func (s methodSet) add(list []*Func, index []int, indirect bool, multiples bool) methodSet
[all...] |
| lookup.go | 102 // (note that multiples of this type at the current depth
118 if obj != nil || e.multiples {
137 if obj != nil || e.multiples {
158 next = append(next, embeddedType{t, concat(e.index, i), e.indirect || isPtr, e.multiples})
169 if obj != nil || e.multiples {
201 multiples bool // if set, typ appears multiple times at this depth
205 // into a single entry marked as containing multiples. The result is the
216 list[i].multiples = true
|
| /prebuilts/go/darwin-x86/test/chan/ |
| sieve2.go | 33 // Return a chan of odd multiples of the prime number p, starting from p*p.
34 func multiples(p int) chan int { func
125 // Merge channels of multiples of 'primes' into 'composites'.
130 m := multiples(<-primes)
152 // In order to generate the nth prime we only need multiples of
|
| /prebuilts/go/linux-x86/test/chan/ |
| sieve2.go | 33 // Return a chan of odd multiples of the prime number p, starting from p*p.
34 func multiples(p int) chan int { func
125 // Merge channels of multiples of 'primes' into 'composites'.
130 m := multiples(<-primes)
152 // In order to generate the nth prime we only need multiples of
|
| /packages/apps/Protips/res/values-fr/ |
| arrays.xml | 24 <item msgid="1000948398885889319">"Écrans d\'accueil multiples\n Faites glisser l\'écran vers la droite/gauche. Déplacez les icônes d\'un écran à l\'autre."</item>
|
| /toolchain/binutils/binutils-2.25/gas/config/ |
| tc-mt.h | 41 /* All mt instructions are multiples of 32 bits. */
|
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| s_tanf.c | 29 /* Small multiples of pi/2 rounded to double precision. */
|
| /external/guava/guava-tests/test/com/google/common/math/ |
| MathTesting.java | 99 * positive values on or near 2^N for N near multiples of 8 (near byte boundaries).
135 * positive values on or near 2^N for N near multiples of 8 (near byte boundaries). This list is
169 * contains positive values on or near 2^N for N near multiples of 8 (near byte boundaries). This
217 // Add small multiples of MIN_VALUE and MIN_NORMAL
|
| /external/mesa3d/src/gallium/auxiliary/rbug/ |
| rbug_internal.h | 44 * Only works with multiples of 2
|
| /external/tpm2/ |
| RSAKeySieve.h | 46 // This is the pre-sieved table. It already has the bits for multiples of 3, 5, and 7 cleared.
|
| /external/webrtc/webrtc/modules/desktop_capture/ |
| differ.h | 59 // height are multiples of kBlockSize, then this will never be called.
|
| /external/webrtc/webrtc/modules/rtp_rtcp/source/rtcp_packet/ |
| transport_feedback.h | 57 static const int kDeltaScaleFactor = 250; // Convert to multiples of 0.25ms.
|
| /prebuilts/go/darwin-x86/src/crypto/cipher/ |
| xor.go | 66 // fastXORWords XORs multiples of 4 or 8 bytes (depending on architecture.)
|
| /prebuilts/go/linux-x86/src/crypto/cipher/ |
| xor.go | 66 // fastXORWords XORs multiples of 4 or 8 bytes (depending on architecture.)
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/translit/ |
| langtagRegex.txt | 68 $variantList = $variant (?: $s $variant )* ; # special for multiples
69 $extensionList = $extension (?: $s $extension )* ; # special for multiples
|
| /external/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/test/translit/ |
| langtagRegex.txt | 68 $variantList = $variant (?: $s $variant )* ; # special for multiples
69 $extensionList = $extension (?: $s $extension )* ; # special for multiples
|
| /external/libhevc/common/arm/ |
| ihevc_inter_pred_luma_copy.s | 90 tst r12,#15 @checks wd for multiples for 4 & 8
92 tst r12,#7 @checks wd for multiples for 4 & 8
|
| /external/libhevc/common/arm64/ |
| ihevc_inter_pred_luma_copy.s | 90 tst x16,#15 //checks wd for multiples for 4 & 8
92 tst x16,#7 //checks wd for multiples for 4 & 8
|
