Searched defs:words (Results 1 - 25 of 62) sorted by last modified time

123

/external/webkit/Source/WebKit/android/content/
H A Daddress_detector.cpp59 // Minimum number of words in an address after the house number
64 // Maximum number of words allowed in an address between the house number
76 // Maximum number of words after the house number in which the location name
171 // detected. Start tokenizing the following words to find a valid
186 std::vector<Word> words; local
187 words.push_back(house_number);
199 if (next_word == words.size()) {
214 words.push_back(Word(tokenizer.token_begin(), tokenizer.token_end()));
219 const Word& current_word = words[next_word];
230 // of words i
486 FindStateStartingInWord(WordList* words, size_t state_first_word, size_t* state_last_word, String16Tokenizer* tokenizer, size_t* state_index) argument
[all...]
/external/webkit/Source/WebKit/qt/WebCoreSupport/
H A DInspectorServerQt.cpp208 QStringList words = m_path.split(QLatin1Char('/')); local
235 if ((words.size() == 4)
236 && (words[1] == QString::fromLatin1("devtools"))
237 && (words[2] == QString::fromLatin1("page"))) {
238 int pageNum = words[3].toInt();
/external/webkit/Source/WebKit/qt/tests/qwebpage/
H A Dtst_qwebpage.cpp2678 QStringList words = (QStringList() << "foo" << "bar"); local
2681 foreach (QString subString, words) {
/external/webkit/Source/JavaScriptCore/wtf/
H A DBitmap.h50 static const WordType words = (size + wordSize - 1) / wordSize; member in class:WTF::Bitmap
59 FixedArray<WordType, words> bits;
138 for (size_t i = start / wordSize; i < words; ++i)
146 for (size_t i = 0; i < words; ++i)
155 for (size_t i = 0; i < words; ++i)
H A Ddtoa.cpp185 uint32_t* words() function in struct:WTF::BigInt
190 const uint32_t* words() const function in struct:WTF::BigInt
212 uint32_t* x = b.words();
237 b.words()[0] = y9;
326 b.words()[0] = i;
360 for (xc = c.words(), xa = xc + wc; xc < xa; xc++)
362 xa = a->words();
364 xb = b->words();
366 xc0 = c.words();
412 for (xc0 = c.words(), x
[all...]
/external/v8/src/mips/
H A Dsimulator-mips.cc513 int32_t words; local
515 words = 10;
517 if (!GetValue(argv[next_arg], &words)) {
518 words = 10;
521 end = cur + words;
722 PrintF("stack [<words>]\n");
723 PrintF(" dump stack content, default dump 10 words)\n");
724 PrintF("mem <address> [<words>]\n");
725 PrintF(" dump memory content, default dump 10 words)\n");
/external/valgrind/main/coregrind/
H A Dm_sparsewa.c3 /*--- An sparse array (of words) implementation. ---*/
57 UWord words[256]; member in struct:__anon14268
207 *valP = level0->words[curr_ix];
306 *valP = level0->words[ix];
362 level0->words[ix] = val;
407 *oldV = level0->words[ix];
/external/valgrind/main/helgrind/
H A Dhg_main.c3720 /* Allocates a duplicate of words. Caller must HG_(free) the result. */
3721 static UWord* UWordV_dup(UWord* words, Word words_size) argument
3731 dup[i] = words[i];
4060 be exactly the start of a block or up to 15 words inside. This
H A Dhg_wordset.c3 /*--- Sets of words, with unique set identifiers. ---*/
137 UWord* words; member in struct:__anon14525
192 wv->words = NULL;
195 wv->words = wsu->alloc( wsu->cc, (SizeT)sz * sizeof(UWord) );
203 if (wv->words) {
204 dealloc(wv->words);
228 if (wv1->words[i] == wv2->words[i])
230 if (wv1->words[i] < wv2->words[
447 getPayloadWS( UWord** words, UWord* nWords, WordSetU* wsu, WordSet ws ) argument
[all...]
/external/valgrind/main/include/vki/
H A Dvki-s390x-linux.h718 vki_per_cr_words words; member in union:__anon14627::__anon14628
736 vki_per_lowcore_words words; member in union:__anon14627::__anon14629
/external/valgrind/main/memcheck/tests/
H A Dwrap6.c182 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[
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...]
/external/svox/pico/tts/
H A Dcom_svox_picottsengine.cpp750 * Wrap all individual words in <phoneme> tags.
777 char * words[numWords]; local
781 words[j] = new char[i+1-start+17];
782 words[j][0] = '\0';
783 strcat( words[j], PICO_PHONEME_OPEN_TAG);
784 strncat(words[j], xsampa+start, i-start);
785 strcat( words[j], PICO_PHONEME_CLOSE_TAG);
788 totalLength += strlen(words[j-1]);
791 words[j] = new char[i+1-start+17];
792 words[
[all...]
/external/tcpdump/missing/
H A Dinet_ntop.c118 u_long words [IN6ADDRSZ / INT16SZ]; local
125 memset (words, 0, sizeof(words));
127 words[i/2] |= (src[i] << ((1 - (i % 2)) << 3));
133 if (words[i] == 0)
173 (best.len == 6 || (best.len == 5 && words[5] == 0xffff)))
183 tp += sprintf (tp, "%lX", words[i]);
/external/tcpdump/
H A Dprint-smb.c173 print_trans2(const u_char *words, const u_char *dat, const u_char *buf, const u_char *maxbuf) argument
178 const u_char *w = words + 1;
182 TCHECK(words[0]);
191 if (words[0] == 0) {
206 if (words[0] == 8) {
207 smb_fdata(words + 1,
212 smb_fdata(words + 1,
214 words + 1 + 14 * 2, unicodestr);
219 smb_fdata(words + 1,
221 words
336 print_trans(const u_char *words, const u_char *data1, const u_char *buf, const u_char *maxbuf) argument
398 print_negprot(const u_char *words, const u_char *data, const u_char *buf _U_, const u_char *maxbuf) argument
439 print_sesssetup(const u_char *words, const u_char *data, const u_char *buf _U_, const u_char *maxbuf) argument
483 print_lockingandx(const u_char *words, const u_char *data, const u_char *buf _U_, const u_char *maxbuf) argument
801 const u_char *words, *maxwords, *data; local
[all...]
/external/v8/src/arm/
H A Dsimulator-arm.cc398 int32_t words; local
400 words = 10;
402 if (!GetValue(argv[next_arg], &words)) {
403 words = 10;
406 end = cur + words;
574 PrintF("stack [<words>]\n");
575 PrintF(" dump stack content, default dump 10 words)\n");
576 PrintF("mem <address> [<words>]\n");
577 PrintF(" dump memory content, default dump 10 words)\n");
/external/srec/srec/include/
H A Dsrec_context.h53 /* ptr32* words; c55 ?? */
54 char** words; /* size max_words */ member in struct:__anon13059
146 /* search capabilities, return error if adding words beyond this! */
/external/qemu/distrib/sdl-1.2.15/src/cdrom/macos/
H A DSDL_syscdrom_c.h113 short words[11]; member in union:CDCntrlParam::__anon11102
/external/qemu/distrib/jpeg-6b/
H A Dansi2knr.c506 { static char *words[] = local
513 char **key = words;
/external/protobuf/src/google/protobuf/
H A Drepeated_field_unittest.cc853 std::vector<string> words; member in class:google::protobuf::__anon10702::RepeatedFieldInsertionIteratorsTest
877 words.push_back("Able");
878 words.push_back("was");
879 words.push_back("I");
880 words.push_back("ere");
881 words.push_back("I");
882 words.push_back("saw");
883 words.push_back("Elba");
884 std::copy(words.begin(), words
[all...]
/external/ping6/
H A Dping6.c1885 u_int16_t words; /*32bit count*/ member in struct:cbit
1917 if (sizeof(cbit) + ntohs(cbit.words) * sizeof(v) >
1921 clen = ntohs(cbit.words) * sizeof(v);
/external/openssl/crypto/bn/
H A Dbn_lib.c298 /* The caller MUST check that words > b->dmax before calling this */
299 static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words) argument
307 if (words > (INT_MAX/(4*BN_BITS2)))
317 a=A=(BN_ULONG *)OPENSSL_malloc(sizeof(BN_ULONG)*words);
356 memset(A,0,sizeof(BN_ULONG)*words);
375 BIGNUM *bn_dup_expand(const BIGNUM *b, int words) argument
382 * words <= b->dmax && top < words
387 if (words > b->dmax)
389 BN_ULONG *a = bn_expand_internal(b, words);
426 bn_expand2(BIGNUM *b, int words) argument
[all...]
/external/openssh/openbsd-compat/
H A Dinet_ntop.c120 u_int words[IN6ADDRSZ / INT16SZ]; local
129 memset(words, '\0', sizeof words);
131 words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
135 if (words[i] == 0) {
179 (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
185 advance = snprintf(tp, ep - tp, "%x", words[i]);
/external/netperf/
H A Dnetlib.c550 unsigned int words[2];
569 conv_rec.words[0] = htonl(conv_rec.words[0]);
570 conv_rec.words[1] = htonl(conv_rec.words[1]);
582 unsigned int scratch = conv_rec.words[0];
583 conv_rec.words[0] = conv_rec.words[1];
584 conv_rec.words[1] = scratch;
599 unsigned int words[
545 unsigned int words[2]; member in union:__anon10137
594 unsigned int words[2]; member in union:__anon10138
2453 long words[2]; member in union:overlay_u
2474 long words[2]; member in union:overlay_u
[all...]
/external/mksh/src/
H A Dedit.c236 x_print_expansions(int nwords, char * const *words, bool is_command) argument
247 (prefix_len = x_longest_prefix(nwords, words)) > 0) {
252 prefix_len = x_basename(words[0], NULL);
255 if (x_basename(words[i] + prefix_len, NULL) >
260 while (prefix_len > 0 && words[0][prefix_len - 1] != '/')
265 XPput(l, words[i] + prefix_len);
274 pr_list(use_copy ? (char **)XPptrv(l) : words);
291 char **words; local
317 * Convert "foo*" (toglob) to an array of strings (words)
332 words
415 char **words = (char **)XPptrv(w); local
437 char **words = (char **)XPptrv(w); local
520 char **words = NULL; local
611 x_longest_prefix(int nwords, char * const * words) argument
631 x_free_words(int nwords, char **words) argument
696 char *xp, **words; local
2640 char **words; local
2674 char **words; local
5122 char **words; local
5176 char **words; local
5290 char **words; local
[all...]
/external/llvm/lib/Support/
H A DAPInt.cpp97 // Calculate the number of words to copy
98 unsigned words = std::min<unsigned>(bigVal.size(), getNumWords()); local
99 // Copy the words from bigVal to pVal
100 memcpy(pVal, bigVal.data(), words * APINT_WORD_SIZE);
135 // assume case where both are single words is already handled
208 /// In other words, if y > x then this function returns 1, otherwise 0.
298 // Split x into high and low words
536 // Otherwise, compare all words
766 /// non-overlapping, of Words words, by Shift, which must be less than 64.
894 // extract the high 52 bits from the correct words i
[all...]

Completed in 682 milliseconds

123