| /prebuilts/go/linux-x86/src/sync/ |
| once.go | 18 // first time for this instance of Once. In other words, given
|
| /prebuilts/ndk/r13/sources/third_party/shaderc/third_party/spirv-tools/include/spirv-tools/ |
| libspirv.h | 118 // occupy multiple SPIR-V words.
262 // Location of the operand, in words from the start of the instruction.
264 // Number of words occupied by this operand.
278 // An array of words for this instruction, in native endianness.
279 const uint32_t* words; member in struct:spv_parsed_instruction_t
280 // The number of words in this instruction.
379 // word_count parameter specifies the number of words for binary. The options
413 // The integer arguments are the 32-bit words from the header, as specified
423 // applies to the words array member of the parsed instruction. The
429 // Parses a SPIR-V binary, specified as counted sequence of 32-bit words
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| stringold.py | 103 # Split a string into a list of space/tab-separated words
107 Return a list of the words in the string s, using sep as the
109 maxsplit words If sep is not specified, any whitespace string
119 def join(words, sep = ' '):
122 Return a string composed of the words in list, with
129 return sep.join(words)
368 # Capitalize the words in a string, e.g. " aBc dEf " -> "Abc Def".
372 Split the argument into words using split, capitalize each
373 word using capitalize, and join the capitalized words using
|
| textwrap.py | 72 Break words longer than 'width'. If false, those words will not
75 Allow breaking hyphenated words. If true, wrapping will occur
77 compound words.
97 r'[^\s\w]*\w+[^0-9\W]-(?=\w+[^0-9\W])|' # hyphenated words
167 not quite the same as words; see _wrap_chunks() for full
225 # If we're allowed to break long words, then do so: put as much
237 # If we're not allowed to break long words, and there's already
249 to words and the whitespace between them: each chunk is
|
| /prebuilts/python/darwin-x86/2.7.5/share/pretty-printers/stlport/stlport/ |
| printers.py | 121 words = self.val['_M_w']
126 if words.type.code == gdb.TYPE_CODE_ARRAY:
127 word_size = words.type.target ().sizeof
128 n_words = words.type.sizeof / word_size
130 word_size = words.type.sizeof
132 words = [words]
137 w = words[word]
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| stringold.py | 103 # Split a string into a list of space/tab-separated words
107 Return a list of the words in the string s, using sep as the
109 maxsplit words If sep is not specified, any whitespace string
119 def join(words, sep = ' '):
122 Return a string composed of the words in list, with
129 return sep.join(words)
368 # Capitalize the words in a string, e.g. " aBc dEf " -> "Abc Def".
372 Split the argument into words using split, capitalize each
373 word using capitalize, and join the capitalized words using
|
| textwrap.py | 72 Break words longer than 'width'. If false, those words will not
75 Allow breaking hyphenated words. If true, wrapping will occur
77 compound words.
97 r'[^\s\w]*\w+[^0-9\W]-(?=\w+[^0-9\W])|' # hyphenated words
167 not quite the same as words; see _wrap_chunks() for full
225 # If we're allowed to break long words, then do so: put as much
237 # If we're not allowed to break long words, and there's already
249 to words and the whitespace between them: each chunk is
|
| /prebuilts/python/linux-x86/2.7.5/share/pretty-printers/stlport/stlport/ |
| printers.py | 122 words = self.val['_M_w']
127 if words.type.code == gdb.TYPE_CODE_ARRAY:
128 word_size = words.type.target ().sizeof
129 n_words = words.type.sizeof / word_size
131 word_size = words.type.sizeof
133 words = [words]
138 w = words[word]
|
| /external/elfutils/lib/ |
| sha1.c | 219 const sha1_uint32 *words = buffer; local
221 const sha1_uint32 *endp = words + nwords;
237 while (words < endp)
247 unit is a 32-bit word and it is determined to work on words in
254 W (i) = SWAP (*words); \
256 ++words; \
|
| /external/elfutils/tests/ |
| elfstrmerge.c | 545 word is a falg value, the rest of the words are
549 size_t words = data->d_size / sizeof (Elf32_Word); local
550 if (words == 0)
553 for (size_t i = 1; i < words; i++)
568 size_t words = data->d_size / sizeof (Elf32_Word); local
569 for (size_t i = 0; i < words; i++)
|
| /external/libvncserver/common/ |
| md5.c | 303 const md5_uint32 *words = buffer; local
305 const md5_uint32 *endp = words + nwords;
320 while (words < endp)
330 unit is a 32-bit word and it is determined to work on words in
333 we store the swapped words in the array CORRECT_WORDS. */
338 a += FF (b, c, d) + (*cwp++ = SWAP (*words)) + T; \
339 ++words; \
373 /* For the second to fourth round we have the possibly swapped words
|
| /external/python/cpython2/Modules/_ctypes/libffi/src/powerpc/ |
| ffi_linux64.c | 399 unsigned int i, words, nargs, nfixedargs; local
590 words = ((*ptr)->size + 7) / 8;
591 if (next_arg.ul >= gpr_base.ul && next_arg.ul + words > gpr_end.ul)
596 next_arg.c = rest.c + words * 8 - first;
609 next_arg.ul += words;
|
| /toolchain/binutils/binutils-2.25/libiberty/ |
| md5.c | 284 const md5_uint32 *words = (const md5_uint32 *) buffer; local
286 const md5_uint32 *endp = words + nwords;
300 while (words < endp)
310 unit is a 32-bit word and it is determined to work on words in
313 we store the swapped words in the array CORRECT_WORDS. */
318 a += FF (b, c, d) + (*cwp++ = SWAP (*words)) + T; \
319 ++words; \
353 /* For the second to fourth round we have the possibly swapped words
|
| sha1.c | 289 const sha1_uint32 *words = (const sha1_uint32*) buffer; local
291 const sha1_uint32 *endp = words + nwords;
318 while (words < endp)
324 x[t] = SWAP (*words);
325 words++;
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| LongArray.java | 629 // int words = bits >>> 6;
634 // addShiftedByWords(other, words);
644 // int minLen = otherUsedLen + words + 1;
650 // long carry = addShiftedByBits(m_ints, words, other.m_ints, 0, otherUsedLen, shift);
651 // m_ints[otherUsedLen + words] ^= carry;
658 int words = bits >>> 6; local
663 add(m_ints, words, other.m_ints, 0, otherLen);
667 long carry = addShiftedUp(m_ints, words, other.m_ints, 0, otherLen, shift);
670 m_ints[otherLen + words] ^= carry;
701 public void addShiftedByWords(LongArray other, int words)
[all...] |
| /external/iproute2/lib/ |
| utils.c | 644 int words = bits >> 0x05; local
648 if (words)
649 if (memcmp(a1, a2, words << 2))
656 w1 = a1[words];
657 w2 = a2[words];
882 __u16 *words = (__u16 *)&addr; local
889 v = ntohs(words[i]);
|
| /toolchain/binutils/binutils-2.25/gas/config/ |
| tc-ns32k.c | 1716 LITTLENUM_TYPE words[4]; local
[all...] |
| tc-moxie.c | 563 LITTLENUM_TYPE words[4]; local
582 t = atof_ieee (input_line_pointer, type, words);
590 md_number_to_chars (litP, (valueT) words[i], 2);
|
| /frameworks/base/core/java/android/app/ |
| LauncherActivity.java | 212 String[] words = item.label.toString().toLowerCase().split(" "); local
213 int wordCount = words.length;
216 final String word = words[k];
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
| PersonalDictionaryLookup.java | 54 * It can be used directly to validate words or expand shortcuts, and it can be used by instances
260 UserDictionary.Words.CONTENT_URI,
308 * Returns the set of words defined for the given locale and more general locales.
312 * Note that this method returns expanded words, not shortcuts. Shortcuts are handled
316 * @return set of words that apply to the given locale.
324 final Set<String> words = new HashSet<>(); local
333 words.add(localeStringMap.get(wordLocale));
338 return words;
346 * Note that this method returns shortcut keys, not expanded words. Words are handle
[all...] |
| /prebuilts/go/darwin-x86/src/bufio/ |
| scan_test.go | 112 words := strings.Fields(test)
114 for wordCount = 0; wordCount < len(words); wordCount++ {
119 if got != words[wordCount] {
120 t.Errorf("#%d: %d: expected %q got %q", n, wordCount, words[wordCount], got)
126 if wordCount != len(words) {
127 t.Errorf("#%d: termination expected at %d; got %d", n, len(words), wordCount)
|
| /prebuilts/go/darwin-x86/src/math/big/ |
| natconv.go | 27 // In other words, at most n digits in base b fit into a Word.
270 // convert less-significant words (include leading zeros)
334 // Convert words of q to base b digits in s. If q is large, it is recursively "split in half"
338 // The iterative method processes n Words by n divW() calls, each of which visits every Word in the
417 // Split blocks greater than leafSize Words (or set to 0 to disable recursive conversion)
448 for words := leafSize; words < m>>1 && k < len(cacheBase10.table); words <<= 1 {
|
| /prebuilts/go/linux-x86/src/bufio/ |
| scan_test.go | 112 words := strings.Fields(test)
114 for wordCount = 0; wordCount < len(words); wordCount++ {
119 if got != words[wordCount] {
120 t.Errorf("#%d: %d: expected %q got %q", n, wordCount, words[wordCount], got)
126 if wordCount != len(words) {
127 t.Errorf("#%d: termination expected at %d; got %d", n, len(words), wordCount)
|
| /prebuilts/go/linux-x86/src/math/big/ |
| natconv.go | 27 // In other words, at most n digits in base b fit into a Word.
270 // convert less-significant words (include leading zeros)
334 // Convert words of q to base b digits in s. If q is large, it is recursively "split in half"
338 // The iterative method processes n Words by n divW() calls, each of which visits every Word in the
417 // Split blocks greater than leafSize Words (or set to 0 to disable recursive conversion)
448 for words := leafSize; words < m>>1 && k < len(cacheBase10.table); words <<= 1 {
|
| /art/runtime/arch/arm/ |
| quick_entrypoints_arm.S | 30 push {r4-r11, lr} @ 9 words (36 bytes) of callee saves.
48 SPILL_ALL_CALLEE_SAVE_GPRS @ 9 words (36 bytes) of callee saves.
49 vpush {s16-s31} @ 16 words (64 bytes) of floats.
51 sub sp, #12 @ 3 words of space, bottom word will hold Method*
73 push {r5-r8, r10-r11, lr} @ 7 words of callee saves
102 pop {r5-r8, r10-r11, lr} @ 7 words of callee saves
121 push {r1-r3, r5-r8, r10-r11, lr} @ 10 words of callee saves and args.
133 vpush {s0-s15} @ 16 words of float args.
135 sub sp, #8 @ 2 words of space, alignment padding and Method*
166 pop {r1-r3, r5-r8, r10-r11, lr} @ 10 words of callee save
[all...] |
