| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Demo/pdist/ |
| mac.py | 11 words = string.split(line)
12 if not words:
14 if words[0] != 'rcvs':
15 words.insert(0, 'rcvs')
16 sys.argv = words
|
| /development/samples/training/multiscreen/newsreader/src/com/example/android/newsreader/ |
| NonsenseGenerator.java | 77 List<String> words = new ArrayList<String>(); local
78 generateSentence(words, isHeadline);
79 words.set(0, String.valueOf(Character.toUpperCase(words.get(0).charAt(0))) +
80 words.get(0).substring(1));
81 return joinWords(words);
102 * @param words the list of words to which the sentence will be appended.
105 private void generateSentence(List<String> words, boolean isHeadline) {
107 generateTimeClause(words, isHeadline)
[all...] |
| /external/mesa3d/src/glsl/glcpp/tests/ |
| 039-func-arg-obj-macro-with-comma.c | 2 #define bar two,words
|
| /external/valgrind/none/tests/x86/ |
| cpuid.stdout.exp | 1 cpuid words (0): 0x........ 0x........ 0x........ 0x........
2 cpuid words (1): 0x........ 0x........ 0x........ 0x........
|
| /frameworks/rs/rsov/compiler/spirit/ |
| word_stream.cpp | 27 InputWordStream *InputWordStream::Create(std::vector<uint32_t> &&words) {
28 return new WordStreamImpl(words);
31 InputWordStream *InputWordStream::Create(const std::vector<uint32_t> &words) {
32 return new WordStreamImpl(words);
36 std::vector<uint32_t> words((uint32_t *)bytes.data(),
38 return InputWordStream::Create(words);
49 WordStream *WordStream::Create(const std::vector<uint32_t> &words) {
50 return new WordStreamImpl(words);
|
| word_stream_test.cpp | 29 auto words = OS->getWords(); local
30 const std::vector<uint8_t> bytes((uint8_t *)words.data(),
31 (uint8_t *)(words.data() + words.size()));
40 auto words = OS->getWords(); local
41 const std::vector<uint8_t> bytes((uint8_t *)words.data(),
42 (uint8_t *)(words.data() + words.size()));
51 std::vector<uint32_t> words((uint32_t *)bytes,
53 std::unique_ptr<InputWordStream> IS(InputWordStream::Create(words));
[all...] |
| instructions_test.cpp | 28 std::vector<uint32_t> words = {0x00020011, 0x00000001}; local
29 auto *i = Deserialize<CapabilityInst>(words);
36 std::vector<uint32_t> words((uint32_t *)bytes,
38 auto *i = Deserialize<ExtensionInst>(words);
47 std::vector<uint32_t> words((uint32_t *)bytes,
49 auto *i = Deserialize<ExtInstImportInst>(words);
|
| /prebuilts/ndk/r13/sources/third_party/shaderc/third_party/spirv-tools/source/ |
| instruction.cpp | 30 inst->words.push_back(value);
|
| instruction.h | 48 // The instruction, as a sequence of 32-bit words.
50 // in words[0], as described in the SPIR-V spec.
52 // in words[0]. Subsequent elements are the result of parsing
54 std::vector<uint32_t> words; member in struct:spv_instruction_t
|
| /toolchain/binutils/binutils-2.25/gas/config/ |
| atof-ieee.c | 139 make_invalid_floating_point_number (LITTLENUM_TYPE *words)
143 words[0] = (LITTLENUM_TYPE) ((unsigned) -1) >> 1;
144 words[1] = (LITTLENUM_TYPE) -1;
145 words[2] = (LITTLENUM_TYPE) -1;
146 words[3] = (LITTLENUM_TYPE) -1;
147 words[4] = (LITTLENUM_TYPE) -1;
148 words[5] = (LITTLENUM_TYPE) -1;
165 LITTLENUM_TYPE *words) /* Build the binary here. */
171 /* Number of 16-bit words in the format. */
227 make_invalid_floating_point_number (words);
719 LITTLENUM_TYPE words[MAX_LITTLENUMS]; local
[all...] |
| /external/e2fsprogs/ |
| wordwrap.pl | 12 @words = split;
13 while (defined($word = shift @words)) {
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/ |
| v32-err-2.s | 5 ; Tests that broken words don't crash, just give a message when
|
| /libcore/ojluni/src/main/java/java/util/ |
| BitSet.java | 67 * BitSets are packed into arrays of "words." Currently a word is
92 private long[] words; field in class:BitSet
95 * The number of words in the logical size of this BitSet.
100 * Whether the size of "words" is user-specified. If so, we assume
119 assert(wordsInUse == 0 || words[wordsInUse - 1] != 0);
120 assert(wordsInUse >= 0 && wordsInUse <= words.length);
121 assert(wordsInUse == words.length || words[wordsInUse] == 0);
125 * Sets the field wordsInUse to the logical size in words of the bit set.
126 * WARNING:This method assumes that the number of words actually in use i
225 long[] words = new long[n]; local
273 long[] words = new long[(n + 7) \/ 8]; local
[all...] |
| /prebuilts/ndk/r13/sources/third_party/shaderc/third_party/spirv-tools/source/opt/ |
| instruction.cpp | 46 std::vector<uint32_t> words(
47 inst.words + current_payload.offset,
48 inst.words + current_payload.offset + current_payload.num_words);
49 operands_.emplace_back(current_payload.type, std::move(words));
54 const auto& words = GetOperand(index).words; local
55 assert(words.size() == 1 && "expected the operand only taking one word");
56 return words.front();
62 size += static_cast<uint32_t>(operands_[i].words.size());
76 binary->insert(binary->end(), operand.words.begin(), operand.words.end())
[all...] |
| /external/valgrind/memcheck/tests/ |
| wrap6.c | 182 UInt* words = calloc(200, sizeof(UInt)); local
183 TRASH_IREGS(r, words);
184 free(words);
208 UInt* words = calloc(200, sizeof(UInt)); local
209 words[1-1] = a1;
210 TRASH_IREGS(r, words);
211 free(words);
235 UInt* words = calloc(200, sizeof(UInt)); local
236 words[1-1] = a1;
237 words[2-1] = a2
263 UInt* words = calloc(200, sizeof(UInt)); local
292 UInt* words = calloc(200, sizeof(UInt)); local
322 UInt* words = calloc(200, sizeof(UInt)); local
353 UInt* words = calloc(200, sizeof(UInt)); local
386 UInt* words = calloc(200, sizeof(UInt)); local
422 UInt* words = calloc(200, sizeof(UInt)); local
459 UInt* words = calloc(200, sizeof(UInt)); local
497 UInt* words = calloc(200, sizeof(UInt)); local
536 UInt* words = calloc(200, sizeof(UInt)); local
576 UInt* words = calloc(200, sizeof(UInt)); local
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/idlelib/ |
| AutoExpand.py | 26 words = self.getwords()
29 words, index, insert, line = self.state
31 words = self.getwords()
33 if not words:
38 newword = words[index]
39 index = (index + 1) % len(words)
45 self.state = words, index, curinsert, curline
60 words = []
62 # search backwards through words before
67 words.append(w
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/idlelib/ |
| AutoExpand.py | 26 words = self.getwords()
29 words, index, insert, line = self.state
31 words = self.getwords()
33 if not words:
38 newword = words[index]
39 index = (index + 1) % len(words)
45 self.state = words, index, curinsert, curline
60 words = []
62 # search backwards through words before
67 words.append(w
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
| AutoExpand.py | 26 words = self.getwords()
29 words, index, insert, line = self.state
31 words = self.getwords()
33 if not words:
38 newword = words[index]
39 index = (index + 1) % len(words)
45 self.state = words, index, curinsert, curline
60 words = []
62 # search backwards through words before
67 words.append(w
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/ |
| AutoExpand.py | 26 words = self.getwords()
29 words, index, insert, line = self.state
31 words = self.getwords()
33 if not words:
38 newword = words[index]
39 index = (index + 1) % len(words)
45 self.state = words, index, curinsert, curline
60 words = []
62 # search backwards through words before
67 words.append(w
[all...] |
| /pdk/util/ |
| diff_products.py | 51 words = line.split()
52 if len(words) < 2:
54 if words[0] in PRODUCT_KEYWORDS:
56 if overrideProperty and words[1] == ":=":
57 if len(productData[words[0]]) != 0:
58 print "** Warning: overriding property " + words[0] + " that was:" + \
59 productData[words[0]]
60 productData[words[0]] = {}
61 d = productData[words[0]]
62 for word in words[2:]
[all...] |
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/arm/ |
| group-reloc-ldc-encoding-bad.l | 98 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
99 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
100 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
101 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
102 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
103 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
104 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
105 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
106 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
107 [^:]*:48: Error: bad offset 0x00000808 \(must be an 8-bit number of words\)
[all...] |
| /external/vulkan-validation-layers/demos/smoke/ |
| glsl-to-spirv | 52 # read the temp file into a list of SPIR-V words
53 words = []
61 words.append(struct.unpack(fmt, data[i:(i + 4)])[0])
63 assert(words[0] == SPIRV_MAGIC)
69 return (words, output.rstrip())
72 words, comments = compile_glsl(in_filename, base + ".tmp")
75 for i in range(0, len(words), COLUMNS):
76 columns = ["0x%08x" % word for word in words[i:(i + COLUMNS)]]
88 """ % (comments, identifierize(base), len(words), "\n".join(literals))
|
| /frameworks/rs/rsov/compiler/ |
| Builtin_test.cpp | 33 auto words = readFile<uint32_t>(fullPath); local
37 auto words1 = passes.run(words);
|
| /device/google/contexthub/firmware/os/cpu/cortexm4/ |
| atomicBitset.c | 26 memset(set->words, 0, sizeof(uint32_t) * ATOMIC_BITSET_NUM_WORDS(numBits));
28 set->words[numBits / 32] = ((uint32_t)((int32_t)-1LL)) << (numBits & 31);
41 return !!((set->words[num / 32]) & (1UL << (num & 31)));
47 uint32_t *wordPtr = set->words + idx;
67 uint32_t *wordPtr = set->words + idx;
88 uint32_t *wordPtr = set->words;
125 otherSet->words[idx] = atomicXchg32bits(&atomicallyAccessedSet->words[idx], otherSet->words[idx]);
138 dest[idx] = atomicRead32bits(&set->words[idx])
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| BurmeseBreakEngine.java | 22 // How many words in a row are "good enough"?
103 PossibleWord words[] = new PossibleWord[BURMESE_LOOKAHEAD]; local
105 words[i] = new PossibleWord();
113 //Look for candidate words at the current position
114 int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd);
118 wordLength = words[wordsFound%BURMESE_LOOKAHEAD].acceptMarked(fIter);
122 // If there was more than one, see which one can take us forward the most words
129 if (words[(wordsFound+1)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) {
132 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent();
141 // See if any of the possible second words is followed by a third wor
[all...] |
