/external/flac/libFLAC/ |
H A D | bitwriter.c | 79 static const unsigned FLAC__BITWRITER_DEFAULT_CAPACITY = 32768u / sizeof(bwword); /* size in words */ 81 static const unsigned FLAC__BITWRITER_DEFAULT_INCREMENT = 4096u / sizeof(bwword); /* size in words */ 83 #define FLAC__WORDS_TO_BITS(words) ((words) * FLAC__BITS_PER_WORD) 84 #define FLAC__TOTAL_BITS(bw) (FLAC__WORDS_TO_BITS((bw)->words) + (bw)->bits) 105 unsigned capacity; /* capacity of buffer in words */ 106 unsigned words; /* # of complete words in buffer */ member in struct:FLAC__BitWriter 128 /* calculate total words needed to store 'bits_to_add' additional bits */ 129 new_capacity = bw->words [all...] |
/external/webkit/Source/WebKit/android/content/ |
H A D | address_detector.cpp | 59 // 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...] |
H A D | address_detector.h | 117 static bool FindStateStartingInWord(WordList* words,
|
/external/llvm/utils/emacs/ |
H A D | tablegen-mode.el | 17 'words)) 19 'words))
|
/external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/ |
H A D | SHA1ImplTest.java | 66 int[] words = new int[INDEX +6]; // working array to compute hash 72 for (int i = 0; i < words.length; i++ ) { 73 words[i] = 0; 75 words[0] = 0x61626380; // constants from Secure Hash Standard 76 words[15] = 0x00000018; 78 alternateHash(words, hash1); 102 * if data supplied takes exactly fourteen words of sixteen word buffer.
|
/external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/ |
H A D | JUnitCodeGen.java | 343 List<String> words = new ArrayList<String>(); 349 words.add(word.toString()); 352 words.add(String.valueOf(t.charAt(i))); 359 words.add(word.toString()); 383 words.add(word.toString()); 391 words.add(word.toString()); 393 //System.out.println("words="+words); 395 for (int j=0; j<words.size(); j++) { 396 if ( j>0 && !words [all...] |
/external/webkit/Source/JavaScriptCore/wtf/ |
H A D | dtoa.cpp | 185 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/chromium/chrome/common/extensions/docs/examples/extensions/fx/ |
H A D | bg.js | 23 // Map of query parameter words to sounds. 289 var words = q.split(" "); 290 for (j in words) { 291 if (searchSounds[words[j]]) { 292 console.log("searchSound: " + words[j]); 293 playNavSound(words[j]);
|
/external/openssl/crypto/bn/ |
H A D | bn_lib.c | 298 /* 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/libvpx/examples/includes/geshi/geshi/ |
H A D | avisynth.php | 19 * * There are also some special words that can't currently be specified directly in GeSHi as they may 52 // Reserved words.
|
H A D | abap.php | 23 * Be aware that some words may be highlighted several times like for "ref to data", which is first 31 * + unchanged style for other words. 47 * style, but should be ignored. Same problem for all words!!! This is quite impossible to 50 * - Some words are considered as being statement names (report, tables, etc.) though they 54 * - if a comment is between 2 words of a keyword (for example SEPARATED "comment \n BY),
|
/external/protobuf/src/google/protobuf/ |
H A D | repeated_field_unittest.cc | 853 std::vector<string> words; member in class:google::protobuf::__anon10109::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/mksh/src/ |
H A D | edit.c | 236 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/compiler-rt/make/ |
H A D | lib_util.mk | 20 $(if $(call streq,1,$(words $(Tmp.SelectFunctionDir))),\ 23 $(if $(call streq,0,$(words $(Tmp.SelectFunctionDir))),\
|
/external/qemu/distrib/sdl-1.2.15/src/cdrom/macos/ |
H A D | SDL_syscdrom_c.h | 113 short words[11]; member in union:CDCntrlParam::__anon10509
|
/external/webkit/Tools/Scripts/ |
H A D | do-file-rename | 41 my %words;
|
/external/webkit/Source/WebKit/qt/WebCoreSupport/ |
H A D | InspectorServerQt.cpp | 208 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/chromium/chrome/browser/bookmarks/ |
H A D | bookmark_utils.cc | 179 // Returns true if |text| contains each string in |words|. This is used when 182 const std::vector<string16>& words) { 183 for (size_t i = 0; i < words.size(); ++i) { 184 if (text.find(words[i]) == string16::npos) 190 // Returns true if |node|s title or url contains the strings in |words|. 193 const std::vector<string16>& words, 197 l10n_util::ToLower(node->GetTitle()), words) || 199 l10n_util::ToLower(UTF8ToUTF16(node->GetURL().spec())), words) || 202 UnescapeRule::NORMAL, NULL, NULL, NULL)), words); 520 std::vector<string16> words; local 181 DoesBookmarkTextContainWords(const string16& text, const std::vector<string16>& words) argument 192 DoesBookmarkContainWords(const BookmarkNode* node, const std::vector<string16>& words, const std::string& languages) argument 522 parser.ExtractQueryWords(l10n_util::ToLower(text), &words); local 540 std::vector<string16> words; local 542 parser.ExtractQueryWords(l10n_util::ToLower(text), &words); local [all...] |
/external/svox/pico/tts/ |
H A D | com_svox_picottsengine.cpp | 750 * 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/srec/srec/crec/ |
H A D | srec_context.c | 152 if (strstr(context->olabels->words[1], "enroll")) return 1; 314 * words * 340 /* *pwmap->words = (ptr32*) CALLOC_CLR(wmap->max_words, sizeof(ptr32), "graph.wordmap.words"); */ 341 Interface->words = (char**) CALLOC_CLR(Interface->max_words, sizeof(char*), "srec.graph.wordmap.words"); 380 /* figure out the number of words */ 412 if (!IS_SLOT_OLABEL(wmap->words[my_wID])) 431 if (((*wmap)->words)) FREE((*wmap)->words); [all...] |
H A D | srec_debug.c | 61 p = rec->context->olabels->words[ftoken->word]; 111 if (wordids[i] < context->olabels->num_words) p = context->olabels->words[wordids[i]];
|
/external/chromium/chrome/browser/history/ |
H A D | in_memory_url_index.cc | 181 // Split URL into individual, unique words then add in the title words. 185 String16Set words; local 188 std::insert_iterator<String16Set>(words, words.begin())); 189 for (String16Set::iterator word_iter = words.begin(); 190 word_iter != words.end(); ++word_iter) 405 // Break the terms down into individual terms (words), get the candidate 409 // is four words: 'http', 'www', 'somewebsite', and 'com'. 411 String16Set words local 475 String16Vector words = WordVectorFromString16(uni_string, false); local 489 String16Vector words; local [all...] |
/external/dbus/dbus/ |
H A D | dbus-shell.c | 310 * removal. Field splitting may increase the number of words. 311 * Quote removal does not increase the number of words. 583 * remove any zero-length words that didn't contain quotes 584 * originally; but since there's no expansion we know all words have
|
/external/valgrind/main/helgrind/ |
H A D | hg_wordset.h | 3 /*--- Sets of words, with unique set identifiers. ---*/ 92 void HG_(getPayloadWS) ( /*OUT*/UWord** words, /*OUT*/UWord* nWords,
|
/external/valgrind/main/coregrind/ |
H A D | m_sparsewa.c | 3 /*--- An sparse array (of words) implementation. ---*/ 57 UWord words[256]; member in struct:__anon13675 207 *valP = level0->words[curr_ix]; 306 *valP = level0->words[ix]; 362 level0->words[ix] = val; 407 *oldV = level0->words[ix];
|