| /external/valgrind/memcheck/tests/ |
| D | wrap6.c | 182 UInt* words = calloc(200, sizeof(UInt)); in fn_0() local
183 TRASH_IREGS(r, words); in fn_0()
184 free(words); in fn_0()
208 UInt* words = calloc(200, sizeof(UInt)); in fn_1() local
209 words[1-1] = a1; in fn_1()
210 TRASH_IREGS(r, words); in fn_1()
211 free(words); in fn_1()
235 UInt* words = calloc(200, sizeof(UInt)); in fn_2() local
236 words[1-1] = a1; in fn_2()
237 words[2-1] = a2; in fn_2()
[all …]
|
| /external/valgrind/helgrind/ |
| D | hg_wordset.c | 137 UWord* words; member
192 wv->words = NULL; in new_WV_of_size()
195 wv->words = wsu->alloc( wsu->cc, (SizeT)sz * sizeof(UWord) ); in new_WV_of_size()
203 if (wv->words) { in delete_WV()
204 dealloc(wv->words); in delete_WV()
228 if (wv1->words[i] == wv2->words[i]) in cmp_WordVecs_for_FM()
230 if (wv1->words[i] < wv2->words[i]) in cmp_WordVecs_for_FM()
232 if (wv1->words[i] > wv2->words[i]) in cmp_WordVecs_for_FM()
419 return (Bool)(wv->size == 1 && wv->words[0] == w); in HG_()
438 return wv->words[0]; in HG_()
[all …]
|
| /external/v8/tools/ |
| D | trace-maps-processor.py | 90 words = line.split(" ") variable
91 event = words[1]
93 assert words[2] == "map="
94 assert words[4] == "SFI="
95 new_map = AddMap(words[3], "SFI#%s" % words[5])
98 if words[2] == "from=" and words[4] == "to=":
99 from_map = words[3]
100 to_map = words[5]
109 assert words[6] == "name=", line
110 reason = "%s: %s" % (event, words[7])
[all …]
|
| /external/autotest/client/tests/kvm/tests/ |
| D | steps.py | 28 def barrier_2(vm, words, params, debug_dir, data_scrdump_filename, argument
30 if len(words) < 7:
35 cmd, dx, dy, x1, y1, md5sum, timeout = words[:7]
157 if words[-1] == "optional":
219 words = line.split()
220 if words[0] == "step":
224 elif words[0] == "screendump":
225 current_screendump = words[1]
228 elif words[0] == "sleep":
230 time.sleep(float(words[1]) * timeout_multiplier)
[all …]
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | BurmeseBreakEngine.java | 96 PossibleWord words[] = new PossibleWord[BURMESE_LOOKAHEAD]; in divideUpDictionaryRange() local
98 words[i] = new PossibleWord(); in divideUpDictionaryRange()
107 … int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
111 wordLength = words[wordsFound%BURMESE_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
122 … if (words[(wordsFound+1)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
125 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
137 … if (words[(wordsFound+2)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
138 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
142 } while (words[(wordsFound+1)%BURMESE_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
144 } while (words[wordsFound%BURMESE_LOOKAHEAD].backUp(fIter) && !foundBest); in divideUpDictionaryRange()
[all …]
|
| D | LaoBreakEngine.java | 99 PossibleWord words[] = new PossibleWord[LAO_LOOKAHEAD]; in divideUpDictionaryRange() local
101 words[i] = new PossibleWord(); in divideUpDictionaryRange()
110 … int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
114 wordLength = words[wordsFound%LAO_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
125 … if (words[(wordsFound+1)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
128 words[wordsFound%LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
140 … if (words[(wordsFound+2)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
141 words[wordsFound%LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
145 } while (words[(wordsFound+1)%LAO_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
147 } while (words[wordsFound%LAO_LOOKAHEAD].backUp(fIter) && !foundBest); in divideUpDictionaryRange()
[all …]
|
| D | KhmerBreakEngine.java | 99 PossibleWord words[] = new PossibleWord[KHMER_LOOKAHEAD]; in divideUpDictionaryRange() local
101 words[i] = new PossibleWord(); in divideUpDictionaryRange()
111 … int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
115 wordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
126 … if (words[(wordsFound+1)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
129 words[wordsFound%KHMER_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
141 … if (words[(wordsFound+2)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
142 words[wordsFound%KHMER_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
146 } while (words[(wordsFound+1)%KHMER_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
148 } while (words[wordsFound%KHMER_LOOKAHEAD].backUp(fIter) && !foundBest); in divideUpDictionaryRange()
[all …]
|
| D | ThaiBreakEngine.java | 109 PossibleWord words[] = new PossibleWord[THAI_LOOKAHEAD]; in divideUpDictionaryRange() local
111 words[i] = new PossibleWord(); in divideUpDictionaryRange()
121 … int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
125 wordLength = words[wordsFound%THAI_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
136 … if (words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
139 words[wordsFound%THAI_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
151 … if (words[(wordsFound+2)%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
152 words[wordsFound%THAI_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
155 } while (words[(wordsFound+1)%THAI_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
158 while (words[wordsFound%THAI_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | LaoBreakEngine.java | 100 PossibleWord words[] = new PossibleWord[LAO_LOOKAHEAD]; in divideUpDictionaryRange() local
102 words[i] = new PossibleWord(); in divideUpDictionaryRange()
111 … int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
115 wordLength = words[wordsFound%LAO_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
126 … if (words[(wordsFound+1)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
129 words[wordsFound%LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
141 … if (words[(wordsFound+2)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
142 words[wordsFound%LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
146 } while (words[(wordsFound+1)%LAO_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
148 } while (words[wordsFound%LAO_LOOKAHEAD].backUp(fIter) && !foundBest); in divideUpDictionaryRange()
[all …]
|
| D | BurmeseBreakEngine.java | 97 PossibleWord words[] = new PossibleWord[BURMESE_LOOKAHEAD]; in divideUpDictionaryRange() local
99 words[i] = new PossibleWord(); in divideUpDictionaryRange()
108 … int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
112 wordLength = words[wordsFound%BURMESE_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
123 … if (words[(wordsFound+1)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
126 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
138 … if (words[(wordsFound+2)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
139 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
143 } while (words[(wordsFound+1)%BURMESE_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
145 } while (words[wordsFound%BURMESE_LOOKAHEAD].backUp(fIter) && !foundBest); in divideUpDictionaryRange()
[all …]
|
| D | KhmerBreakEngine.java | 100 PossibleWord words[] = new PossibleWord[KHMER_LOOKAHEAD]; in divideUpDictionaryRange() local
102 words[i] = new PossibleWord(); in divideUpDictionaryRange()
112 … int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
116 wordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
127 … if (words[(wordsFound+1)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
130 words[wordsFound%KHMER_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
142 … if (words[(wordsFound+2)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
143 words[wordsFound%KHMER_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
147 } while (words[(wordsFound+1)%KHMER_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
149 } while (words[wordsFound%KHMER_LOOKAHEAD].backUp(fIter) && !foundBest); in divideUpDictionaryRange()
[all …]
|
| D | ThaiBreakEngine.java | 110 PossibleWord words[] = new PossibleWord[THAI_LOOKAHEAD]; in divideUpDictionaryRange() local
112 words[i] = new PossibleWord(); in divideUpDictionaryRange()
122 … int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
126 wordLength = words[wordsFound%THAI_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
137 … if (words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
140 words[wordsFound%THAI_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
152 … if (words[(wordsFound+2)%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
153 words[wordsFound%THAI_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
156 } while (words[(wordsFound+1)%THAI_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
159 while (words[wordsFound%THAI_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
[all …]
|
| /external/icu/icu4c/source/common/ |
| D | dictbe.cpp | 263 PossibleWord words[THAI_LOOKAHEAD]; in divideUpDictionaryRange() local
272 … int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
276 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
277 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
288 … if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
291 words[wordsFound%THAI_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
303 … if (words[(wordsFound + 2) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
304 words[wordsFound % THAI_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
308 while (words[(wordsFound + 1) % THAI_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
311 while (words[wordsFound % THAI_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
[all …]
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| D | u_bitmask.c | 53 util_bitmask_word *words; member
72 bm->words = (util_bitmask_word *)CALLOC(UTIL_BITMASK_INITIAL_WORDS, sizeof(util_bitmask_word)); in util_bitmask_create()
73 if(!bm->words) { in util_bitmask_create()
114 new_words = (util_bitmask_word *)REALLOC((void *)bm->words, in util_bitmask_resize()
125 bm->words = new_words; in util_bitmask_resize()
174 if(!(bm->words[word] & mask)) in util_bitmask_add()
190 assert(!(bm->words[word] & mask)); in util_bitmask_add()
191 bm->words[word] |= mask; in util_bitmask_add()
215 bm->words[word] |= mask; in util_bitmask_set()
240 bm->words[word] &= ~mask; in util_bitmask_clear()
[all …]
|
| /external/chromium-trace/catapult/third_party/coverage/coverage/ |
| D | templite.py | 165 words = token[2:-2].strip().split()
166 if words[0] == 'if':
168 if len(words) != 2:
171 code.add_line("if %s:" % self._expr_code(words[1]))
173 elif words[0] == 'for':
175 if len(words) != 4 or words[2] != 'in':
178 self._variable(words[1], self.loop_vars)
181 words[1],
182 self._expr_code(words[3])
186 elif words[0].startswith('end'):
[all …]
|
| /external/autotest/client/tests/unixbench/ |
| D | unixbench.py | 57 def check_for_error(self, words): argument
58 l = len(words)
59 if l >= 3 and words[-3:l] == ['no', 'measured', 'results']:
61 key = '_'.join(words[:-3])
77 words = line.split()
79 if self.check_for_error(words):
84 if len(words) >= 6:
85 key = '_'.join(words[:-6])
87 value = words[-6]
|
| /external/tcpdump/ |
| D | print-smb.c | 172 const u_char *words, const u_char *dat, const u_char *buf, const u_char *maxbuf) in print_trans2() argument
177 const u_char *w = words + 1; in print_trans2()
181 ND_TCHECK(words[0]); in print_trans2()
190 if (words[0] == 0) { in print_trans2()
205 if (words[0] == 8) { in print_trans2()
206 smb_fdata(ndo, words + 1, in print_trans2()
211 smb_fdata(ndo, words + 1, in print_trans2()
213 words + 1 + 14 * 2, unicodestr); in print_trans2()
218 smb_fdata(ndo, words + 1, in print_trans2()
220 words + 1 + 10 * 2, unicodestr); in print_trans2()
[all …]
|
| /external/vulkan-validation-layers/demos/smoke/ |
| D | glsl-to-spirv | 59 words = []
67 words.append(struct.unpack(fmt, data[i:(i + 4)])[0])
69 assert(words[0] == SPIRV_MAGIC)
75 return (words, output.rstrip())
78 words, comments = compile_glsl(in_filename, base + ".tmp") variable
81 for i in range(0, len(words), COLUMNS):
82 columns = ["0x%08x" % word for word in words[i:(i + COLUMNS)]]
94 """ % (comments, identifierize(base), len(words), "\n".join(literals))
|
| /external/flac/libFLAC/ |
| D | bitreader.c | 82 unsigned words; /* # of completed words in buffer */ member
130 end = br->words + (br->bytes? 1:0); in bitreader_read_from_client_()
133 br->words -= start; in bitreader_read_from_client_()
140 bytes = (br->capacity - br->words) * FLAC__BYTES_PER_WORD - br->bytes; in bitreader_read_from_client_()
143 target = ((FLAC__byte*)(br->buffer+br->words)) + br->bytes; in bitreader_read_from_client_()
156 br->buffer[br->words] = SWAP_BE_WORD_TO_HOST(br->buffer[br->words]); in bitreader_read_from_client_()
178 …end = (br->words*FLAC__BYTES_PER_WORD + br->bytes + bytes + (FLAC__BYTES_PER_WORD-1)) / FLAC__BYTE… in bitreader_read_from_client_()
179 for(start = br->words; start < end; start++) in bitreader_read_from_client_()
189 end = br->words*FLAC__BYTES_PER_WORD + br->bytes + bytes; in bitreader_read_from_client_()
190 br->words = end / FLAC__BYTES_PER_WORD; in bitreader_read_from_client_()
[all …]
|
| D | bitwriter.c | 70 #define FLAC__WORDS_TO_BITS(words) ((words) * FLAC__BITS_PER_WORD) argument
71 #define FLAC__TOTAL_BITS(bw) (FLAC__WORDS_TO_BITS((bw)->words) + (bw)->bits)
77 unsigned words; /* # of complete words in buffer */ member
94 …new_capacity = bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WO… in bitwriter_grow_()
108 …FLAC__ASSERT(new_capacity >= bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLA… in bitwriter_grow_()
150 bw->words = bw->bits = 0; in FLAC__bitwriter_init()
167 bw->words = bw->bits = 0; in FLAC__bitwriter_free()
172 bw->words = bw->bits = 0; in FLAC__bitwriter_clear()
182 …fprintf(out, "bitwriter: capacity=%u words=%u bits=%u total_bits=%u\n", bw->capacity, bw->words, b… in FLAC__bitwriter_dump()
184 for(i = 0; i < bw->words; i++) { in FLAC__bitwriter_dump()
[all …]
|
| /external/sl4a/Docs/ |
| D | generate_api_reference_md.pl | 66 my @words = split(/\s/, $line);
67 my $func_name = $words[2];
70 $func_name = $words[3];
109 my @words = split(/\n/,$fn);
114 for my $w (@words) {
149 my @words = split(/returns(\s*)=/, $description);
150 my $des = $words[0];
151 my $ret = $words[1];
|
| /external/v8/test/mjsunit/ |
| D | regexp-results-cache.js | 73 var words = string.split(" "); variable
74 assertEquals("Friends,", words[0]);
75 words[0] = "Enemies,";
76 words = string.split(" ");
77 assertEquals("Friends,", words[0]);
|
| /external/c-ares/ |
| D | inet_ntop.c | 130 unsigned int words[NS_IN6ADDRSZ / NS_INT16SZ]; in inet_ntop6() local
138 memset(words, '\0', sizeof(words)); in inet_ntop6()
140 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3)); in inet_ntop6()
146 if (words[i] == 0) { in inet_ntop6()
183 (best.len == 7 && words[7] != 0x0001) || in inet_ntop6()
184 (best.len == 5 && words[5] == 0xffff))) { in inet_ntop6()
190 tp += sprintf(tp, "%x", words[i]); in inet_ntop6()
|
| /external/bison/lib/ |
| D | lbitset.c | 66 bitset_word words[LBITSET_ELT_WORDS]; /* Bits that are set. */ member
84 ((lbitset_elt *) (void *) ((char *) (X) - offsetof (lbitset_elt, words)))
151 memset (elt->words, 0, sizeof (elt->words)); in lbitset_elt_calloc()
189 bset->b.cdata = next->words; in lbitset_elt_unlink()
194 bset->b.cdata = prev->words; in lbitset_elt_unlink()
221 bset->b.cdata = elt->prev->words; in lbitset_prune()
248 if (elt->words[i]) in lbitset_elt_zero_p()
314 bset->b.cdata = elt->words; in lbitset_elt_link()
359 bset->b.cdata = elt->words; in lbitset_elt_find()
437 if (delt->words[j] != selt->words[j]) in lbitset_equal_p()
[all …]
|
| /external/curl/lib/ |
| D | inet_ntop.c | 93 unsigned long words[IN6ADDRSZ / INT16SZ]; in inet_ntop6() local
100 memset(words, '\0', sizeof(words)); in inet_ntop6()
102 words[i/2] |= (src[i] << ((1 - (i % 2)) << 3)); in inet_ntop6()
110 if(words[i] == 0) { in inet_ntop6()
144 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) { in inet_ntop6()
152 tp += snprintf(tp, 5, "%lx", words[i]); in inet_ntop6()
|