/external/mesa3d/src/glsl/glcpp/tests/ |
H A D | 039-func-arg-obj-macro-with-comma.c | 2 #define bar two,words
|
/external/valgrind/main/none/tests/x86/ |
H A D | cpuid.stdout.exp | 1 cpuid words (0): 0x........ 0x........ 0x........ 0x........ 2 cpuid words (1): 0x........ 0x........ 0x........ 0x........
|
/external/dropbear/libtomcrypt/src/pk/asn1/der/object_identifier/ |
H A D | der_length_object_identifier.c | 35 @param nwords The number of OID words 36 @param words The actual OID words to get the size of 40 int der_length_object_identifier(unsigned long *words, unsigned long nwords, unsigned long *outlen) argument 44 LTC_ARGCHK(words != NULL); 48 /* must be >= 2 words */ 54 if (words[0] > 3 || (words[0] < 2 && words[1] > 39)) { 60 wordbuf = words[ [all...] |
H A D | der_encode_object_identifier.c | 21 @param words The words to encode (upto 32-bits each) 22 @param nwords The number of words in the OID 27 int der_encode_object_identifier(unsigned long *words, unsigned long nwords, argument 33 LTC_ARGCHK(words != NULL); 38 if ((err = der_length_object_identifier(words, nwords, &x)) != CRYPT_OK) { 48 wordbuf = words[0] * 40 + words[1]; 53 wordbuf = words[y + 1]; 74 wordbuf = words[ [all...] |
H A D | der_decode_object_identifier.c | 20 Decode OID data and store the array of integers in words 23 @param words [out] The destination of the OID words 24 @param outlen [in/out] The number of OID words 28 unsigned long *words, unsigned long *outlen) 33 LTC_ARGCHK(words != NULL); 41 /* must be room for at least two words */ 70 /* decode words */ 81 words[0] = t / 40; 82 words[ 27 der_decode_object_identifier(const unsigned char *in, unsigned long inlen, unsigned long *words, unsigned long *outlen) argument [all...] |
/external/webkit/Tools/android/flex-2.5.4a/MISC/fastwc/ |
H A D | wc4.l | 6 words {word}{ws}+ 13 {words}{word}{ws}* wc += 2; cc += yyleng; 14 {words}{word}{ws}*\n wc += 2; cc += yyleng; ++lc; 15 {words}{2}{word}{ws}* wc += 3; cc += yyleng; 16 {words}{2}{word}{ws}*\n wc += 3; cc += yyleng; ++lc; 17 {words}{3}{word}{ws}* wc += 4; cc += yyleng; 18 {words}{3}{word}{ws}*\n wc += 4; cc += yyleng; ++lc;
|
H A D | wc3.l | 6 words {word}{ws}+ 13 {words}{word}{ws}* cc += yyleng; wc += 2; 14 {words}{2}{word}{ws}* cc += yyleng; wc += 3; 15 {words}{3}{word}{ws}* cc += yyleng; wc += 4;
|
H A D | wc5.l | 6 words {word}{ws}+ 13 {words}{word} cc += yyleng; wc += 2; /* oops */ 14 {words}{2}{word}{ws}* cc += yyleng; wc += 3; 15 {words}{3}{word}{ws}* cc += yyleng; wc += 4;
|
/external/valgrind/main/memcheck/tests/ |
H A D | wrap6.c | 182 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/valgrind/main/helgrind/ |
H A D | hg_wordset.c | 3 /*--- Sets of words, with unique set identifiers. ---*/ 137 UWord* words; member in struct:__anon13932 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/chromium/chrome/browser/history/ |
H A D | query_parser.cc | 79 virtual bool HasMatchIn(const std::vector<QueryWord>& words, 83 virtual void AppendWords(std::vector<string16>* words) const; 90 bool QueryNodeWord::HasMatchIn(const std::vector<QueryWord>& words, argument 92 for (size_t i = 0; i < words.size(); ++i) { 93 if (Matches(words[i].word, false)) { 94 size_t match_start = words[i].position; 111 void QueryNodeWord::AppendWords(std::vector<string16>* words) const { 112 words->push_back(word_); 148 virtual bool HasMatchIn(const std::vector<QueryWord>& words, argument 153 virtual void AppendWords(std::vector<string16>* words) cons 218 HasMatchIn( const std::vector<QueryWord>& words, Snippet::MatchPositions* match_positions) const argument 284 ExtractQueryWords(const string16& query, std::vector<string16>* words) argument 366 ExtractQueryWords(const string16& text, std::vector<QueryWord>* words) argument [all...] |
H A D | query_parser.h | 36 // the number of words in this node. 47 // Returns true if this node matches at least one of the words in words. If 50 virtual bool HasMatchIn(const std::vector<QueryWord>& words, 53 // Appends the words that make up this node in |words|. 54 virtual void AppendWords(std::vector<string16>* words) const = 0; 72 // sqlite_query and the number of words is returned. 76 // Parses the query words in query, returning the nodes that constitute the 77 // valid words i [all...] |
/external/llvm/utils/emacs/ |
H A D | llvm-mode.el | 22 `(,(regexp-opt '("void" "i[0-9]+" "float" "double" "type" "label" "opaque") 'words) . font-lock-type-face) 34 "pointersize" "deplibs" "volatile" "fastcc" "coldcc" "cc") 'words) . font-lock-keyword-face) 37 "setne" "seteq" "setlt" "setgt" "setle" "setge") 'words) . font-lock-keyword-face) 39 `(,(regexp-opt '("phi" "tail" "call" "cast" "select" "to" "shl" "shr" "vaarg" "vanext") 'words) . font-lock-keyword-face) 41 `(,(regexp-opt '("ret" "br" "switch" "invoke" "unwind" "unreachable") 'words) . font-lock-keyword-face) 43 `(,(regexp-opt '("malloc" "alloca" "free" "load" "store" "getelementptr") 'words) . font-lock-keyword-face)
|
/external/icu4c/common/ |
H A D | dictbe.cpp | 103 // List size, limited by the maximum number of words in the dictionary 192 // How many words in a row are "good enough"? 211 // Minimum number of characters for two words 249 return 0; // Not enough characters for two words 256 PossibleWord words[THAI_LOOKAHEAD]; local 264 // Look for candidate words at the current position 265 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); 269 wordLength = words[wordsFound%THAI_LOOKAHEAD].acceptMarked(text); 273 // If there was more than one, see which one can take us forward the most words 281 if (words[(wordsFoun 489 PossibleWord words[KHMER_LOOKAHEAD]; local [all...] |
/external/tcpdump/ |
H A D | print-smb.c | 173 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/openssh/openbsd-compat/ |
H A D | inet_ntop.c | 120 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/qemu/distrib/sdl-1.2.15/src/cdrom/macos/ |
H A D | SDL_syscdrom.c | 170 cdpb.csParam.words[0] = kGetTrackRange; 191 cdpb.csParam.words[0] = kGetLeadOutArea; 208 cdpb.csParam.words[0] = kGetTrackEntries; /* Type of Query */ 209 * ((long *) (cdpb.csParam.words+1)) = (long) tracks; 210 cdpb.csParam.words[3] = cdrom->numtracks * sizeof(tracks[0]); 211 * ((char *) (cdpb.csParam.words+4)) = 1; /* First track */ 265 cdpb.csParam.words[0] = kGetTrackRange; 356 cdpb.csParam.words[0] = kBlockPosition; /* Position Mode */ 357 *(long *) (cdpb.csParam.words + 1) = start+length-1; /* Search Address */ 368 cdpb.csParam.words[ [all...] |
/external/tcpdump/missing/ |
H A D | inet_ntop.c | 118 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/libffi/src/powerpc/ |
H A D | asm.h | 84 #define EALIGN_W_0 /* No words to insert. */ 93 /* EALIGN is like ENTRY, but does alignment to 'words'*4 bytes 96 #define EALIGN(name, alignt, words) \ 104 EALIGN_W_##words; \ 107 #define EALIGN(name, alignt, words) \ 111 EALIGN_W_##words; \
|
/external/openssh/ |
H A D | mdoc2man.awk | 47 retval=retval words[++w] 74 nwords=split($0,words) 77 if(match(words[w],"^Li|Pf$")) { 79 } else if(match(words[w],"^Xo$")) { 84 } else if(match(words[w],"^Xc$")) { 90 } else if(match(words[w],"^Bd$")) { 92 if(match(words[w+1],"-literal")) { 97 } else if(match(words[w],"^Ed$")) { 100 } else if(match(words[w],"^Ns$")) { 105 } else if(match(words[ [all...] |
/external/flac/libFLAC/ |
H A D | 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_WOR [all...] |
/external/bison/lib/ |
H A D | lbitset.c | 40 /* Number of words to use for each element. The larger the value the 65 bitset_word words[LBITSET_ELT_WORDS]; /* Bits that are set. */ member in struct:lbitset_elt_struct 83 ((lbitset_elt *) (void *) ((char *) (X) - offsetof (lbitset_elt, words))) 150 memset (elt->words, 0, sizeof (elt->words)); 188 bset->b.cdata = next->words; 193 bset->b.cdata = prev->words; 220 bset->b.cdata = elt->prev->words; 247 if (elt->words[i]) 313 bset->b.cdata = elt->words; [all...] |
/external/webkit/Source/WebKit/qt/WebCoreSupport/ |
H A D | InspectorServerQt.h | 105 void handleInspectorRequest(QStringList words); 107 void handleResourceRequest(QStringList words);
|
/external/webkit/Source/JavaScriptCore/wtf/ |
H A D | Bitmap.h | 50 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)
|
/external/chromium/third_party/libjingle/source/talk/examples/call/ |
H A D | callclient.cc | 84 std::string GetWord(const std::vector<std::string>& words, argument 86 if (words.size() > index) { 87 return words[index]; 93 int GetInt(const std::vector<std::string>& words, size_t index, int def) { argument 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, [all...] |