|   /external/libffi/src/x86/ | 
| ffi64.c  | 127    of the operand.  The number of words is returned.  In case the parameter 169 	int words = (type->size + UNITS_PER_WORD - 1) / UNITS_PER_WORD;  local  178 	for (i = 0; i < words; i++) 202 	for (i = 0; i < words; i++) 220 	return words; 364   /* Allocate the space for the arguments, plus 4 words of temp space.  */
  | 
|   /external/llvm/lib/Support/ | 
| APInt.cpp  | 97     // 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     [all...] | 
|   /external/protobuf/src/google/protobuf/ | 
| repeated_field_unittest.cc  | 853   std::vector<string> words;  member in class:google::protobuf::__anon12911::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.end()     [all...] | 
|   /external/valgrind/main/coregrind/ | 
| m_sparsewa.c  | 3 /*--- An sparse array (of words) implementation.                   ---*/ 57       UWord words[256];  member in struct:__anon16803  207             *valP = level0->words[curr_ix]; 306    *valP = level0->words[ix]; 362    level0->words[ix] = val; 407    *oldV = level0->words[ix];
  | 
|   /external/webkit/Source/WebKit/qt/WebCoreSupport/ | 
| 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();
  | 
|   /frameworks/base/core/java/android/widget/ | 
| SimpleAdapter.java  | 354                             String[] words = str.split(" ");  local  355                             int wordCount = words.length; 358                                 String word = words[k];
  | 
| ArrayAdapter.java  | 486                         final String[] words = valueText.split(" ");  local  487                         final int wordCount = words.length; 491                             if (words[k].startsWith(prefixString)) {
  | 
|   /ndk/sources/host-tools/make-3.81/ | 
| ansi2knr.c  | 504 	   {	static char *words[] =  local  511 		char **key = words;
  | 
|   /sdk/eclipse/plugins/com.android.ide.eclipse.gldebugger/src/com/android/ide/eclipse/gltrace/format/ | 
| GLAPISpec.java  | 108         List<String> words = Arrays.asList(line.split(","));  local  110         String retType = words.get(0).trim(); 111         String func = words.get(1).trim(); 112         List<String> argDefinitions = words.subList(2, words.size());
  | 
|   /external/bison/lib/ | 
| bitset.h  | 57     bitset_word words[1];		/* The array of bits.  */  member in struct:bitset_union::abitset_struct 
  | 
| ebitset.c  | 49 /* Number of words to use for each element.  */ 61     bitset_word words[EBITSET_ELT_WORDS];	/* Bits that are set.  */  member in union:ebitset_elt_struct::__anon2281  95 #define EBITSET_WORDS(ELT) ((ELT)->u.words)
  | 
| lbitset.c  | 41 /* Number of words to use for each element.  The larger the value the 66   bitset_word words[LBITSET_ELT_WORDS];	/* Bits that are set.  */  member in struct:lbitset_elt_struct  84   ((lbitset_elt *) (void *) ((char *) (X) - offsetof (lbitset_elt, words))) 151   memset (elt->words, 0, sizeof (elt->words)); 189 	  bset->b.cdata = next->words; 194 	  bset->b.cdata = prev->words; 221       bset->b.cdata = elt->prev->words; 248     if (elt->words[i]) 314   bset->b.cdata = elt->words;     [all...] | 
|   /external/chromium/chrome/browser/bookmarks/ | 
| 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  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/flac/libFLAC/ | 
| bitreader.c  | 81  * This should be at least twice as large as the largest number of words 94 static const unsigned FLAC__BITREADER_DEFAULT_CAPACITY = 65536u / FLAC__BITS_PER_WORD; /* in words */ 140 	unsigned capacity; /* in words */ 141 	unsigned words; /* # of completed words in buffer */  member in struct:FLAC__BitReader  142 	unsigned bytes; /* # of bytes in incomplete word at buffer[words] */ 143 	unsigned consumed_words; /* #words ... */ 217 		end = br->words + (br->bytes? 1:0); 220 		br->words -= start; 227 	bytes = (br->capacity - br->words) * FLAC__BYTES_PER_WORD - br->bytes     [all...] | 
|   /external/iproute2/lib/ | 
| utils.c  | 455 	int words = bits >> 0x05;  local  459 	if (words) 460 		if (memcmp(a1, a2, words << 2)) 467 		w1 = a1[words]; 468 		w2 = a2[words];
  | 
|   /external/libffi/src/powerpc/ | 
| ffi.c  | 437   int i, words;  local  524 	  words = ((*ptr)->size + 7) / 8; 525 	  if (next_arg.ul >= gpr_base.ul && next_arg.ul + words > gpr_end.ul) 530 	      next_arg.c = rest.c + words * 8 - first; 542 	      next_arg.ul += words; 712     /* The first NUM_GPR_ARG_REGISTERS words of integer arguments, and the 764 	    /* 'long long' arguments are passed as two words, but 765 	       either both words must fit in registers or both go     [all...] | 
|   /external/qemu/distrib/sdl-1.2.15/src/cdrom/macos/ | 
| SDL_syscdrom_c.h  | 113 		short				words[11];  member in union:CDCntrlParam::__anon13311 
  | 
|   /ndk/sources/host-tools/sed-4.2.1/sed/ | 
| fmt.c  | 95 /* Size of paragraph buffer in words.  Longer paragraphs are handled 182 /* The words of a paragraph -- longer paragraphs are handled neatly 184 static WORD words[MAXWORDS];  variable  259   word_limit = words; 299    after the prefix, and the following indent, and break it into words. 312   end_of_word = &words[MAXWORDS - 2]; 389    hitting the limit on the number of words or characters.  */ 409   for (w = words->next_break; w != word_limit; w = w->next_break) 421   /* Copy words from split_point down to word -- we use memmove because 424   memmove ((char *) words, (char *) split_point     [all...] | 
|   /bionic/libc/kernel/common/linux/ | 
| tcp.h  | 69  __u32 words[5];  member in union:tcp_word_hdr  71 #define tcp_flag_word(tp) ( ((union tcp_word_hdr *)(tp))->words [3])
  | 
|   /development/ndk/platforms/android-3/include/linux/ | 
| tcp.h  | 55  __u32 words[5];  member in union:tcp_word_hdr  58 #define tcp_flag_word(tp) ( ((union tcp_word_hdr *)(tp))->words [3]) 
  | 
|   /external/chromium/third_party/libjingle/source/talk/examples/call/ | 
| callclient.cc  | 84 std::string GetWord(const std::vector<std::string>& words, 86   if (words.size() > index) { 87     return words[index]; 93 int GetInt(const std::vector<std::string>& words, size_t index, int def) { 95   if (words.size() > index && talk_base::FromString(words[index], &val)) { 141   std::vector<std::string> words;  local  155         words.push_back(word); 163   const std::string& command = GetWord(words, 0, ""); 169       options.video_bandwidth = GetInt(words, 1, cricket::kAutoBandwidth)     [all...] | 
|   /external/icu4c/common/ | 
| dictbe.cpp  | 97 // List size, limited by the maximum number of words in the dictionary 186 // How many words in a row are "good enough"? 205 // Minimum number of characters for two words 243         return 0;       // Not enough characters for two words 250     PossibleWord words[THAI_LOOKAHEAD];  local  258         // Look for candidate words at the current position 259         int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); 263             wordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text); 266         // If there was more than one, see which one can take us forward the most words 274                 if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0)  482  PossibleWord words[KHMER_LOOKAHEAD];  local      [all...] | 
|   /external/icu4c/test/intltest/ | 
| rbbiapts.cpp  | 1112  UnicodeString words = "one two three ";  local      [all...] | 
|   /external/iproute2/ip/ | 
| ipxfrm.c  | 75 	int words = bits >> 0x05;  local  79 	if (words) 80 		if (memcmp(a1, a2, words << 2)) 87 		w1 = a1[words]; 88 		w2 = a2[words];
  | 
|   /external/srec/srec/include/ | 
| srec_context.h  | 53   /* ptr32* words; c55 ?? */ 54   char** words;               /* size max_words */  member in struct:__anon15482  146   /* search capabilities, return error if adding words beyond this! */
  |