/external/google-breakpad/src/processor/ |
tokenize.cc | 47 int max_tokens, 50 tokens->reserve(max_tokens); 52 int remaining = max_tokens; 55 // strip them out before exhausting max_tokens. 69 return tokens->size() == static_cast<unsigned int>(max_tokens);
|
tokenize.h | 42 // Splits line into at most max_tokens tokens, separated by any of the 46 // If more tokens than max_tokens are present, the final token is placed 48 // a side effect. Returns true if exactly max_tokens tokens are returned, 55 int max_tokens,
|
/external/llvm/tools/llvm-c-test/ |
helpers.c | 18 #define MAX_TOKENS 512 23 char *tokbuf[MAX_TOKENS]; 31 while (c < MAX_TOKENS) {
|
/external/freetype/src/psaux/ |
psobjs.h | 90 FT_UInt max_tokens,
|
psobjs.c | 718 FT_UInt max_tokens, 734 T1_Token limit = cur + max_tokens; [all...] |
/external/pdfium/third_party/freetype/src/psaux/ |
psobjs.h | 90 FT_UInt max_tokens,
|
psobjs.c | 724 FT_UInt max_tokens, 740 T1_Token limit = cur + max_tokens; [all...] |
/external/webp/src/utils/ |
huffman_encode.h | 48 HuffmanTreeToken* tokens, int max_tokens);
|
huffman_encode.c | 327 HuffmanTreeToken* tokens, int max_tokens) { 329 HuffmanTreeToken* const ending_token = tokens + max_tokens;
|
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/iterator/ |
token_iterator.hpp | 170 nfp::typed_keyword<std::size_t,struct max_tokens_t > max_tokens; member in namespace:boost::unit_test::__anon28135 213 nfp::optionally_assign( m_tokens_left, m, max_tokens );
|
/external/webp/src/enc/ |
vp8l.c | 326 const int max_tokens = tree->num_symbols; local 334 num_tokens = VP8LCreateCompressedHuffmanTree(tree, tokens, max_tokens); 488 int max_tokens = 0; local 525 if (max_tokens < codes->num_symbols) { 526 max_tokens = codes->num_symbols; 530 tokens = (HuffmanTreeToken*)WebPSafeMalloc(max_tokens, sizeof(*tokens)); 658 int max_tokens = 0; local 665 if (max_tokens < codes->num_symbols) { 666 max_tokens = codes->num_symbols; 669 tokens = (HuffmanTreeToken*)WebPSafeMalloc(max_tokens, [all...] |
/art/cmdline/ |
cmdline_parser.h | 562 size_t max_tokens; local 564 std::tie(min_tokens, max_tokens) = num_tokens; 570 " num tokens in arg_def: " << min_tokens << "," << max_tokens << std::endl; 578 if (best_match_size > max_tokens || best_match_size < min_tokens) { 587 TokenRange exact_range = possible_name.Slice(0, max_tokens);
|
/packages/providers/ContactsProvider/src/com/android/providers/contacts/ |
NameSplitter.java | 48 public static final int MAX_TOKENS = 10; 232 mTokens = new String[MAX_TOKENS]; 236 while (hasMoreTokens() && mEndPointer < MAX_TOKENS) { [all...] |
NameLookupBuilder.java | 38 private String[] mNames = new String[NameSplitter.MAX_TOKENS];
|
/external/freetype/include/internal/ |
psaux.h | 387 FT_UInt max_tokens, [all...] |
/external/pdfium/third_party/freetype/include/internal/ |
psaux.h | 387 FT_UInt max_tokens, [all...] |