/external/srec/portable/src/ |
H A D | PFileSystem.c | 181 LCHAR** tokens = NULL; local 207 CHKLOG(rc, PFileSystemLinearToPathTokens(path, &tokens, &tokenLen)); 212 if (LSTRCMP(tokens[i], L("../")) == 0) 220 else if (LSTRCMP(tokens[i], L("./")) == 0) 232 LSTRCAT(path, tokens[i]); 233 FREE(tokens[i]); 234 tokens[i] = NULL; 236 FREE(tokens); 239 if (tokens != NULL) 243 FREE(tokens[ [all...] |
/external/webkit/Source/ThirdParty/ANGLE/src/compiler/preprocessor/ |
H A D | tokens.c | 45 // tokens.c 337 TokenStream *tokens; member in struct:TokenInputSrc 343 int token = ReadToken(in->tokens, yylvalpp); 367 in->tokens = ts; 435 /////////////////////////////////////// End of tokens.c ///////////////////////////////////////
|
/external/webkit/Tools/DumpRenderTree/gtk/ |
H A D | ImageDiff.cpp | 202 gchar** tokens = g_strsplit(buffer, " ", 0); local 203 if (!tokens[1]) { 204 g_strfreev(tokens); 209 long imageSize = strtol(tokens[1], 0, 10); 210 g_strfreev(tokens);
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | BufferedTreeNodeStream.cs | 134 protected ITokenStream tokens; field in class:Antlr.Runtime.Tree.BufferedTreeNodeStream 195 return tokens; 198 tokens = value; 515 if (tokens != null) { 525 return tokens.ToString(beginTokenIndex, endTokenIndex);
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
H A D | BaseRecognizer.java | 148 //System.out.println("viable tokens="+follow.toString(getTokenNames())); 378 * rule invocation, the parser pushes the set of tokens that can 381 * enclosing rule. This local follow set only includes tokens 389 * thing to do is to consume tokens until you see something that 391 * You don't want the exact set of viable next tokens because the 393 * rest of the input looking for one of the missing tokens. 405 * At each rule invocation, the set of tokens that could follow 430 * all context-sensitive FOLLOW sets--the set of all tokens that 432 * resync to one of those tokens. Note that FOLLOW(c)='^' and if 475 * viable tokens tha 774 toStrings(List tokens) argument [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | BufferedTreeNodeStream.java | 103 protected TokenStream tokens; field in class:BufferedTreeNodeStream 275 return tokens; 278 public void setTokenStream(TokenStream tokens) { argument 279 this.tokens = tokens; 436 if ( tokens!=null ) { 447 return tokens.toString(beginTokenIndex, endTokenIndex);
|
/external/chromium/chrome/common/net/gaia/ |
H A D | gaia_auth_fetcher.cc | 184 // All tokens should be session tokens except the gaia auth token. 202 // Helper method that extracts tokens from a successful reply. 212 vector<pair<string, string> > tokens; 213 base::SplitStringIntoKeyValuePairs(data, '=', '\n', &tokens); 214 for (vector<pair<string, string> >::iterator i = tokens.begin(); 215 i != tokens.end(); ++i) { 236 vector<pair<string, string> > tokens; 237 base::SplitStringIntoKeyValuePairs(data, '=', '\n', &tokens); 238 for (vector<pair<string, string> >::iterator i = tokens 405 vector<pair<string, string> > tokens; local [all...] |
/external/ipsec-tools/src/racoon/ |
H A D | gssapi.c | 444 gssapi_get_itokens(struct ph1handle *iph1, vchar_t **tokens) argument 470 *tokens = toks; 473 "%d itokens of length %zu\n", gps->gsscnt, (*tokens)->l); 479 gssapi_get_rtokens(struct ph1handle *iph1, vchar_t **tokens) argument 511 *tokens = toks;
|
/external/llvm/lib/MC/MCDisassembler/ |
H A D | EDDisassembler.cpp | 329 SmallVectorImpl<AsmToken> &tokens, 388 tokens.push_back(SpecificAsmLexer->getTok()); 328 parseInst(SmallVectorImpl<MCParsedAsmOperand*> &operands, SmallVectorImpl<AsmToken> &tokens, const std::string &str) argument
|
/external/skia/src/animator/ |
H A D | SkAnimatorScript.cpp | 152 const char* tokens = (const char*) callBack; local 154 if (MapEnums(tokens, token, len, (int*)&value->fOperand.fS32))
|
H A D | SkAnimatorScript2.cpp | 108 SkAnimatorScript_Enum(const char* tokens) : fTokens(tokens) {} argument
|
/external/webkit/Source/WebCore/bindings/js/ |
H A D | ScriptDebugServer.cpp | 87 Vector<String> tokens; local 88 breakpointId.split(":", tokens); 89 if (tokens.size() != 2) 92 intptr_t sourceIDValue = tokens[0].toIntPtr(&success); 95 unsigned lineNumber = tokens[1].toUInt(&success);
|
/external/webp/src/utils/ |
H A D | huffman_encode.c | 282 HuffmanTreeToken* tokens, 286 tokens->code = value; 287 tokens->extra_bits = 0; 288 ++tokens; 295 tokens->code = value; 296 tokens->extra_bits = 0; 297 ++tokens; 301 tokens->code = 16; 302 tokens->extra_bits = repetitions - 3; 303 ++tokens; 281 CodeRepeatedValues(int repetitions, HuffmanTreeToken* tokens, int value, int prev_value) argument 315 CodeRepeatedZeros(int repetitions, HuffmanTreeToken* tokens) argument 346 VP8LCreateCompressedHuffmanTree(const HuffmanTreeCode* const tree, HuffmanTreeToken* tokens, int max_tokens) argument [all...] |
/external/antlr/antlr-3.4/runtime/C/src/ |
H A D | antlr3baserecognizer.c | 560 // There is no information about the tokens that can follow the last one 594 // Now compute the visiable tokens that can follow this rule, according to context 788 /// During rule invocation, the parser pushes the set of tokens that can 791 /// enclosing rule. This local follow set only includes tokens 799 /// thing to do is to consume tokens until you see something that 801 /// You don't want the exact set of viable next tokens because the 803 /// rest of the input looking for one of the missing tokens. 815 /// At each rule invocation, the set of tokens that could follow 840 /// all context-sensitive FOLLOW sets--the set of all tokens that 842 /// resync to one of those tokens 1832 toStrings(pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_HASH_TABLE tokens) argument [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
H A D | BaseRecognizer.cs | 177 //System.out.println("viable tokens="+follow.toString(getTokenNames())); 405 * rule invocation, the parser pushes the set of tokens that can 408 * enclosing rule. This local follow set only includes tokens 416 * thing to do is to consume tokens until you see something that 418 * You don't want the exact set of viable next tokens because the 420 * rest of the input looking for one of the missing tokens. 432 * At each rule invocation, the set of tokens that could follow 457 * all context-sensitive FOLLOW sets--the set of all tokens that 459 * resync to one of those tokens. Note that FOLLOW(c)='^' and if 503 * viable tokens tha 824 ToStrings(ICollection<IToken> tokens) argument [all...] |
/external/antlr/antlr-3.4/runtime/Python/unittests/ |
H A D | testtree.py | 1263 tokens = [ variable in class:TestTreeIterator 1269 wiz = TreeWizard(adaptor, self.tokens) 1279 wiz = TreeWizard(adaptor, self.tokens) 1289 wiz = TreeWizard(adaptor, self.tokens) 1299 wiz = TreeWizard(adaptor, self.tokens) 1309 wiz = TreeWizard(adaptor, self.tokens) 1319 wiz = TreeWizard(adaptor, self.tokens) 1329 wiz = TreeWizard(adaptor, self.tokens)
|
/external/chromium/third_party/libjingle/source/talk/base/ |
H A D | logging.cc | 276 std::vector<std::string> tokens; local 277 tokenize(params, ' ', &tokens); 279 for (size_t i = 0; i < tokens.size(); ++i) { 280 if (tokens[i].empty()) 284 if (tokens[i] == "tstamp") { 286 } else if (tokens[i] == "thread") { 290 } else if (tokens[i] == "sensitive") { 292 } else if (tokens[i] == "verbose") { 294 } else if (tokens[i] == "info") { 296 } else if (tokens[ [all...] |
/external/freetype/src/psaux/ |
H A D | psobjs.c | 529 /* self-delimiting, single-character tokens */ 718 /* NB: `tokens' can be NULL if we only want to count */ 723 T1_Token tokens, 739 T1_Token cur = tokens; 756 if ( tokens != NULL && cur < limit ) 762 *pnum_tokens = (FT_Int)( cur - tokens ); 722 ps_parser_to_token_array( PS_Parser parser, T1_Token tokens, FT_UInt max_tokens, FT_Int* pnum_tokens ) argument
|
/external/libvpx/vp8/encoder/ |
H A D | encodemb.c | 265 vp8_token_state tokens[17][2]; local 319 tokens[eob][0].rate = 0; 320 tokens[eob][0].error = 0; 321 tokens[eob][0].next = 16; 322 tokens[eob][0].token = DCT_EOB_TOKEN; 323 tokens[eob][0].qc = 0; 324 *(tokens[eob] + 1) = *(tokens[eob] + 0); 338 error0 = tokens[next][0].error; 339 error1 = tokens[nex [all...] |
/external/libxslt/libxslt/ |
H A D | numbers.c | 56 xsltFormatToken tokens[MAX_TOKENS]; member in struct:_xsltFormat 319 xsltFormatPtr tokens) 331 tokens->start = NULL; 332 tokens->tokens[0].separator = NULL; 333 tokens->end = NULL; 346 tokens->start = xmlStrndup(format, ix); 349 for (tokens->nTokens = 0; tokens->nTokens < MAX_TOKENS; 350 tokens 318 xsltNumberFormatTokenize(const xmlChar *format, xsltFormatPtr tokens) argument 424 xsltNumberFormatInsertNumbers(xsltNumberDataPtr data, double *numbers, int numbers_max, xsltFormatPtr tokens, xmlBufferPtr buffer) argument 742 xsltFormat tokens; local [all...] |
/external/quake/quake/src/QW/gas2masm/ |
H A D | gas2masm.c | 39 char tokens[MAX_TOKENS][MAX_TOKEN_LENGTH+1];
variable 109 pt = tokens[tnum];
229 tokens[tnum]);
350 printf (" %s,", tokens[i]);
352 printf (" %s", tokens[tokennum-1]);
359 printf (" %s", tokens[1]);
367 if (tokens[1][0] == '*')
369 printf (" dword ptr[%s]", &tokens[1][1]);
374 len = strlen(tokens[1]);
378 if (tokens[ [all...] |
/external/quake/quake/src/WinQuake/gas2masm/ |
H A D | gas2masm.c | 39 char tokens[MAX_TOKENS][MAX_TOKEN_LENGTH+1];
variable 109 pt = tokens[tnum];
229 tokens[tnum]);
350 printf (" %s,", tokens[i]);
352 printf (" %s", tokens[tokennum-1]);
359 printf (" %s", tokens[1]);
367 if (tokens[1][0] == '*')
369 printf (" dword ptr[%s]", &tokens[1][1]);
374 len = strlen(tokens[1]);
378 if (tokens[ [all...] |
/external/sonivox/arm-fm-22k/lib_src/ |
H A D | eas_imelody.c | 67 static const char* const tokens[] = variable 1473 /* ignore these valid tokens */ 1721 if (tokens[i][j] == 0) 1729 if (tokens[i][j] != ToUpper(buffer[j]))
|
/external/sonivox/arm-hybrid-22k/lib_src/ |
H A D | eas_imelody.c | 67 static const char* const tokens[] = variable 1473 /* ignore these valid tokens */ 1721 if (tokens[i][j] == 0) 1729 if (tokens[i][j] != ToUpper(buffer[j]))
|
/external/sonivox/arm-wt-22k/lib_src/ |
H A D | eas_imelody.c | 67 static const char* const tokens[] = variable 1482 /* ignore these valid tokens */ 1730 if (tokens[i][j] == 0) 1738 if (tokens[i][j] != ToUpper(buffer[j]))
|