Home
last modified time | relevance | path

Searched refs:words (Results 1 – 25 of 426) sorted by relevance

12345678910>>...18

/external/valgrind/memcheck/tests/
Dwrap6.c182 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 …]
Dtest-plo.c73 UWord* words = malloc(3 * sizeof(UWord)); in main() local
74 free(words); in main()
77 UWord w = words[1]; in main()
/external/valgrind/helgrind/
Dhg_wordset.c137 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/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DLaoBreakEngine.java99 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 …]
DKhmerBreakEngine.java99 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 …]
DBurmeseBreakEngine.java96 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 …]
DThaiBreakEngine.java109 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/icu4c/source/common/
Ddictbe.cpp263 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/
Du_bitmask.c53 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/tcpdump/
Dprint-smb.c173 print_trans2(const u_char *words, const u_char *dat, const u_char *buf, const u_char *maxbuf) in print_trans2() argument
178 const u_char *w = words + 1; in print_trans2()
182 TCHECK(words[0]); in print_trans2()
191 if (words[0] == 0) { in print_trans2()
206 if (words[0] == 8) { in print_trans2()
207 smb_fdata(words + 1, in print_trans2()
212 smb_fdata(words + 1, in print_trans2()
214 words + 1 + 14 * 2, unicodestr); in print_trans2()
219 smb_fdata(words + 1, in print_trans2()
221 words + 1 + 10 * 2, unicodestr); in print_trans2()
[all …]
/external/flac/libFLAC/
Dbitreader.c82 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 …]
Dbitwriter.c70 #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/v8/test/mjsunit/
Dregexp-results-cache.js73 var words = string.split(" "); variable
74 assertEquals("Friends,", words[0]);
75 words[0] = "Enemies,";
76 words = string.split(" ");
77 assertEquals("Friends,", words[0]);
/external/bison/lib/
Dlbitset.c66 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/tcpdump/missing/
Dinet_ntop.c118 u_long words [IN6ADDRSZ / INT16SZ]; in inet_ntop_v6() local
125 memset (words, 0, sizeof(words)); in inet_ntop_v6()
127 words[i/2] |= (src[i] << ((1 - (i % 2)) << 3)); in inet_ntop_v6()
133 if (words[i] == 0) in inet_ntop_v6()
173 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) in inet_ntop_v6()
183 tp += sprintf (tp, "%lX", words[i]); in inet_ntop_v6()
/external/openssh/openbsd-compat/
Dinet_ntop.c120 u_int words[IN6ADDRSZ / INT16SZ]; in inet_ntop6() local
129 memset(words, '\0', sizeof words); in inet_ntop6()
131 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3)); in inet_ntop6()
135 if (words[i] == 0) { in inet_ntop6()
179 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) { in inet_ntop6()
185 advance = snprintf(tp, ep - tp, "%x", words[i]); in inet_ntop6()
/external/mksh/src/
Dedit.c226 x_print_expansions(int nwords, char * const *words, bool is_command) in x_print_expansions() argument
237 (prefix_len = x_longest_prefix(nwords, words)) > 0) { in x_print_expansions()
242 prefix_len = x_basename(words[0], NULL); in x_print_expansions()
245 if (x_basename(words[i] + prefix_len, NULL) > in x_print_expansions()
250 while (prefix_len > 0 && words[0][prefix_len - 1] != '/') in x_print_expansions()
255 XPput(l, words[i] + prefix_len); in x_print_expansions()
264 pr_list(use_copy ? (char **)XPptrv(l) : words); in x_print_expansions()
367 char **words, *cp; in x_file_glob() local
402 words = (char **)XPclose(w); in x_file_glob()
404 for (nwords = 0; words[nwords]; nwords++) in x_file_glob()
[all …]
/external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/
DSHA1ImplTest.java66 int[] words = new int[INDEX + 6]; // working array to compute hash in testOneBlockMessage() local
72 for (int i = 0; i < words.length; i++) { in testOneBlockMessage()
73 words[i] = 0; in testOneBlockMessage()
75 words[0] = 0x61626380; // constants from Secure Hash Standard in testOneBlockMessage()
76 words[15] = 0x00000018; in testOneBlockMessage()
78 alternateHash(words, hash1); in testOneBlockMessage()
/external/e2fsprogs/lib/ext2fs/
Dcrc32c.c80 size_t words; in crc32c_le_body() local
94 words = (len - init_bytes) >> 2; in crc32c_le_body()
110 for (i = 0; i < words; i++) { in crc32c_le_body()
150 size_t words; in crc32c_be_body() local
161 words = (len - init_bytes) >> 2; in crc32c_be_body()
176 for (i = 0; i < words; i++) { in crc32c_be_body()
217 size_t words; in crc32c_le_body() local
228 words = (len - init_bytes) >> 3; in crc32c_le_body()
243 for (i = 0; i < words; i++) { in crc32c_le_body()
297 size_t words; in crc32c_be_body() local
[all …]
/external/flac/libFLAC/ia32/
Dbitreader_asm.nasm58 …; the above two asserts also guarantee that the binary part never straddles more than 2 words, so …
91 ;; [ebp + 8] br->words
98 ; ucbits = (br->words-cwords)*FLAC__BITS_PER_WORD + br->bytes*8 - cbits;
99 mov eax, [ebp + 8] ; eax <- br->words
100 sub eax, esi ; eax <- br->words-cwords
101 shl eax, 2 ; eax <- (br->words-cwords)*FLAC__BYTES_PER_WORD
102 add eax, [ebp + 12] ; eax <- (br->words-cwords)*FLAC__BYTES_PER_WORD + br->bytes
103 shl eax, 3 ; eax <- (br->words-cwords)*FLAC__BITS_PER_WORD + br->bytes*8
104 sub eax, ecx ; eax <- (br->words-cwords)*FLAC__BITS_PER_WORD + br->bytes*8 - cbits
118 …cmp esi, [ebp + 8] ; while(cwords < br->words) /* if we've not consumed up to a partial tai…
[all …]
/external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/
DJUnitCodeGen.java343 List<String> words = new ArrayList<String>(); in normalizeTreeSpec() local
349 words.add(word.toString()); in normalizeTreeSpec()
352 words.add(String.valueOf(t.charAt(i))); in normalizeTreeSpec()
359 words.add(word.toString()); in normalizeTreeSpec()
383 words.add(word.toString()); in normalizeTreeSpec()
391 words.add(word.toString()); in normalizeTreeSpec()
395 for (int j=0; j<words.size(); j++) { in normalizeTreeSpec()
396 if ( j>0 && !words.get(j).equals(")") && in normalizeTreeSpec()
397 !words.get(j-1).equals("(") ) { in normalizeTreeSpec()
400 buf.append(words.get(j)); in normalizeTreeSpec()
/external/parameter-framework/tools/bash_completion/
Dremote-process40 local cur prev words cword;
52 "${words[0]}" "${words[1]}" "${words[2]}" "$@" |sed 's#\r##;/^$/d'
62 local command=${words[3]}
94 parameterCommand="listDomainElements ${words[4]}"
116 options=$(_remoteProcessWrapper listConfigurations "${words[4]}")
/external/boringssl/src/crypto/bn/
Dbn.c282 BIGNUM *bn_wexpand(BIGNUM *bn, unsigned words) { in bn_wexpand() argument
285 if (words <= (unsigned) bn->dmax) { in bn_wexpand()
289 if (words > (INT_MAX / (4 * BN_BITS2))) { in bn_wexpand()
299 a = (BN_ULONG *)OPENSSL_malloc(sizeof(BN_ULONG) * words); in bn_wexpand()
309 bn->dmax = words; in bn_wexpand()
/external/llvm/test/CodeGen/XCore/
Dbigstructret.ll6 ; Structs of 4 words are returned in registers
22 ; Structs of more than 4 words are partially returned in memory so long as the
36 ; Check we call a function returning more than 4 words correctly.
52 ; Variadic functions return structs bigger than 4 words via a hidden
/external/protobuf/src/google/protobuf/
Drepeated_field_unittest.cc1298 std::vector<string> words; member in google::protobuf::__anon42b75c540111::RepeatedFieldInsertionIteratorsTest
1322 words.push_back("Able"); in SetUp()
1323 words.push_back("was"); in SetUp()
1324 words.push_back("I"); in SetUp()
1325 words.push_back("ere"); in SetUp()
1326 words.push_back("I"); in SetUp()
1327 words.push_back("saw"); in SetUp()
1328 words.push_back("Elba"); in SetUp()
1329 std::copy(words.begin(), words.end(), in SetUp()
1372 ASSERT_EQ(words.size(), protobuffer.repeated_string_size()); in TEST_F()
[all …]

12345678910>>...18